Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published April 2001 | Published
Book Section - Chapter Open

MATE: MPLS adaptive traffic engineering

Abstract

Destination-based forwarding in traditional IP routers has not been able to take full advantage of multiple paths that frequently exist in Internet service provider networks. As a result, the networks may not operate efficiently, especially when the traffic patterns are dynamic. This paper describes a multipath adaptive traffic engineering mechanism, called MATE, which is targeted for switched networks such as multiprotocol label switching (MPLS) networks. The main goal of MATE is to avoid network congestion by adaptively balancing the load among multiple paths based on measurement and analysis of path congestion. MATE adopts a minimalist approach in that intermediate nodes are not required to perform traffic engineering or measurements besides normal packet forwarding. Moreover MATE does not impose any particular scheduling, buffer management, or a priori traffic characterization on the nodes. This paper presents an analytical model, derives a class of MATE algorithms, and proves their convergence. Several practical design techniques to implement MATE are described. Simulation results are provided to illustrate the efficacy of MATE under various network scenarios.

Additional Information

© 2001 IEEE.

Attached Files

Published - 00916625.pdf

Files

00916625.pdf
Files (269.9 kB)
Name Size Download all
md5:c1b193c7b3cfd051a9677340ee022a52
269.9 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 17, 2023