Evaluating Performance of Quality-of-Service Routing in Large Networks

The performance and complexity of QoS routing depends on the complex interaction between a large set of parameters. This paper investigated the scaling properties of source-directed link-state routing in large core networks. The simulation results show that the routing algorithm, network topology, and link cost function each have a significant impact on the probability of successfully routing new connections. The experiments confirm and extend the findings of other studies, and also lend new insight designing efficient quality-of-service routing policies in large networks.

• V. Narasimha Raghavan
• M. Venkatesh
• T. Peer Meera Labbai
• Praveen Dwarakanath Prabhu

• QoS
• Link-State Routing
• Dijkstra
• Path Selection
• Path Computation.

<p>[1] Apostolopoulos.G, Williams.D, Kamat.S, Guerin.R, Orda.A, and Przygienda.T,(1998) &#39;&#39;QoS routing mechanisms and OSPF extensions.&#39;&#39; Request for Comments 2676&#39;&#39;.
[2] Apostolopoulos.G, Guerin.R, Kamat.S, and Tripathi.S, (1998) &#39;&#39;Quality-of-service based routing: A performance perspective,&#39;&#39; in Proceedings of ACM SIGCOMM, (Vancouver, Canada), pp. 17-28.
[3] Cherkassky.B.V, Goldberg A.V. and Radzik.T (1996), &#39;&#39;Shortest-path algorithms: Theory and Experimental Evaluation&#39;&#39;, Mathematical Programming, vol. 73, pp. 129-174.
[4] Chen.S and Nahrstedt.K, (1998) &#39;&#39;An overview of quality of service routing for next-generation high-speed networks: Problems and solutions,&#39;&#39; IEEE Network Magazine, vol. 12, pp. 64-79. World Academy of Science, Engineering and Technology 2 2007258
[5] Cormen.T.H, Leiserson.C.E, and Rivest.R.L, (1990) Introduction to Algorithms. Cambridge, MA (New York): MIT Press (McGraw-Hill).
[6] Crawley.E, Nair.R, Rajagopalan.B, and Sandick.H, (1998) &#39;&#39;A framework for QoS-based routing in the Internet.&#39;&#39; Request for Comments 2386&#39;&#39;.
[7] Floyd.S and Jacobson.V, (1994) &#39;&#39;Synchronization of periodic routing messages,&#39;&#39; IEEE/ACM Transactions on Networking, vol. 2, pp. 122-136.
[8] Ma.Q and Steenkiste.P, (1997) &#39;&#39;Quality-of-service routing for traffic with performance guarantees,&#39;&#39; in Proc. IFIP International Workshop on Quality of Service, (Columbia University, New York), pp. 115-126.
[9] Ma.Q and Steenkiste.P, (1997) &#39;&#39;On path selection for traffic with bandwidth guarantees&#39;&#39;, in Proceedings of IEEE International Conference on Network Protocols, (Atlanta, GA).
[10] Matta.I and Shankar.A.U, (1996) &#39;&#39;Dynamic routing of real-time virtual circuits,&#39;&#39; in Proceedings of IEEE International Conference on Network Protocols, (Columbus, OH), pp. 132-139.
[11] Pornavalai.C, Chakraborty.G, and Shiratori.N, (1997) &#39;&#39;QoS based routing in integrated services packet networks,&#39;&#39; in Proceedings of IEEE International Conference on Network Protocols, (Atlanta, GA).
[12] Shaikh. A, Rexford.J, and Shin.K.G, (1998) &#39;&#39;Efficient precomputation of quality-of-service routes,&#39;&#39; in Proceedings of Workshop on Network and Operating System Support for Digital Audio and Video, pp. 15-27.
[13] Whang.Z and Crowcroft.J, (1996) &#39;&#39;Quality-of-service routing for supporting multimedia applications,&#39;&#39; IEEE Journal on Selected Areas in Communications, vol. 14, pp. 1228-1234.
[14] Zhang.Z, Sanchez.C, Salkewicz.B, and Crawley.E.S, (1997) &#39;&#39;Quality of service extensions to OSPF or quality of service path first routing (QOSPF)&#39;&#39;.</p>