The goal of Traffic Engineering is to optimize the resource utilization and increase the network performance. Constraint-based routing has been proposed as an networks effective approach to implement traffic engineering in Multiprotocol Label Switching. In this thesis, we review several algorithms on constraint-based routing from the literature and point out their advantages and disadvantages. We then propose several algorithms to overcome some of the shortcomings of these approaches. Our algorithms are specifically suitable for large densely connected networks supporting both Quality of Service traffic and the Best Effort traffic. In large networks the size of the MPLS label space in a node may become extremely large. Our algorithms allow for control on the size of the label space for each node in the network. In addition, explicit routes can be accommodated supporting both node and link affinity. We address an algorithm that implements the node and link affinity correctly. If the QoS traffic has stringent delay requirements, a path length limit can be imposed so that the number of hops on the path for such traffic is limited. Finally, we propose the 1 + 1 and 1 : 1 path protection mechanisms using the constraint-based routing in MPLS and establish backup for the working path carrying the primary traffic. Our approach appropriately overcome the problems and the result are satisfying.
| Identifer | oai:union.ndltd.org:LSU/oai:etd.lsu.edu:etd-0828103-110339 |
| Date | 29 August 2003 |
| Creators | Wei, Chung-Yu |
| Contributors | David M. Koppelman, Morteza Naraghi-Pour, Jorge Aravena |
| Publisher | LSU |
| Source Sets | Louisiana State University |
| Language | English |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lsu.edu/docs/available/etd-0828103-110339/ |
| Rights | unrestricted, I hereby grant to LSU or its agents the right to archive and to make available my thesis or dissertation in whole or in part in the University Libraries in all forms of media, now or hereafter known. I retain all proprietary rights, such as patent rights. I also retain the right to use in future works (such as articles or books) all or part of this thesis or dissertation. |
Page generated in 0.0013 seconds