Abstract
This paper describes a routing algorithm for risk-scanning agents using ant colony algorithm in P2P (peer-to peer) network. Every peer in the P2P network is capable of updating its routing table in a real-time way, which enables agents to dynamically and automatically select, according to current traffic condition of the network, the global optimal traversal path. An adjusting mechanism is given to adjust the routing table when peers join or leave. By means of exchanging pheromone intensity of part of paths, the algorithm provides agents with more choices as to which one to move and avoids prematurely reaching local optimal path. And parameters of the algorithm are determined by lots of simulation testing. And we also compare with other routing algorithms in unstructured P2P network in the end.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Angelo Sotira. What is Gnutella [EB/OL]. [2006-01-12].http://www.gnutella.com.
Hoover. What is Napster?—A World Definition from the Webopedia Computer [EB/OL]. [2006-01-12].http://www.-webopedia.com/TERM/N/Napster.html.
Ron C Koren. Stream Theory Completes Merger with Endeavors Technology [EB/OL]. [2005-05-19].http://www.endeavors.com.
Antony I T, Rowstron, Druschel P. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems [C]//Proceedings of the IFIP/ACM International Conference on Distributed Systems Plat forms. Heidelberg, Nov. 2001.
Stoisa I. Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications [C]//Proceedings of the IFIP/ACM International Conference on Distributed Systems Plat forms. Heidelberg, San Diego, CA, 2001: 149–160.
Wang Dan. A Resource Discovery Model Based on Multi-Agent Technology in P2P System [C]//Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology. Beijing, China, September 20–24, 2004.
Pang Xiaolin, Catania Barbara, Tan Kian-Lee. Securing Your Data in Agent-Based P2P Systems [C]//Proceedings of the Eighth International Conference on Database Systems for Advanced Applications. Kyoto, Japan, March 26–28, 2003.
Colomi A, Dorigo M, Maniezzo V. Distributed Optimization by Ant Colonies [C]//Proceeding of The First European Conference Artificial Life, 1991,1(5):134–142.
Dorigo M, Maniezzo V, Colomi A. The Ant System: Optimization by A Colony of Cooperating Agents [J].IEEE Transaction on System, 1996,26(1):1–26.
Dorigo M, Gambardella L M. Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem [J].IEEE Transaction on Evolutionary Computing 1997,1 (1):53–56.
Colomi A, Dorigo M, Maniezzo V. An Investigation of Some Properties of an “Ant Algorithm” [C]//Proceedings of the Parallel Problem Solving from Nature Conference. Brussels, Belgium: Elsevier Publishing, 1992:509–520.
Dorigo M, Cargo G D, Gambardella L M.Ant Algorithm for Distributed Discrete Optimization [R]. Technical Report 98-10 IRIDIA, University Libre de Brexelles, 1998.
Bao Xiuguo, Fang Binxing, Hu Mingzhen,et al. Heterogeneous Search in Unstructured Peer-to-Peer Networks [J].IEEE Distributed System Online, 2005,6(2):1541–4922.
Author information
Authors and Affiliations
Corresponding author
Additional information
Foundation item: Supported by the National Natural Science Foundation of China (60403027), Natural Science Foundation of Hubei Province (2005ABA258), and the Opening Foundation of State Key Laboratory of Software Engineering (SKLSE05-07)
Biography: TANG Zhuo (1981-), male, Ph. D. candidate, research direction: security for distributed system.
Rights and permissions
About this article
Cite this article
Zhuo, T., Zhengding, L. & Ruixuan, L. A routing algorithm for risk-scanning agents using ant colony algorithm in P2P network. Wuhan Univ. J. Nat. Sci. 11, 1097–1103 (2006). https://doi.org/10.1007/BF02829217
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02829217