Abstract
We examine various algorithms for calculating quality of service (QoS)-enabled paths spanning multiple autonomous systems (ASs) using the path computation element (PCE) architecture. The problem is divided into two parts. We first calculate an AS path, then the node-by-node path. Using extensive simulation, we compared various AS-path calculation algorithms based on border gateway protocol (BGP) and various AS-aggregation procedures, such as mesh, star and nodal aggregation. For node-to-node path calculation, we employed the per-domain backward algorithm and the per-domain backward tree algorithm (also known as backward recursive PCE-based computation). Results point to the fact that complex AS-path calculation algorithms do not perform significantly better than BGP. However, if the service quality provided by ASs varies greatly, either in time or space, then we expect a QoS-aware AS-path computation algorithm, e.g., static nodal aggregation, to outperform BGP. Although the per-domain backward tree algorithm generally performs better than the per-domain backward algorithm, using a persistent variant of the latter makes it outperform the per-domain backward tree algorithm. The cost is a negligible increase in computational complexity and a slightly increased connection setup delay.
Similar content being viewed by others
References
A path computation element (PCE)-based architecture (2006) RFC 4655
Feamster N, Balakrishnan H, Rexford J, Shaikh A, van der Merwe J (2004) The case for separating routing from routers. Presented at the ACM SIGCOMM workshop on future directions in network architecture. Portland, OR
Shenker S (1995) Fundamental design issues for the future Internet. IEEE J Sel Areas Commun 13(7):1176–1188
Amante S, et al (2006) Inter-provider quality of service. MIT Commun. Futures Program. Cambridge, MA. Available at: http://cfp.mit.edu/docs/interprovider-qos-nov2006.pdf. Accessed 26 June 2007
Internet protocol data communication service—IP packet transfer and availability performance parameters (2007) ITU–T Standard Y.1540
Perros HG (2002) An introduction to ATM networks. Wiley, New York
Perros HG (2005) Connection-oriented networks: SONET/SDH, ATM, MPLS and optical networks. Wiley, New York
Korkmaz T, Krunz M (2001) Multi-constrained optimal path selection. In: Proc. IEEE INFOCOM 2001, vol 2, pp. 834–843
Wang Z (1999) On the complexity of quality of service routing. Inf Process Lett 69(3):111–114
Yiltas D, Perros HG (2009) A composite QoS metric for multi-attribute QoS-based multi-domain routing. Dept. Comput. Sci., NCSU, Raleigh
A backward-recursive PCE-based computation (BRPC) procedure to compute shortest constrained inter-domain traffic engineering label switched paths (2009) RFC 5441
Vasseur J-P, Le Roux J-L (2007) Path computation element (PCE) communication protocol (PCEP). Internet-draft, draft-ietf-pce-pcep-09.txt, The IETF Trust
Geleji G, Perros HG, Xin Y, Beyene T (2008) A performance analysis of inter-domain QoS routing schemes based on path computation elements. Presented at the 5th international symposium on high capacity optical networks and enabling technologies. Penang, Malaysia
Acknowledgement
The authors would like to thank Dr. T. Ling for his helpful comments.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Geleji, G., Perros, H.G. QoS routing across multiple autonomous systems using the path computation element architecture. Ann. Telecommun. 66, 293–306 (2011). https://doi.org/10.1007/s12243-010-0206-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12243-010-0206-y