A New Migration Algorithm of Mobile Agent Based on Ant Colony Algorithm in P2P Network

  • Shaozi Li
  • Yang Cao
  • Huowang Chen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4101)


This paper presents our recent research work on Peer to Peer distributed information sharing based on mobile agent. From various perspectives, our work focuses on how to improve information retrieval efficiency in a P2P distributed information sharing system. A new model based on mobile agent is proposed and the new migration algorithm of mobile agent based on ant colony algorithm (ACA) is presented to implement P2P information retrieval. In order to evaluate and validate the model, we built a simulated P2P prototype consisting of a network of peer nodes; mobile agent migrating in the network, making peer nodes communication with each other. The results show some advantages of the proposed approach for the P2P distributed information sharing based on mobile agent.


Information Retrieval Mobile Agent Travel Salesman Problem Distribute Hash Table Task Completion Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Napster Home Page,
  2. 2.
    Kan, G.: Gnutella. In: Oram, A. (ed.) Peer-to-Peer: Harnessing the Benefits of a Disruptive Technology, ch 8. O’Reilly & Associates, Sebastopol (2001)Google Scholar
  3. 3.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: ACM SIGCOMM 2001 (August 2001)Google Scholar
  4. 4.
    Dabek, F., et al.: Building Peer-to-Peer Systems with Chord, a Distributed Lookup Service. In: Proc. of the 8th Workshop on Hot Topics in Operating Systems (HotOS), Schloss Elmau, Germany. IEEE Computer Society, Los Alamitos (2001)Google Scholar
  5. 5.
    Clarke, I., Sandberg, O., Wiley, B., Hong, T.: Freenet: A distributed anonymous information storage and retrieval system. In: Faderrath, H. (ed.) Proc. of the ICSI Workshop on Design Issues in Anonymity and Unobservability, Int’l. Computer Science Institute, Berkeley, pp. 43–58 (2000)Google Scholar
  6. 6.
    Colorni, A., Drigo, M., Maniezzo, V.: Distributed optimization by ant colonies. In: Proc. 1st European Conf. Artificial Life, Pans, France, pp. 134–142. Elsevier, Amsterdam (1991)Google Scholar
  7. 7.
    Colorni, A., Dorigo, M., Maniezzo, V.: An investigation of some properties of an ant algorithm. In: Proc. PPSN 1992, London, pp. 509–520 (1992)Google Scholar
  8. 8.
    Dorigo, M., Gambardella, L.M.: Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation 1(1), 53–66 (1997)CrossRefGoogle Scholar
  9. 9.
    Stutzle, T., Hoos, H.H.: MAX-MIN ant system and local search for the traveling salesman problem. In: IEEE Int’l. Conf. On Evolutionary Computation, pp. 309–314. IEEE Press, Indianapolis (1997)Google Scholar
  10. 10.
    Huang, G.R., Cao, X.B., Wang, X.F.: An ANT Colony Optimization Algorithm Based on Pheromone Diffusion. ACTA ELECTRONICA SINICA 32(5), 865–868 (2004)Google Scholar
  11. 11.
    Ling, B., Lu, Z.G., Wee-Siong, N.g., Qian, W.N., Zhou, A.Y.: PeerIS: A peer-to-peer based information retrieval system. Journal of Software 15(9), 1375–1384 (2004)MATHGoogle Scholar
  12. 12.
    Babaoglu, O., Meling, H., Montresor, A.: Anthill: A Framework for the Development of Agent-Based Peer-to-Peer System. In: Proc. 22nd ICDCS 2002, Vienna, Austria (July 2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Shaozi Li
    • 1
    • 2
  • Yang Cao
    • 1
  • Huowang Chen
    • 2
  1. 1.Department of Computer ScienceXiamen UniversityXiamenChina
  2. 2.School of ComputerNational University of Defence TechnologyHunanChina

Personalised recommendations