Comparison of Multipath Schemes for Hybrid Models in MPLS
Kyeongja Lee (Ecole Centrale de Lille, France), Armand Toguyeni (Ecole Centrale de Lille, France) and Ahmed Rahmani (Ecole Centrale de Lille, France)
Copyright: © 2008
Congestion is derived from insufficient network resources and unbalanced traffic distribution. To treat today’s greedy applications, adding more bandwidth to networks is not the solution for solving the congestion problems in the long term. There are two main approaches to improve quality of service (QoS) of actual network: QoS routing and traffic engineering (Wang, 2001). QoS routing searches the paths by constraint-based routing for better delivery of traffic and is serviced to attract more customers, while traffic engineering aims to reduce congestions and to improve resource utilization through the network by carefully managing the traffic distribution inside a network (Wang, 2001).
Key Terms in this Chapter
Oscillation: A periodic movement back and forth between two extreme limits.
Traffic Engineering: Traffic engineering uses statistical techniques such as queuing theory to predict and engineer the behavior of telecommunications networks such as telephone networks or the Internet.
Exponential Distribution: In probability theory and statistics, the exponential distribution is a class of continuous probability distribution. It is often used to model the time between events that happen at a constant average rate.
Ingress Router: Routers on the incoming edge of the MPLS network.
MPLS (Multi-Protocol Label Switching): A method used to increase the speed of network traffic flow by inserting information about a specific path the packet is taking to its destination. This saves the time needed for a router to look up the address for the next node that the packet is supposed to be sent to.
LSP: Label Switched Paths is a set of hops across a number of MPLS nodes.
DiffServ: Differentiated Services is architecture for providing different types or levels of service for network traffic. Flows are aggregated in the network, so that core routers only need to distinguish a comparably small number of aggregated flows.
Complexity: In computer science, complexity measures the number of cycles to achieve an algorithm. Congestion