Abstract
Multi-path routing schemes have the inherent ability of balancing load between paths, and thus play a major role in traffic engineering for optimizing network distribution. The article proposes an algorithm of finding critical multiple paths, which determines paths between each pair of network nodes. The algorithm selects a small number of decisive paths, besides which few benefits can be obtained to balance load. Experiments on backbone networks with real traffic matrixes show the effectiveness of our algorithm in avoiding network congestion in terms of minimizing maximum link load.
This work is supported by the National Natural Science Foundation of China(No. 61002011, 90604019); the Specialized Research Fund for the Doctoral Program of Higher Education(No. 200800131019); the Open Fund of the State Key Laboratory of Software Development Environment(No. SKLSDE-2009KF-2-08), Beijing University of Aeronautics and Astronautics; the National Basic Research Program of China (No.s 2005CB321901, 2009CB320505); the Program for New Century Excellent Talents in University(No.s NECT-07-0109, NECT-08-0739).
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
Altin, A., Fortz, B., Thorup, M., Ümit, H.: Intra-domain traffic engineering with shortest path routing protocols. 4OR 7(4), 301–335 (2009)
Sridharan, A., Guerin, R., Diot, C.: Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks. TON 13(2), 234–247 (2005)
Xu, D., Chiang, M., Chiang, R.J.: DEFT: Distributed Exponentially-Weighted Flow Splitting. In: 26th IEEE International Conference on Computer Communications, pp. 71–79. IEEE Press, New York (2007)
Wang, N., Kin, H.O., Pavlou, G., Howarth, M.: An overview of routing optimization for internet traffic engineering. Communications Surveys Tutorials 10(1), 36–56 (2008)
Kodialam, M., Lakshman, T.V.: Minimum interference routing with applications to MPLS traffic engineering. In: Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 884–893. IEEE Press, New York (2000)
Li, Y., Bai, B., Harms, J., Holte, R.: Multipath oblivious routing for Traffic Engineering - stable and robust routing in changing and uncertain environments. In: Mason, L.G., Drwiega, T., Yan, J. (eds.) ITC 2007. LNCS, vol. 4516, pp. 129–140. Springer, Heidelberg (2007)
Leighton, T., Rai, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46, 787–832 (1999)
Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)
Uhlig, S., Quoitin, B., Lepropre, J., Balon, S.: Providing public intradomain traffic matrices to the research community. SIGCOMM Comput. Commun. Rev. 36, 83–86 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, H., Wang, H., Cheng, S., Chen, S., Lin, Y. (2011). Finding Critical Multiple Paths for Demands to Avoid Network Congestion. In: Zhou, Q. (eds) Theoretical and Mathematical Foundations of Computer Science. ICTMF 2011. Communications in Computer and Information Science, vol 164. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24999-0_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-24999-0_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24998-3
Online ISBN: 978-3-642-24999-0
eBook Packages: Computer ScienceComputer Science (R0)