Abstract
A new ant-algorithm-based routing approach is proposed for the VC routing problem with considering the comprehensive effect between the resource utilization and the load balance in ATM networks. In the approach, the backup paths are calculated first, and then an ant algorithm based on the ability of ants to find the shortest path between their nest and the food source during their searching food, is constructed to optimize the VC global route. Simulation results show that the proposed approach can realize VC routing effectively according to the current traffic states in the networks and the user-specified delay requirements.
Similar content being viewed by others
References
Sanghyun A. Virtual Path Layout Design in ATM Networks.Proc IEEE Infocom'94. Canada: Toronto, June, 1994. 192–200.
Murakami K, Kim H S. Virtual Path Routing for survirable ATM networks.IEEE Trans on Networking, 1996,4(1): 22–39.
Hwang Ren-hung. LLR Routing in Homogeneous VP-based ATM Networks.Proc. IEEE Infocom'95. USA: Boston, April, 1995. 593–597.
Hou C J. Routing Virtual Circuit with Timing Requirements in Virtual Path Based ATM Networks.Proc. IEEE Infocom'96, 1996. 320–328.
Dorigo M, Gambardella L M. Ant Colony System: a Cooperative Learning Approach to the Traveling Salesman Problem.IEEE Trans on Evolutionary Computation, 1997,1(1): 53–66.
Beckers R, Deneubourg J L, Goss S. Trail and UTurns in the Selection of the Shortest Path by the ant Lasius Niger.J Theoretical Biology, 1992,159: 397–415.
Author information
Authors and Affiliations
Additional information
Foundation item: Supported by Shanghai Post & Telecom Administration-SJTU Information and Telecom Joint Lab Project (1999-GR1-3)
Biography: Li Sheng-hong (1971-), male, Postdoctor, research direction: intelligent technology application in broadband networks and statistical signal processing.
Rights and permissions
About this article
Cite this article
Sheng-hong, L., Xin-hua, D., Hong-wen, Z. et al. A new approach to VC routing in ATM networks. Wuhan Univ. J. Nat. Sci. 5, 329–333 (2000). https://doi.org/10.1007/BF02830148
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02830148