• DocumentCode
    3622424
  • Title

    Constraint-Based Routing in Traffic Engineering

  • Author

    A. Karaman

  • Author_Institution
  • fYear
    2006
  • fDate
    6/28/1905 12:00:00 AM
  • Firstpage
    1
  • Lastpage
    6
  • 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
  • Keywords
    "Routing","Tellurium","Multiprotocol label switching","Communication system traffic control","Power engineering and energy","Packet switching","Traffic control","Load management","Telecommunication traffic","Life estimation"
  • Publisher
    ieee
  • Conference_Titel
    Computer Networks, 2006 International Symposium on
  • Print_ISBN
    1-4244-0491-6
  • Type

    conf

  • DOI
    10.1109/ISCN.2006.1662507
  • Filename
    1662507