Efficient distributed QoS routing protocol for MPLS networks

This paper proposes a new distributed QoS routing protocol, called Efficient Distributed QoS Routing (EDQR), for MPLS networks. The path searching algorithm of EDQR considers an additional parameter to select the optimal path from limited choices, and its implementation requires both source and destination of a connection request to make the routing decision. Our simulation results show that, the operation cost of EDQR is much lower than other popular QoS routing protocols but with very similar network performance. Especially, the network performance of our protocol is better when the network loading is high. Moreover, we develop a very simple mathematical model to investigate the upper bound of the size of limited choices for engineering design.