Reducing traffic fluctuations of link state QoS routing algorithms in virtual circuit networks

Quality of Service (QoS) routing methods are expected to replace existing intradomain routing protocols in future QoS-based data networks. QoS routing allows the selection of feasible paths for connections requiring QoS support. Link state QoS routing performs path selection based on traffic parameters carried within the requests and information about available network resources provided by link state advertisements. A good link state QoS routing method should efficiently utilise networking resources and should incur little overhead in spreading information about resource availability.When a network implements load sensitive routing, traffic fluctuations are often observed which give rise to routing instability. This results in poor route selection and an overall degradation of network performance. Such oscillatory behaviour may be expected in datagram networks, because of their rapid response to routing updates, but it is not peculiar to them. It also affects virtual circuit networks, when the update interval is comparable with the average duration of a connection.In this paper we present methods for reducing this effect in virtual circuit networks. The first method--ALCFRA (Adaptive Link Cost Function Routing Algorithm) can be used in networks with sparse connectivity, while the second algorithm--CAR (Connectivity Aware Routing) is designed to work well in the majority of network topologies. Such methods improve the routing stability, which in turn leads to a higher acceptance ratio of arriving connections. The route selection improvements presented in this paper not only stabilise the link state QoS routing methods, but also achieve excellent performance over a variety of network topologies.

[1]  Anja Feldmann,et al.  Characteristics of TCP Connection Arrivals , 2002 .

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

[3]  Norio Shiratori,et al.  QoS based routing algorithm in integrated services packet networks , 1997, Proceedings 1997 International Conference on Network Protocols.

[4]  Sally Floyd,et al.  Why we don't know how to simulate the Internet , 1997, WSC '97.

[5]  Anees Shaikh,et al.  Evaluating the impact of stale link state on quality-of-service routing , 2001, TNET.

[6]  Karol Kowalik,et al.  Should QoS routing algorithms prefer shortest paths? , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[7]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[8]  Serge A. Plotkin,et al.  Routing and admission control in general topology networks with Poisson arrivals , 1995, SODA '96.

[9]  A. Khanna,et al.  The revised ARPANET routing metric , 1989, SIGCOMM 1989.

[10]  Sally Floyd,et al.  Difficulties in simulating the internet , 2001, TNET.

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

[12]  Anja Feldmann,et al.  Fitting mixtures of exponentials to long-tail distributions to analyze network performance models , 1997, Proceedings of INFOCOM '97.

[13]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

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

[15]  Yossi Azar,et al.  Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[16]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[17]  Lixia Zhang,et al.  Resource ReSerVation Protocol (RSVP) - Version 1 Functional Specification , 1997, RFC.

[18]  Karol Kowalik,et al.  Connectivity aware routing - a method for finding bandwidth constrained paths over a variety of network topologies , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

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

[20]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[21]  Scott Shenker,et al.  Integrated Services in the Internet Architecture : an Overview Status of this Memo , 1994 .

[22]  Jon Crowcroft,et al.  Analysis of shortest-path routing algorithms in a dynamic network environment , 1992, CCRV.

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

[24]  Dimitri P. Bertsekas,et al.  Dynamic behavior of shortest path routing algorithms for communication networks , 1982 .

[25]  Ibrahim Matta,et al.  Dynamic routing of real-time virtual circuits , 1996, Proceedings of 1996 International Conference on Network Protocols (ICNP-96).

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

[27]  K. G. Ramakrishnan,et al.  On-line routing for permanent virtual circuits , 1996, Comput. Commun..