Latest revision as of 10:24, 8 February 2021

Abstract

Traffic engineering (TE) describes a domain-wide perspective for traffic control as opposed to application-specific concerns of QoS. MPLS is today's most powerful architecture for TE. Constraint-based routing refers to the process of path assignment to flows to fulfill the TE objective which has been defined in a number of multi-constraint ways, and is the most significant component of TE. In this paper, we review constraint-based routing algorithms. We first provide an overview of MPLS/TE and place constraint-based routing within this approach. We then look into the potential path attributes and the underlying platform to characterize these algorithms before we present our review. Our study provides a comprehensive reference to the operational structure and specifications of constraint-based routing algorithms. Publisher's Version

Original document

The different versions of the original document can be found in:

• http://xplorestaging.ieee.org/ielx5/11037/34796/01662507.pdf?arnumber=1662507,

http://dx.doi.org/10.1109/iscn.2006.1662507

• http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000001662507,

http://dx.doi.org/10.1109/ISCN.2006.1662507,

https://dblp.uni-trier.de/db/conf/iscn/iscn2006.html#Karaman06,

https://ieeexplore.ieee.org/document/1662507,

https://academic.microsoft.com/#/detail/1997766425

• https://hdl.handle.net/11729/655,

http://dx.doi.org/10.1109/ISCN.2006.1662507