ACO-Based Search Algorithm in Unstructured P2P Network

Flooding-based search mechanism has been used extensively in unstructured peer-to-peer network such as Gnutella, but the mechanism is not scalable and as a consequence, it consumes a high amount bandwidths and resources. In order to solve the problems, an ACO-based search algorithm is used in this paper. By introducing Ant Colony Optimization, each peer maintains routing table, which store the amount of pheromone corresponding to classification dropped at the link. Based on the pheromone values, a query is flooded to those peers which are most likely to be resources owner. The update of phenomenon depends on the number of documents found and the link cost in query by all ants' collective cooperation. Simulation results show that, compared with Modified-BFS mechanism, the ACO-based search algorithm can effectively improve the search performance, and becomes better than the Modified-BFS as the peers optimize their routing tables while using a much smaller number of messages.

[1]  Marco Dorigo,et al.  The ant colony optimization meta-heuristic , 1999 .

[2]  Marco Dorigo,et al.  Ant Colonies for Adaptive Routing in Packet-Switched Communications Networks , 1998, PPSN.

[3]  G. Di Caro,et al.  Ant colony optimization: a new meta-heuristic , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[4]  Edith Cohen,et al.  Replication strategies in unstructured peer-to-peer networks , 2002, SIGCOMM.

[5]  Marco Dorigo,et al.  Ant algorithms and stigmergy , 2000, Future Gener. Comput. Syst..

[6]  Hector Garcia-Molina,et al.  Improving Search in Peer-to-Peer Systems , 2001 .

[7]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[8]  Thomas Stützle,et al.  Ant Colony Optimization: Overview and Recent Advances , 2018, Handbook of Metaheuristics.

[9]  Hector Garcia-Molina,et al.  Designing a super-peer network , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

[10]  Christos Gkantsidis,et al.  Random walks in peer-to-peer networks , 2004, IEEE INFOCOM 2004.

[11]  G. Theraulaz,et al.  Inspiration for optimization from social insect behaviour , 2000, Nature.

[12]  Ganesh K. Venayagamoorthy,et al.  Computational Intelligence in Wireless Sensor Networks: A Survey , 2011, IEEE Communications Surveys & Tutorials.

[13]  Hector Garcia-Molina,et al.  Improving search in peer-to-peer networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[14]  Bruce M. Maggs,et al.  Efficient content location using interest-based locality in peer-to-peer systems , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[15]  Marco Dorigo,et al.  AntNet: Distributed Stigmergetic Control for Communications Networks , 1998, J. Artif. Intell. Res..

[16]  Dimitrios Gunopulos,et al.  A local search mechanism for peer-to-peer networks , 2002, CIKM '02.

[17]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[18]  Takashige Hoshiai,et al.  Decentralized Meta-Data Strategies: Effective Peer-to-Peer Search , 2003 .

[19]  ShenkerScott,et al.  Search and replication in unstructured peer-to-peer networks , 2002 .

[20]  Léon J. M. Rothkrantz,et al.  Ant-Based Load Balancing in Telecommunications Networks , 1996, Adapt. Behav..

[21]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[22]  Ion Stoica,et al.  The Case for a Hybrid P2P Search Infrastructure , 2004, IPTPS.

[23]  Kwang Mong Sim,et al.  Ant colony optimization for routing and load-balancing: survey and new directions , 2003, IEEE Trans. Syst. Man Cybern. Part A.

[24]  Christos Gkantsidis,et al.  Hybrid search schemes for unstructured peer-to-peer networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[25]  Jan-Ming Ho,et al.  AntSearch: An Ant Search Algorithm in Unstructured Peer-to-Peer Networks , 2006, ISCC.

[26]  Hein Meling,et al.  Anthill: a framework for the development of agent-based peer-to-peer systems , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[27]  Gerti Kappel,et al.  Using taxonomies for content-based routing with ants , 2007, Comput. Networks.