Swarm-Inspired Routing Algorithms for Unstructured P2P Networks

Abstract

Due to extreme complexity in nowadays networks, routing becomes a challenging task. This problem is especially delicate in unstructured P2P networks, as there is neither a global view on the network nor a global address mapping. Although different conventional solutions are commercially available, swarm-intelligent approaches are promising in case of frequently changing conditions in P2P networks. In this article, an approach inspired by Dictyostelium discoideum slime molds and bees with distributive and autonomous properties is proposed. Both bio-mechanisms are "tailored" for routing in unstructured P2P systems, resulting in swarm-inspired routing algorithms, SMNet and BeeNet. They are compared with three swarm-based routing algorithms and two conventional approaches. The benchmarks include parameter sensitivity-, comparative-, statistical-and scalability-analysis. SMNet outperforms the other algorithms in the comparative analysis regarding the average data packet delay, especially for bigger network sizes and data packet traffic levels. Both algorithms show good scalability.

References

1. Adamatzky, A. 2015. Slime Mould Computing. International Journal of General Systems, 443, 277-278.
2. Androutsellis-Theotokis, S., & Spinellis, D. 2004. A survey of peer-to-peer content distribution technologies. ACM Computing Surveys, 364, 335-371.
3. Ayob, M. N., Hassan, F., Ismail, A. H., Basri, H. H., Azmi, M. S., & Abidin, A. F. Z. 2012. A Firefly Algorithm approach for routing in VLSI. In 2012 IEEE Symposium on Computer Applications and Industrial Electronics ISCAIE pp. 43-47. IEEE.10.1109/ISCAIE.2012.6482066
4. Barabási, A. L., & Albert, R. 1999. Emergence of scaling in random networks. Science, 2865439, 509-512. PMID:10521342
5. Buford, J. F., & Yu, H. 2010. Peer-to-peer networking and applications: Synopsis and research directions. In Handbook of Peer-to-Peer Networking pp. 3-45.
6. Camazine, S., Franks, N. R., Sneyd, J., Bonabeau, E., Deneubourg, J.-L., & Theraulaz, G. 2001. Self-Organization in Biological Systems. Princeton Univ. Press.
7. Casadei, M., Menezes, R., Viroli, M., & Tolksdorf, R. 2007. A self-organizing approach to tuple distribution in large-scale tuple-space systems. Self-Organizing Systems, 4725, 146-160.
8. Di Caro, G., & Dorigo, M. 1998. AntNet: Distributed stigmergetic control for communication networks. Journal of Artificial Intelligence, 9, 317-365.
9. Ducatelle, F., Di Caro, G., & Gambardella, L. 2010. Principles and applications of swarm intelligence for adaptive routing in telecommunications networks. Swarm Intelligence, 43, 173-198.
10. Farooq, M. 2009. A Comprehensive Survey of Nature-Inspired Routing Protocols. In Bee-Inspired Protocol Engineering pp. 19-52. Springer.
11. Farooq, M., & Di Caro, G. A. 2008. Routing protocols for next-generation networks inspired by collective behaviors of insect societies: An overview. In Swarm intelligence pp. 101-160. Springer.
12. HickeyD. S.NoriegaL. A. 2008. Insights into information processing by the single cell slime mold physarum polycephalum. In UKACC Control Conf. pp. 2-4.
13. Hollis, B. 2012. Rapid antagonistic coevolution between strains of the social amoeba Dictyostelium discoideum. The Royal Society of London B: Biological Sciences, 2791742, 3565-3571.
14. Houbraken, M., Demeyer, S., Staessens, D., Audenaert, P., Colle, D., & Pickavet, M. 2013. Fault tolerant network design inspired by Physarum polycephalum. Natural Computing, 122, 277-289.
15. Hutter, F., Hoos, H., Leyton-Brown, K., & Stützle, T. 2009. ParamILS: An automatic algorithm configuration framework. Journal of Artificial Intelligence Research, 36, 267-306.
16. Jogalekar, P., & Woodside, M. 2000. Evaluating the scalability of distributed systems. IEEE Transactions on Parallel and Distributed Systems, 116, 589-603.
17. Kessin, R. 2001. Dictyostelium: evolution, cell biology, and the development of multicellularity. Cambridge Univ. Press.
18. Khurana, M., & Massey, K. 2015. Swarm algorithm with adaptive mutation for airfoil aerodynamic design. Swarm and Evolutionary Computation, 20, 1-13.
19. Kühn, E. 2016. Reusable Coordination Components: Reliable Development of Cooperative Information Systems. International Journal of Cooperative Information Systems, 254, 1740001.
20. KühnE.CraβS.JoskowiczG.MarekA.SchellerT. 2013. Peer-based programming model for coordination patterns. In Int. Conf. on Coordination Languages and Models pp. 121-135.
21. Li, K., Torres, C., Thomas, K., Rossi, L., & Shen, C.-C. 2011. Slime mold inspired routing protocols for wireless sensor networks. Swarm Intelligence, 53-4, 183-223.
22. LvQ.CaoP.CohenE.LiK.SchenkerS. 2002. Search and replication in unstructured peer-to-peer networks. In 16th ACM Int. Conf. on Supercomputing pp. 84-95.
23. MichlmayrE. 2006. Ant Algorithms for Search in Unstructured Peer-to-Peer Networks. In 22nd Int. Conf. on Data Engineering.
24. MonismithD.MayfieldB. 2008. Slime mold as a model for numerical optimization. In IEEE Swarm Intelligence Symposium pp. 1-8.
25. Murtala Zungeru, A., Ang, L., & Seng, K. P. 2012. Classical and swarm intelligence based routing protocols for wireless sensor networks: A survey and comparison . Journal of Network and Computer Applications, 355, 1508-1536.
26. Nair, T. R. G., Soodak, K., & Alva, K. B. 2014. Intelligent routing approaches using Bacteria Foraging Algorithm and Artificial Bee Colony. IJCSC, 52, 37-41.
27. Nakrani, S., & Tovey, C. 2004. On honey bees and dynamic server allocation in internet hosting centers. Adaptive Behavior, 123-4, 223-240.
28. RenH.MengM. Q.-H. 2006. Biologically inspired approaches for wireless sensor networks. Int. Conf. on Mechatronics and Automation.
29. Rubio-Largo, Á., & Vega-Rodríguez, M.A. 2013. Routing low-speed traffic requests onto high-speed lightpaths by using a multiobjective firefly algorithm. In European Conference on the Applications of Evolutionary Computation pp. 12-21. Springer.
30. Saleem, M., Di Caro, G., & Farooq, M. 2011. Swarm intelligence based routing protocol for wireless sensor networks: Survey and future directions. Information Sciences, 18120, 4597-4624.
31. Šešum-Čavić, V., & Kühn, E. 2011. Self-Organized Load Balancing through Swarm Intelligence. In Next Generation Data Technologies for Collective Computational Intelligence pp. 195-224. Springer.
32. Šešum-Čavić, V., Kühn, E., & Kanev, D. 2016. Bio-inspired search algorithms for unstructured P2P overlay networks. Swarm and Evolutionary Computation, 29, 73-93.
33. Sim, K. M., & Sun, W. H. 2003. Ant colony optimization for routing and load balancing: Survey and new directions . IEEE Transactions on Systems, Man, and Cybernetics, 335, 560-572.
34. Von Frisch, K. 1974. Decoding the language of the bee. Science, 1854152, 663-668. PMID:17736362
35. Wang, J., & Lee, S. 2009. A Performance Comparison of Swarm Intelligence Inspired Routing Algorithms for MANETs. In Computational Science and Its Applications, LNCS Vol. 5593, pp. 432-442. Springer.
36. Wedde, H. F., & Farooq, M. 2005. A performance evaluation framework for nature inspired routing algorithms. In Workshops on Applications of Evolutionary Computation pp. 136-146. Springer.
37. Wedde, H. F., Farooq, M., & Zhang, Y. 2004. BeeHive: An efficient fault-tolerant routing algorithm inspired by honey bee behavior. In Ant Colony Optimization and Swarm Intelligence pp. 83-94. Springer.
38. WongL.-P.YokeM.LowH.ChongC. 2008. A bee colony optimization algorithm for traveling salesman problem. In 2nd Asia Int. Conf. on Modeling & Simulation pp. 818-823.