Abstract
This paper presents an algorithm for finding a robust routing plan in core networks that takes into consideration network topology, available capacity, traffic demand, and quality of service (QoS) requirements. The algorithm addresses the difficult problem in routing and traffic engineering of optimal path selection. Our approach is inspired by the concept of “between-ness” from graph theory, from which we introduce quantitative metrics for link and path criticality. Paths are ranked according to path criticality and the algorithm tries to avoid placing flows on the most critical paths, maximizes throughput over the short term in the presence of QoS constraints, and attempts to increase the bandwidth of the critical paths for future use. The proposed approach shows promise relative to previous proposals in simulations on benchmark and experimental networks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kar, K., Kodialam, M., Lakshman, T.V.: Minimum Interference Routing of Bandwidth Guaranteed Tunnels with MPLS Traffic Engineering Applications. IEEE Journal on Selected Areas in Communications 18(12), 2566–2579 (2000)
Awduche, D.O., Berger, L., Gan, D., Li, T., Swallow, G., Srinivasan, V.: Extensions to RSVP for LSP tunnels. Internet Draft draf-ietf-mpls-rsvp-lsp-tunnel-04.txt (September 1999)
Suri, S., Waldvogel, M., Warkhede, P.R.: Profile-Based Routing: A New Framework for MPLS Traffic Engineering. In: Smirnov, M., Crowcroft, J., Roberts, J., Boavida, F. (eds.) Quality of Future Internet Services. LNCS, vol. 2156, Springer, Heidelberg (2001)
Freeman, L.C.: Centrality in Networks: I. Conceptual Clarification. Social Networks 1(/79), 215–239 (1978)
Borgatti, L.S.P.: Centrality and Network Flow. Social Networks 27(1), 55–71 (2005)
Kodialam, M., Lakshman, T.V., Sengupta, S.: Efficient and Robust Routing of Highly Variable Traffic. HotNets-III (November 2004)
Guerin, R., Orda, A., Williams, D.: QoS routing mechanisms and OSPF extensions. In: Proceedings of 2nd Global Internet Miniconference (November 1997)
Yilmaz, S., Matta, I.: On the Scalability-Performance Tradeoffs in MPLS and IP Routing. In: Proceedings of SPIE ITCOM (May 2002)
Ott, T., Bogovic, T., Carpenter, T., Krishnan, K.R., Shallcross, D.: Algorithms for Flow Allocation for Multi Protocol Label Switching. MPLS International Conference (October 2000)
Dekker, H., Colbert, B.D.: Network Robustness and Graph Topology. In: Proceedings of 27th Australasian Computer Science Conference, vol. 26, pp. 359-368 (January 2004)
Eppstein, D.: Finding the k Shortest Paths. Society for Industrial and Applied Mathematics (SIAM) Journal of Computing 28(2), 652–673 (1998)
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1999)
Duffield, N.G., Goyal, P., Greenberg, A.G., Mishra, P.P., Ramakrishnan, K.K., Van der Merwe, J.E.: A flexible model for resource management in virtual private network. In: ACM SIGCOMM 1999, ACM Press, New York (1999)
Van Mieghem, P., Kuipers, F.A.: Concepts of Exact QoS Routing Algorithms. IEEE/ACM Transactions on Networking 12(5) (October 2004)
Zhang-Shen, R., McKeown, N.: Designing a Predictable Internet Backbone Networks. HotNet-III (November 2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tizghadam, A., Leon-Garcia, A. (2007). A Robust Routing Plan to Optimize Throughput in Core Networks. In: Mason, L., Drwiega, T., Yan, J. (eds) Managing Traffic Performance in Converged Networks. ITC 2007. Lecture Notes in Computer Science, vol 4516. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72990-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-72990-7_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72989-1
Online ISBN: 978-3-540-72990-7
eBook Packages: Computer ScienceComputer Science (R0)