Abstract
The delay constrained least cost path problem with imprecise delay information is discussed, and a distributed heuristic algorithm without any assumption of imprecise state information is presented. The algorithm employs mobile agents to search feasible paths in parallel and requires limited network state information kept at each node. The simulations indicate that the presented solution provides better call acceptance probability and better fairness between short paths and long paths. And the algorithm can tolerate high degree of delay imprecision.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Apostolopoulos G, Guerin R, Kamat S,et al. Quality-of-Service Based Routing: A Performance Perspective.Computer Communication Review, 1998,28(4):17–28.
Chen S, Nahrstedt K. An Overview of Quality-of-Service Routing for the Next Generation High-Speed Networks: Problems and Solutions.IEEE Network, 1998,12(6):64–79.
Guerin R, Orda A. Networks with Advance Reservations: the Routing Perspective.Proceeding of IEEE INFOCOM2000. Piscataway, NJ: IEEE, 2000, (1): 118–127.
Garey M R, Johnson D S.Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W H Freeman and Co, 1979.
Wang Z, Crowcroft J C. Quality-of-Service Routing for Supporting Multimedia Applications.IEEE JSAC, 1996,14 (7):1228–1234.
Chen S, Nahrstedt K. On Finding Multi-Constrained Paths.Proceeding of IEEE ICC98. New York: IEEE Society, 1998. 874–879.
Salama H F, Reeves D S, Viniotis Y. A Distributed Algorithm for Delay-Constrained Unicast Routing.Proceeding of IEEE INFOCOMM97. Los Alamitos, CA: IEEE, 1997. 84–91.
Sriram R, Manimaran G, Siva-Ram-Murthy C. Preferred Link Based Delay-Constrained Least-Cost Routing in Wide Area Network.Computer Communications, 1998,21(10): 1655–1669.
Chen S, Nahrstedt K. Distributed QoS Routing with Imprecise State Information.Proceeding of ICCCN98. Los Alamitos, CA: IEEE Society, 1998. 614–621.
Gurin R, Orda A. QoS Routing in Networks with Inaccurate Information: Theory and Algorithms.IEEE/ACM Trans Networking, 1999,7(3):350–364.
Yuan X, Zheng W, Ding S. A comparative study of QoS routing schemes that tolerate imprecise state information.Proceeding of IEEE ICCCN2002. Piscataway, NJ: IEEE, 2002. 230–235.
Author information
Authors and Affiliations
Corresponding authors
Additional information
Foundation item: Supported by the Science and Technology Research Project of Construstion Department (03-2-043)
Biography: JIN Xin (1975-), male, Ph. D. candidate, research direction: IP networks, IP routing algorithms.
Rights and permissions
About this article
Cite this article
Xin, J., Xian-de, L. & Shi-yuan, X. An algorithm based on mobile agent for delay constrained least cost unicast routing. Wuhan Univ. J. Nat. Sci. 10, 862–866 (2005). https://doi.org/10.1007/BF02832428
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02832428