Abstract
Being an important and yet a challenging problem, the QoS-based routing in the converging Internet has received significant attention from the research community. However, most of the QoS-based routing research is conducted in the context of intra-domain routing, leaving QoS-based inter-domain routing relatively open. In this paper, we focus on QoS-based inter-domain routing and specifically investigate how to enhance the current inter-domain routing protocol (BGP) with QoS extensions. To support multiple QoS metrics, BGP speakers have to advertise multiple routes for each destination. However, this will increase the routing message overhead and make QoS-aware BGP unscalable. To provide scalability without significantly sacrificing the performance, we propose path reduction algorithms called contribution based reduction (CBR) algorithms. Extensive simulations show that the proposed schemes achieve high performance in finding feasible paths with low complexity in terms of message overhead and computation, making the QoS extension to BGP scalable.
Similar content being viewed by others
References
Huitema C. Routing in the Internet. Upper Saddle River, NJ: Prentice Hall, Inc., 1995
Halabi B. Internet Routing Architectures. Las Vegas, NV: Cisco Press, 1997
Moy J. OSPF version 2, Standards Track RFC 2328, IETF, April 1998
Rekhter Y, Li T. A border gateway protocol 4 (BGP-4). Standards Track RFC 1771, IETF, March 1995
Bejerano Y, Breitbart Y, Orda A. Algorithms for computing qos paths with restoration. IEEE/ACM Trans Netw, 2005, 13: 648–661
Crawley E, Nair R, Rajagopalan B, et al. A framework for QoS-based routing in the Internet. Technical Report, RFC 2386, IETF, August 1998
Xiao X, Ni L M. Internet QoS: A big picture. IEEE Netw, 1999, 13: 8–18
Van Mieghem P E, Kuipers F, Korkmaz T, et al. Quality of service routing. In: Smirnov M, Crowcroft J, Roberts J, et al., eds. Quality of Future Internet Services, LNCS 2856. Berlin: Springer, 2003. Ch. 3: 80–117
Guerin R, Orda A, Williams D. QoS routing mechanisms and OSPF extensions. In: GLOBECOM’ 97, Vol. 3, IEEE, Phoenix, Arizona, 1997. 1903–1908
Jacquene C. Providing quality of service indication by the BGP-4 protocol: the QOS NLRI attribute. Technical Report, (draft-jacquenet-qos-nlri-00.txt), IETF, July 2000
Xiao L, Lui K S, Wang J, et al. QoS extension to BGP. In: Proceedings 10th IEEE International Conference on Network Protocols, Paris, France, 2002. 100–109
Bonaventure O. Using BGP to distribute exible QoS information. Technical Report, (draft- bonaventure-bgp-qos-00.txt), IETF, February 2001
Abarbanel B, Venkatachalam S. BGP-4 support for traffic engineering. Technical Report (draft-abarbanel-idr-bgp4-te-00.txt), IETF, September 2000
Fei A, Gerla M. Extending BGMP for shared-tree interdomain qos multicast. In: Proceedings of IWQoS 2001, Karlsruhe, Germany, 2001. 123–139
Wang Z, Crowcroft J. Quality-of-service routing for supporting multimedia applications. IEEE J Select Areas Commun, 1996, 14: 1228–1234
Jaffe J M. Algorithms for finding paths with multiple constraints. Networks, 1984, 14: 95–116
Raz D, Shavitt Y. Optimal partition of QoS requirements with discrete cost functions. In: INFOCOM, Vol. 2, Tel-Aviv, Israel, 2000. 613–622
Lorenz D H, Orda A, Raz D, et al. Efficient QoS partition and routing of unicast and multicast. In: IWQoS 2000, Karlsruhe, 2000. 75–83
Pornavalai C, Chakraborty G, Shiratori N. QoS based routing algorithm in integrated services packet networks. J High Speed Netw, 1998, 7: 99–112
Ma Q, Steenkiste P. Quality-of-service routing for traffic with performance guarantees. In: Proceedings of the Fifth International IFIP Workshop on Quality of Service, Columbia University, 1997. 115–126
De Neve H, Van Mieghem P. A multiple quality of service routing algorithm for PNNI. In: Proceedings of the ATM Workshop, IEEE, Seattle, Washington, USA, 1998. 324–328
Van Mieghem P, Kuipers F. Hop-by-hop quality of service routing. Comput Netw, 2001, 37: 407–423
Korkmaz T, Krunz M. Multi-constrained optimal path selection. In: Proceedings of the INFOCOM 2001 Conference, Vol. 2, IEEE, Anchorage, Alaska, 2001. 834–843
Orda A. Precomputation schemes for qos routing. IEEE/ACM Trans Netw, 2003, 11: 578–591
Yuan X, Liu X. Heuristic algorithms for multi-constrained quality of service routing. In: Proceedings of the INFOCOM 2001 Conference, Vol. 2, IEEE, Anchorage, Alaska, 2001. 844–853
Cui Y, Xu K, Wu J. Precomputation for multi-constrained QoS routing in high-speed Networks. In: Proceedings of the INFOCOM 2003 Conference, San Francisco, 2003, 2: 1414–1424
Kapoor R, Chen L J, Lao L, et al. Capprobe: a simple and accurate capacity estimation technique. SIGCOMM Comput Commun Rev, 2004. 67–78
Dovrolis C, Ramanathan P, Moore D. What do packet dispersion techniques measure? In: Proceedings of IEEE INFOCOM. Anchorage: IEEE Press, 2001. 905–914
Boston University representative Internet topology generator, http://www.cs.bu.edu/brite/.
Waxman B M. Routing of multipoint connections. IEEE JSAC, 1988, 6: 1617–1622
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Cui, Y., Zhao, Y., Korkmaz, T. et al. Supporting multiple metrics in QoS-aware BGP. Sci. China Inf. Sci. 53, 1947–1962 (2010). https://doi.org/10.1007/s11432-010-4066-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11432-010-4066-x