Edge distributed admission control in MPLS networks

This paper proposes a novel approach for admission control in traffic engineered data networks, which applies at network edges by means of dynamic thresholds evaluated on the basis of network status. The proposed method is described with focus on IP/MPLS networks, but it actually applies as well to a variety of scenarios, such as ATM or generalized MPLS. The proposed solution allows more efficient usage of network resources, especially at medium/high load, and increased robustness of the network.

[1]  Ariel Orda,et al.  QoS routing: the precomputation perspective , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[2]  Marco Mellia,et al.  An Adaptive Routing Algorithm for Best-effort Traffic in Integrated-Services Networks , 1999 .

[3]  Angela L. Chiu,et al.  Overview and Principles of Internet Traffic Engineering , 2002, RFC.

[4]  Sally Floyd,et al.  Difficulties in simulating the internet , 2001, TNET.

[5]  Bo Wen,et al.  Routing, wavelength and time-slot assignment in time division multiplexed wavelength-routed optical WDM networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[6]  David Eppstein,et al.  Finding the k shortest paths , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[7]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[8]  Jim Boyle,et al.  Applicability Statement for Traffic Engineering with MPLS , 2002, RFC.

[9]  Daniel O. Awduche,et al.  Requirements for Traffic Engineering Over MPLS , 1999, RFC.