Applied Intelligence

, Volume 48, Issue 2, pp 271–299 | Cite as

An adaptive super-peer selection algorithm considering peers capacity utilizing asynchronous dynamic cellular learning automata

Article

Abstract

Super-peer networks refer to a class of peer-to-peer networks in which some peers called super-peers are in charge of managing the network. A group of super-peer selection algorithms use the capacity of the peers for the purpose of super-peer selection where the capacity of a peer is defined as a general concept that can be calculated by some properties, such as bandwidth and computational capabilities of that peer. One of the drawbacks of these algorithms is that they do not take into consideration the dynamic nature of peer-to-peer networks in the process of selecting super-peers. In this paper, an adaptive super-peer selection algorithm considering peers capacity based on an asynchronous dynamic cellular learning automaton has been proposed. The proposed cellular learning automaton uses the model of fungal growth as it happens in nature to adjust the attributes of the cells of the cellular learning automaton in order to take into consideration the dynamicity that exists in peer-to-peer networks in the process of super-peers selection. Several computer simulations have been conducted to compare the performance of the proposed super-peer selection algorithm with the performance of existing algorithms with respect to the number of super-peers, and capacity utilization. Simulation results have shown the superiority of the proposed super-peer selection algorithm over the existing algorithms.

Keywords

Dynamic cellular learning automata Peer-to-Peer networks Super-Peer selection problem 

References

  1. 1.
    Kwok YK (2011) Computing, Peer-to-Peer: Applications, Architecture, Protocols, and challenges. CRC Press, United StatesCrossRefGoogle Scholar
  2. 2.
    Liang J, Kumar R, Ross K (2004) The kazaa overlay: A measurement study. In: Proceedings of the 19th IEEE annual computer communications workshop, Bonita Springs, Florida, pp 17–20Google Scholar
  3. 3.
    Kubiatowicz J et al (2000) Oceanstore: An architecture for global-scale persistent storage. In: Proceedings of the ninth international conference on architectural support for programming languages and operating systems, NY, USA, pp 190– 201Google Scholar
  4. 4.
    Rhea SC, Eaton PR, Geels D, Weatherspoon H, Zhao BY, Kubiatowicz J (2003) Pond: The oceanstore prototype. In: Proceedings of the 2nd USENIX conference on file and storage technologies, CA, USA, vol 3, pp 1–14Google Scholar
  5. 5.
    Beverly Yang B, Garcia-Molina H (2003) Designing a super-peer network. In: 19th international conference on data engineering, Bangalore, India, pp 49–60Google Scholar
  6. 6.
    Xu Z, Hu Y (2003) SBARC: A supernode based peer-to-peer file sharing system. In: Proceedings of eighth IEEE international symposium on computers and communication, Antalya, Turkey, pp 1053–1058Google Scholar
  7. 7.
    Gong L (2001) JXTA: A network programming environment. IEEE Internet Comput 5(3):88–95CrossRefGoogle Scholar
  8. 8.
    Montresor A (2004) A robust protocol for building superpeer overlay topologies. In: Proceedings of the 4th international conference on peer-to-peer computing, Zurich, Switzerland, pp 202–209Google Scholar
  9. 9.
    Jesi GP, Montresor A, Babaoglu Ö (2006) Proximity-aware superpeer overlay topologies. In: 2nd IEEE international workshop on self-managed networks, systems, and services, Dublin, Ireland, pp 41–50Google Scholar
  10. 10.
    Xiao L, Zhuang Z, Liu Y (2005) Dynamic layer management in superpeer architectures. IEEE Trans Parallel Distrib Syst 16(11):1078–1091CrossRefGoogle Scholar
  11. 11.
    Snyder PL, Greenstadt R, Valetto G (2009) Myconet: A fungi-inspired model for superpeer-based peer-to-peer overlay topologies. In: Third IEEE international conference on self-adaptive and self-organizing systems, San Francisco, CA, pp 40–50Google Scholar
  12. 12.
    Gao Z, Gu Z, Wang W (2012) SPSI: A hybrid super-node election method based on information theory. In: 14th international conference on advanced communication technology, Pyeong Chang, pp 1076–1081Google Scholar
  13. 13.
    Sacha J, Dowling J (2005) A gradient topology for master-slave replication in peer-to-peer environments. In: Proceedings of the international conference on databases, information systems, and peer-to-peer computing, Trondheim, Norway, pp 86–97Google Scholar
  14. 14.
    Dumitrescu M, Andonie R (2012) Clustering superpeers in p2p networks by growing neural gas. In: 20th euromicro international conference on parallel, distributed and network-based processing, Munich, Germany, pp 311–318Google Scholar
  15. 15.
    Gholami S, Meybodi M, Saghiri AM (2014) A learning automata-based version of SG-1 protocol for super-Peer selection in peer-to-peer networks. In: Proceedings of the 10th international conference on computing and information technology, Phuket, Thailand, pp 189–201Google Scholar
  16. 16.
    Liu M, Harjula E, Ylianttila M (2013) An efficient selection algorithm for building a super-peer overlay. J Internet Serv Appl 4(1):1–12CrossRefGoogle Scholar
  17. 17.
    Forestiero A, Mastroianni C, Meo M (2009) Self-Chord: A bio-inspired algorithm for structured P2P systems. In: IEEE/ACM international symposium on cluster computing and the grid, Shanghai, China, pp 44–51Google Scholar
  18. 18.
    Babaoglu O, Meling H, Montresor A (2002) Anthill: a framework for the development of agent-based peer-to-peer systems. In: 22nd international conference on distributed computing systems, Vienna, Austria, pp 15–22Google Scholar
  19. 19.
    Ganguly N, Deutsch A (2004) A cellular automata model for immune based search algorithm. In: 6th international conference on cellular automata for research and industry, Amsterdam, Netherlands, pp 142–150Google Scholar
  20. 20.
    Sharifkhani F, Pakravan MR (2014) Bacterial foraging search in unstructured P2P networks. In: 27th canadian conference on electrical and computer engineering, Toronto, ON, pp 1–8Google Scholar
  21. 21.
    Singh A, Haahr M (2007) Decentralized clustering in pure p2p overlay networks using schelling’s model. In: IEEE international conference on communications, Glasgow, Scotland, pp 1860–1866Google Scholar
  22. 22.
    Snyder PL, Giuseppe V (2015) SODAP: Self-organized topology protection for superpeer P2P networks. Scalable Comput: Pract Exper 16(3):271–288Google Scholar
  23. 23.
    Beigy H, Meybodi M (2004) A mathematical framework for cellular learning automata. Adv Compl Syst 3(4):295–319MathSciNetCrossRefMATHGoogle Scholar
  24. 24.
    Esnaashari M, Meybodi M (2011) A cellular learning automata-based deployment strategy for mobile wireless sensor networks. J Parallel Distrib Comput 71(5):988–1001CrossRefMATHGoogle Scholar
  25. 25.
    Esnaashari M, Meybodi M (2008) A cellular learning automata based clustering algorithm for wireless sensor networks. Sensor Lett 6(5):723–735CrossRefMATHGoogle Scholar
  26. 26.
    Beigy H, Meybodi M (2003) A self-organizing channel assignment algorithm: A cellular learning automata approach. Intell Data Eng Autom Learn 14:119–126CrossRefGoogle Scholar
  27. 27.
    Asnaashari M, Meybodi M (2007) Irregular Cellular Learning Automata and Its Application to Clustering in Sensor Networks. In: Proceedings of 15th conference on electrical engineering, Tehran, Iran, pp 21–28Google Scholar
  28. 28.
    Zhao Y, Jiang W, Li S, Ma Y, Su G, Lin X (2015) A cellular learning automata based algorithm for detecting community structure in complex networks. Neurocomputing 151:1216–1226CrossRefGoogle Scholar
  29. 29.
    Vahidipour M, Meybodi M, Esnaashari M (2016) Adaptive petri net based on irregular cellular learning automata and its application in vertex coloring problem systems with unknown parameters. Applied IntelligenceGoogle Scholar
  30. 30.
    Rastegar R, Meybodi M, Hariri A (2006) A new fine-grained evolutionary algorithm based on cellular learning automata. Int J Hybrid Intell Syst 3(2):83–98CrossRefMATHGoogle Scholar
  31. 31.
    Esnaashari M, Meybodi M (2013) Deployment of a mobile wireless sensor network with k-coverage constraint: A cellular learning automata approach. Wirel Netw 19(5):945–968CrossRefGoogle Scholar
  32. 32.
    Saghiri AM, Meybodi M (2016) An approach for designing cognitive engines in cognitive peer-to-peer networks. J Netw Comput Appl 70:17–40CrossRefGoogle Scholar
  33. 33.
    Lo V, Zhou D, Liu Y, GauthierDickey C, Li J (2005) Scalable supernode selection in peer-to-peer overlay networks. In: Hot topics in peer-to-peer systems, DC, USA, 18–25Google Scholar
  34. 34.
    Irit D, Safra S (2005) On the hardness of approximating minimum vertex cover. Ann Math 162(1):439–485MathSciNetCrossRefMATHGoogle Scholar
  35. 35.
    Rajiv G, Halperin E, Khuller S, Kortsarz G, Srinivasan A (2006) An improved approximation algorithm for vertex cover with hard capacities. J Comput Syst Sci 72(1):16–33MathSciNetCrossRefMATHGoogle Scholar
  36. 36.
    Sachez-Artigas M, Garcia-Lopez P, Skarmeta AFG (2008) On the feasibility of dynamic superpeer ratio maintenance. In: Eighth international conference on peer-to-peer computing, Germany, Aachen, pp 333–342Google Scholar
  37. 37.
    Min S-H, Holliday J, Cho D-S (2006) Optimal super-peer selection for large-scale p2p system. In: International conference on hybrid information technology, Jeju Island, Korea, vol 2, pp 588–593Google Scholar
  38. 38.
    Chen J, Wang R-M, Li L, Zhang Z-H, Dong X-S (2013) A distributed dynamic super peer selection method based on evolutionary game for heterogeneous P2P streaming systems. Math Probl Eng 2013Google Scholar
  39. 39.
    Paweł G, Epema DHJ, Van Steen M (2010) The design and evaluation of a selforganizing superpeer network. IEEE Trans Comput 59(3):317–331MathSciNetCrossRefMATHGoogle Scholar
  40. 40.
    Alexander L, Naumann F, Siberski W, Nejdl W, Thaden U (2004) Semantic overlay clusters within super-peer networks. In: Databases, information systems, and peer-to-peer computing, Berlin, Heidelberg, 33–47Google Scholar
  41. 41.
    Nejdl W, Wolpers M, Siberski W, Schmitz C, Schlosser M, Brunkhorst I, Löser A (2004) Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks. Web Semant: Sci, Serv Agents World Wide Web 1(2):177–186CrossRefGoogle Scholar
  42. 42.
    Garbacki P, Epema DHJ, Van Steen M (2007) Optimizing Peer Relationships in a Super-Peer Network. In: 27th international conference on distributed computing systems, Toronto, ON, pp 31–41Google Scholar
  43. 43.
    Feng W, Liu J, Xiong Y (2008) Stable peers, existence, importance, and application in Peer-To-Peer live video streaming. presented at the the 27th conference on computer communications, AZ, USA, 1364–1372Google Scholar
  44. 44.
    Sacha J, Dowling J, Cunningham R, Meier R (2006) Using aggregation for adaptive super-peer discovery on the gradient topology. In: Second IEEE international conference on self-managed networks, systems, and services, Dublin, Ireland, pp 73–86Google Scholar
  45. 45.
    Payberah AH, Dowling J, Haridi S (2011) Glive: The gradient overlay as a market maker for mesh-based p2p live streaming. In: 10th international symposium on parallel and distributed computing. Cluj Napoca, pp 153–162Google Scholar
  46. 46.
    Fathipour S, Saghiri AM, Meybodi M (2016) An Adaptive Algorithm for Managing Gradient Topology in Peer-to-Peer networks. In: The eight international conference on information and knowledge technology (IKT 2016), Hamedan, IranGoogle Scholar
  47. 47.
    Wolfram S (1986) Theory and applications of cellular automata. World Scientific PublicationGoogle Scholar
  48. 48.
    Kroc J, Sloot PMA, Georgius Hoekstra A (2010) Simulating complex systems by cellular automata. Understanding Complex Systems. SpringerGoogle Scholar
  49. 49.
    Somarakis C, Papavassilopoulos G, Udwadia F (2008) A dynamic rule in cellular automata. In: 22nd european conference on modelling and simulation, Nicosia, Cyprus, pp 164–170Google Scholar
  50. 50.
    Dantchev S (2011) Dynamic neighbourhood cellular automata. Comput J 54(1):26–32MathSciNetCrossRefGoogle Scholar
  51. 51.
    Ilachinski A, Halpern P (1987) Structurally dynamic cellular automata. Complex Syst 1(3):503–527MathSciNetMATHGoogle Scholar
  52. 52.
    Cornforth D, Green DG, Newth D (2005) Ordered asynchronous processes in multi-agent systems. Phys D 204:70–82MathSciNetCrossRefGoogle Scholar
  53. 53.
    Bandini S, Bonomi A, Vizzari G (2012) An analysis of different types and effects of asynchronicity in cellular automata update schemes. Nat Comput 11:277–287MathSciNetCrossRefMATHGoogle Scholar
  54. 54.
    Fatès N (2014) Guided tour of asynchronous cellular automata. J Cellular Autom 9:387–416MathSciNetMATHGoogle Scholar
  55. 55.
    Barreira-Gonzalez P, Barros J (2016) Configuring the neighbourhood effect in irregular cellular automata based models. Int J Geogr Inf Sci: 1–20Google Scholar
  56. 56.
    Goles E, Martínez S (2013) Neural and Automata Networks Dynamical Behavior and Applications. Springer Science and Business MediaGoogle Scholar
  57. 57.
    Li R, Hong Y (2015) On observability of automata networks via computational algebra. In: International conference on language and automata theory and applications, pp 249–262Google Scholar
  58. 58.
    Narendra KS, Thathachar MAL (1989) Learning automata: An introduction. Prentice-Hall, Englewood Cliffs, NJMATHGoogle Scholar
  59. 59.
    Thathachar M, Sastry PS (2004) Networks of learning automata: Techniques for online stochastic optimization. Kluwer Academic Publishers, Dordrecht, NetherlandsCrossRefGoogle Scholar
  60. 60.
    Rezvanian AR, Meybodi M (2015) Finding maximum clique in stochastic graphs using distributed learning automata. Int J Uncertain, Fuzziness Knowl-Based Syst 23(1):1–31MathSciNetCrossRefMATHGoogle Scholar
  61. 61.
    Ghorbani M, Meybodi M, Saghiri AM (2013) A new version of k-random walks algorithm in peer-to-peer networks utilizing learning automata. In: 5th conference on information and knowledge technology, Shiraz, Iran, pp 1–6Google Scholar
  62. 62.
    Ghorbani M, Meybodi M, Saghiri AM (2013) A novel self-adaptive search algorithm for unstructured peer-to-peer networks utilizing learning automata. In: 3rd joint conference of ai andamp; robotics and 5th robocup iran open international symposium, Qazvin, Iran, pp 1–6Google Scholar
  63. 63.
    Saghiri AM, Meybodi M (2015) A distributed adaptive landmark clustering algorithm based on mOverlay and learning automata for topology mismatch problem in unstructured peer-to-peer networks. Int J Commun SystGoogle Scholar
  64. 64.
    Saghiri AM, Meybodi M (2015) A self-adaptive algorithm for topology matching in unstructured peer-to-peer networks. J Netw Syst ManagGoogle Scholar
  65. 65.
    Beigy H, Meybodi M (2015) A learning Automata-based adaptive uniform fractional guard channel algorithm. J. Supercomput 71(3):871–893CrossRefGoogle Scholar
  66. 66.
    Venkata Krishna P, Misra S, Nagaraju D, Saritha V, Obaidat MS (2016) Learning automata based decision making algorithm for task offloading in mobile cloud. In: International conference on computer, information and telecommunication systems (CITS), Kunming, China, pp 1–6Google Scholar
  67. 67.
    Beigy H, Meybodi M (2007) Open synchronous cellular learning automata. Adv Complex Syst 10(4):527–556MathSciNetCrossRefMATHGoogle Scholar
  68. 68.
    Beigy H, Meybodi M (2008) Asynchronous cellular learning automata. Automatica 44(5):1350–1357MathSciNetCrossRefMATHGoogle Scholar
  69. 69.
    Beigy H, Meybodi M (2010) Cellular learning automata with multiple learning automata in each cell and its applications. IEEE Trans Syst, Man, Cybern, Part B: Cybern 40(1):54–65CrossRefGoogle Scholar
  70. 70.
    Esnaashari M, Meybodi M (2014) Irregular cellular learning automata. IEEE Trans Cybern 99:1MATHGoogle Scholar
  71. 71.
    Mozafari M, Shiri ME, Beigy H (2015) A cooperative learning method based on cellular learning automata and its application in optimization problems. Journal of Computational ScienceGoogle Scholar
  72. 72.
    Saghiri AM, Meybodi M (2017) A closed asynchronous dynamic model of cellular learning automata and its application to peer-to-peer networks. Genet Program Evolvable Mach: 1–37Google Scholar
  73. 73.
    Robson G, Van West P, Gadd G Exploitation of Fungi. Cambridge University PressGoogle Scholar
  74. 74.
    Meškauskas A, Fricker MD, Moore D (2004) Simulating colonial growth of fungi with the Neighbour-Sensing model of hyphal growth. Mycol Res 108(11):1241–1256CrossRefGoogle Scholar
  75. 75.
    Jelasity M, Kowalczyk W, Van Steen M (2003) Newscast computing. Vrije Universiteit Amsterdam, Department of Computer Science, Amsterdam, Netherlands Technical Report IR-CS-006Google Scholar
  76. 76.
    Baumgart I, Heep B, Krause S (2009) OverSim: A scalable and flexible overlay framework for simulation and real network applications. In: Peer-to-peer computing, Washington, USA, pp 87–88Google Scholar
  77. 77.
    Villatoro D, Sabater-Mir J, Sen S (2013) Robust convention emergence in social networks through self-reinforcing structures dissolution. ACM Trans Auton Adapt Syst 8(1)Google Scholar
  78. 78.
    Henri Collet J, Fanchon J (2015) Crystallization and tile separation in the multi-agent systems. Phys A 436:405–417MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2017

Authors and Affiliations

  1. 1.Soft Computing Laboratory, Computer Engineering and Information Technology DepartmentAmirkabir University of Technology (Tehran Polytechnic)TehranIran

Personalised recommendations