Multiple path routing in networks with inaccurate link state information

We study a collection of K-shortest path routing schemes and investigate their performance under a diverse set of network topologies and traffic conditions. We subsequently demonstrate that K-shortest path routing offers a lower blocking probability and more balanced link utilisation than other routing methods. With the proposed approach, it is possible to reduce the frequency of link state exchange, and the incurred bandwidth overhead, without sacrificing the overall performance of the network.

[1]  Qingming Ma.  Quality-of-Service Routing in Integrated Services Networks , 1998 .

[2]  David Eppstein,et al.  Finding the k shortest paths , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[3]  Anees Shaikh,et al.  Dynamics of quality-of-service routing with inaccurate link-state information , 1997, ICNP 1997.

[4]  Peter Steenkiste,et al.  On path selection for traffic with bandwidth guarantees , 1997, Proceedings 1997 International Conference on Network Protocols.

[5]  Marta M. B. Pascoal,et al.  The k Shortest Paths Problem , 1998 .

[6]  Jeffrey M. Jaffe,et al.  Algorithms for finding paths with multiple constraints , 1984, Networks.

[7]  Klara Nahrstedt,et al.  An overview of quality of service routing for next-generation high-speed networks: problems and solutions , 1998, IEEE Netw..

[8]  Nageswara S. V. Rao,et al.  QoS routing via multiple paths using bandwidth reservation , 1998 .

[9]  Ariel Orda,et al.  QoS routing in networks with inaccurate information: theory and algorithms , 1999, TNET.

[10]  Ariel Orda,et al.  QoS based routing in networks with inaccurate information: theory and algorithms , 1997, Proceedings of INFOCOM '97.

[11]  Roch Guérin,et al.  Implementation and performance measurements of QoS routing extensions to OSPF , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[12]  Raphael Rom,et al.  Multi-path routing combined with resource reservation , 1997, Proceedings of INFOCOM '97.

[13]  Vladimir A. Bolotin.  Modeling call holding time distributions for CCS network design and performance analysis , 1994, IEEE J. Sel. Areas Commun..

[14]  Ariel Orda,et al.  QoS Routing Mechanisms and OSPF Extensions , 1999, RFC.

[15]  Joseph Y. Hui,et al.  Load-Balanced K-Shortest Path Routing for Circuit-Switched Networks , 1992 .

[16]  Hui Zhang,et al.  Service disciplines for guaranteed performance service in packet-switching networks , 1995, Proc. IEEE.

[17]  Satish K. Tripathi,et al.  Intradomain QoS routing in IP networks: a feasibility and cost/benefit analysis , 1999, IEEE Netw..

[18]  Peter Steenkiste,et al.  Quality-of-Service Routing for Traffic with Performance Guarantees , 1997 .

[19]  Satish K. Tripathi,et al.  Quality of service based routing: a performance perspective , 1998, SIGCOMM '98.