Efficient Search and Lookup in Unstructured P2P Overlay Networks Inspired by Swarm Intelligence

Finding an efficient way to locate incomplete data in complex distributed systems is a challenging task and, due to dynamic nature of the Internet, requires to be updated constantly. As the problem refers to selection of an efficient search algorithm, different types of algorithms are proposed up to now. A huge complexity and dynamics presented in such systems imply a necessity of usage of an intelligent, self-organized solution. However, such intelligent algorithm should not possess an additional complexity. In this paper, we propose a new, simple and effective swarm-based metaheuristic for search and lookup in an unstructured P2P system inspired by behavior of bark beetles in nature. Also, a Physarum Polycephalum mechanism is adapted for this purpose. Both algorithms are compared with Dictyostelium discoideum (Dd)-slime mold, Gnutella, AntNet and k-Walker search mechanisms and tested by using two different models, Actor and Peer. The benchmarks measured by different metrics cover a parameter sensitivity analysis, comparative analysis and scalability analysis. Both algorithms show very promising results in terms of performance and scalability.

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

[2]  Changhe Li,et al.  A survey of swarm intelligence for dynamic optimization: Algorithms and applications , 2017, Swarm Evol. Comput..

[3]  Zhi Chen,et al.  An Adaptive Expanding AntBudget search algorithm for unstructured P2P networks , 2010, 2010 2nd International Conference on Future Computer and Communication.

[4]  Nikos D. Lagaros,et al.  Pity beetle algorithm - A new metaheuristic inspired by the behavior of bark beetles , 2018, Adv. Eng. Softw..

[5]  M. Sadish Sendil,et al.  A Novel Message Routing in Unstructured P2P Using CIS and Ant Search Algorithm , 2011 .

[6]  Leslie Pérez Cáceres,et al.  The irace package: Iterated racing for automatic algorithm configuration , 2016 .

[7]  Jingdong Xu,et al.  ERAntBudget: A Search Algorithm in Unstructured P2P Networks , 2008, 2008 Second International Symposium on Intelligent Information Technology Application.

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

[9]  V. Isaeva Self-organization in biological systems , 2012, Biology Bulletin.

[10]  D. Sauvard General Biology of Bark Beetles , 2007 .

[11]  eva Kühn,et al.  Bio-inspired search algorithms for unstructured P2P overlay networks , 2016, Swarm Evol. Comput..

[12]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

[13]  eva Kühn,et al.  Algorithms and Framework for Comparison of Bee-Intelligence Based Peer-to-Peer Lookup , 2013, ICSI.

[14]  C. Murray Woodside,et al.  Evaluating the scalability of distributed systems , 1998, Proceedings of the Thirty-First Hawaii International Conference on System Sciences.

[15]  eva Kühn,et al.  A Swarm Intelligence Appliance to the Construction of an Intelligent Peer-to-Peer Overlay Network , 2010, 2010 International Conference on Complex, Intelligent and Software Intensive Systems.

[16]  Elke Michlmayr Ant Algorithms for Search in Unstructured Peer-to-Peer Networks , 2006, 22nd International Conference on Data Engineering Workshops (ICDEW'06).

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

[18]  Prithviraj Dasgupta,et al.  Heuristics for Uninformed Search Algorithms in Unstructured P2P Networks Inspired by Self-Organizing Social Insect Models , 2008, BICC.

[19]  Sudip Misra,et al.  A Swarm Intelligence-based P2P file sharing protocol using Bee Algorithm , 2009, 2009 IEEE/ACS International Conference on Computer Systems and Applications.

[20]  Carlos Martinho,et al.  ASAP: an Ant resource Search Algorithm for swarm-like P2P networks , 2013, ECAL.

[21]  eva Kühn,et al.  Swarm-Inspired Routing Algorithms for Unstructured P2P Networks , 2018, Int. J. Swarm Intell. Res..

[22]  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..

[23]  eva Kühn,et al.  Peer-Based Programming Model for Coordination Patterns , 2013, COORDINATION.

[24]  Diomidis Spinellis,et al.  A survey of peer-to-peer content distribution technologies , 2004, CSUR.

[25]  Mirko Viroli,et al.  A Self-organizing Approach to Tuple Distribution in Large-Scale Tuple-Space Systems , 2007, IWSOS.

[26]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[27]  D. Hickey,et al.  Insights into Information Processing by the Single Cell Slime Mold Physarum Polycephalum , 2008 .

[28]  Vladimir I. Levenshtein,et al.  Binary codes capable of correcting deletions, insertions, and reversals , 1965 .