Scalability of routing advertisement for QoS routing in an IP network with guaranteed QoS

In this paper, we are going to focusing on the scalability of routing advertisement schemes for establishing connections with on demand end-to-end QoS requirements. The correctness of QoS-based routing mainly depends on the accuracy of routing information such as link residual bandwidth. Advertising network resource availability could introduce the routing scalability problem, due to its frequent change. Within each routing area, each router needs to constantly advertise its resource availability information and this information is flooded into the entire routing domain. We investigate the trade-off between scalability and correctness of QoS routing. We consider periodic and dynamic (threshold and exponential-class) intra-domain QoS routing advertisement schemes combined with the use of a clamp down timer. We propose a simple "crankback with cache" scheme by modifying the traditional crankback, and compare their effects on different situations. We define a performance metric to reflect the correctness for each scheme. Our measurement aims to evaluate the correctness and scalability in the environment of inter-domain QoS routing. Using our simulations, we provide heuristic solutions of achieving good performance and scalability for implementing QoS routing.

[1]  Eric S. Crawley,et al.  A Framework for QoS-based Routing in the Internet , 1998, RFC.

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

[3]  Ariel Orda.  Routing with end-to-end QoS guarantees in broadband networks , 1999, TNET.

[4]  Hui Zhang,et al.  WF/sup 2/Q: worst-case fair weighted fair queueing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

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

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

[7]  Hiroshi Suzuki,et al.  QOS aggregation algorithms in hierarchical ATM networks , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[8]  A. Orda,et al.  QoS routing mechanisms and OSPF extensions , 1997, GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record.

[9]  Lixia Zhang,et al.  Virtual Clock: A New Traffic Control Algorithm for Packet Switching Networks , 1990, SIGCOMM.

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

[11]  Raif O. Onvural,et al.  Algorithm for efficient generation of link-state updates in ATM networks , 1997, Comput. Networks ISDN Syst..

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

[13]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

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

[15]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[16]  Anees Shaikh,et al.  Evaluating the overheads of source-directed quality-of-service routing , 1998, Proceedings Sixth International Conference on Network Protocols (Cat. No.98TB100256).

[17]  Ariel Orda,et al.  Routing with end to end QoS guarantees in broadband networks , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[18]  Scott Shenker,et al.  Specification of Guaranteed Quality of Service , 1997, RFC.