Accession Number:

ADA461697

Title:

A Traffic Engineering Approach based on Minimum-Delay Routing

Descriptive Note:

Conference paper

Corporate Author:

CALIFORNIA UNIV SANTA CRUZ DEPT OF COMPUTER ENGINEERING

Report Date:

2000-01-01

Pagination or Media Count:

7.0

Abstract:

Single-path routing provided by todays widely used IGPs such as RIP make extremely inefficient usage of network bandwidth, and is evident in the large end-to-end delays flows experience in single-path routing as compared to minimum-delay routing. Enhancement to OSPF such as optimized multipath have not proved to be adequate to bridge this large delay gap. Practical implementation of minimum-delay routing, on the other hand, have been largely unsuccessful for reasons such as scalability, slow convergence and out-of-order packet delivery. This paper proposes a traffic engineering solution that for a given long-term traffic matrix adapts the minimum-delay routing to the backbone networks which is practical and is suitable to implement in a Differential Services framework. A simple scalable packet forwarding technique is introduced that distinguishes between datagram and traffic that requires in-order delivery and forwards them accordingly and efficiently. Using simulations we show that the delays obtained are comparable to minimum delays and far better than single-path routing.

Subject Categories:

  • Computer Systems
  • Radio Communications

Distribution Statement:

APPROVED FOR PUBLIC RELEASE