Abstract
The self-optimization of network resource utilization is one of the important goals for Internet Traffic Engineering. To achieve this goal, many label switched path selection solutions are proposed. However, there are two drawbacks in these solutions. First, they are computationally expensive because they identify the critical links based on the maxflow algorithm. Second, they do not consider the self-demand of the current request when trying to avoid the interference. In this paper, we propose a novel Autonomic Interference Avoidance (AIA) algorithm, which autonomically selects the path with the least interference with the future requests, to overcome these shortcomings. First, AIA identifies the critical links in the shortest paths found by the Shortest Path First (SPF) algorithm, instead of the computationally expensive maxflow algorithm. Second, we introduce the competitive principle to take into account the self-demand of the current request as well as the network status. Therefore, AIA achieves both high resource efficiency and low computation complexity.
Supported by: (1) The National Natural Science Foundation of China (No. 60403035); (2) The National Major Basic Research Program of China (No. 2003CB314801); (3) The National Science Foundation under grants ANI-0125653 and NeTS-NBD 0519999.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Awduche, D., Chiu, A., Elwalid, A., Widjaja, I., Xiao, X.: Overview and Principles of Internet Traffic Engineering. RFC3272 (May 2002)
Awduche, D., Malcolm, J., Agogbua, J., O’Dell, M., McManus, J.: Requirements for Traffic Engineering Over MPLS. RFC2702 (September 1999)
Swallow, G.: MPLS advantages for traffic engineering. IEEE Communications Magazine 37(12), 54–57 (1999)
Gupta, A., Kumar, A., Thorup, M.: Routing II: Tree based MPLS routing. In: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures (June 2003)
Constraint-Based LSP Setup using LDP. rfc3212 (January 2002)
Apostolopoulos, G., Kama, S., Williams, D., Guerin, R., Orda, A., Przygienda, T.: QoS Routing Mechanisms and OSPF Extensions. RFC 2676 (August 1999)
Kodialam, M., Lakshman, T.V.: Minimum Interference Routing with Applications to MPLS Traffic Engineering. In: INFOCOM 2000, vol. 2, pp. 884–893 (2000)
Kar, K., Kodialam, M., Lakshman, T.V.: MPLS traffic engineering using enhanced minimum interference routing: An approach based on lexicographic max-flow. In: Proceedings of Eighth International Workshop on Quality of Service (IWQoS), Pittsburgh, USA, June 2000, pp. 105–114 (2000)
Wang, X.S.B., Chen, C.: A New Bandwidth Guaranteed Routing Algorithm for MPLS Traffic Engineering. In: IEEE International Conference on Communications, vol. 2, pp. 1001–1005 (2002)
Capone, A., Fratta, L., Martignon, F.: Virtual Flow Deviation: Dynamic Routing of Bandwidth Guaranteed Connections. In: Ajmone Marsan, M., Listanti, G.C.M., Roveri, A. (eds.) QoS-IP 2003. LNCS, vol. 2601, pp. 592–605. Springer, Heidelberg (2003)
Suri, S., Waldvogel, M., Bauer, D., Warkhede, P.R.: Profile-based routing and traffic engineering. Computer Communications 26, 351–365 (2003)
Szeto, W., Boutaba, R., Iraqi, Y.: Dynamic Online Routing Algorithm for MPLS Traffic Engineering. In: Gregori, E., Conti, M., Campbell, A.T., Omidyar, G., Zukerman, M. (eds.) NETWORKING 2002. LNCS, vol. 2345, pp. 936–946. Springer, Heidelberg (2002)
Kumar, D., Kuri, J., Kumar, A.: Routing Guaranteed Bandwidth Virtual Paths with Simultaneous Maximization of Additional Flows. In: IEEE International Conference on Communications, vol. 3, pp. 1759–1764 (2003)
Bagula, A.B., Botha, M., Krzesinski, A.E.: Online traffic engineering: the least interference optimization algorithm. In: IEEE International Conference on Communications(ICC), June 20-24, vol. 2, pp. 1232–1236 (2004)
Stellenbosch,, Cape, W., Africa, S.: Hybrid traffic engineering:the least path interference algorithm. In: ACM International Conference Proceeding Series, vol. 75, pp. 89–96 (2004)
Iliadis, I., Bauer, D.: A new class of online minimum interference routing algorithms. In: Gregori, E., Conti, M., Campbell, A.T., Omidyar, G., Zukerman, M. (eds.) NETWORKING 2002. LNCS, vol. 2345, pp. 959–971. Springer, Heidelberg (2002)
Figueiredo, B., da Fonseca, L.S., Monteiro, A.S.: A Minimum Interference Routing Algorithm. In: IEEE International Conference on Communications(ICC), 20-24, vol. 4, pp. 1942–1947 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cui, Y., Che, H., Lagoa, C., Zheng, Z. (2006). Autonomic Interference Avoidance with Extended Shortest Path Algorithm . In: Yang, L.T., Jin, H., Ma, J., Ungerer, T. (eds) Autonomic and Trusted Computing. ATC 2006. Lecture Notes in Computer Science, vol 4158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11839569_6
Download citation
DOI: https://doi.org/10.1007/11839569_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38619-3
Online ISBN: 978-3-540-38622-3
eBook Packages: Computer ScienceComputer Science (R0)