Skip to main content
SpringerLink
Log in

A dynamic coalition formation game for search efficient adaptive overlay construction in unstructured peer-to-peer networks

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

A great number of recent works deal with improving search in peer-to-peer systems, specifically by clustering peers into semantic groups. When the process of clustering is predetermined and static, it suffers from lack of adaptation to highly dynamic peer-to-peer environments. We model the problem as a non-superadditive coalition game with non-transferable utility characteristic function, and propose a distributed dynamic coalition formation algorithm through myopic best-reply with experiment rule to solve the coalition formation problem. Coalitions are formed by peers with similar interests considering geographical proximity. The overlay network is dynamically reconfigured over time based on the changes in the interests or locations of the individual peers. The convergence of the proposed algorithm using “core solution” concept is studied. The simulation results show that the proposed algorithm can efficiently reduce the search time, although the overhead of the overlay adaptation is slightly higher.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

Notes

  1. Readers are referred to [5] for more examples.

References

  1. Zaharia MA, Chandel A, Saroiu S, Keshav S (2007) Finding content in file-sharing networks when you can’t even spell. In IPTPS’07: International Workshop on Peer-to-Peer Systems

  2. Crespo A, Garcia-Molina H (2002) Semantic overlay networks for P2P systems. Computer Science Department, Stanford University, Technical report

  3. Arnold T, Schwalbe U (2002) Dynamic coalition formation and the core. J Econ Behav Organ 49(3):363–380

    Article  Google Scholar 

  4. Branze R, Tijs S, Dimitrov D (2005) Models in cooperative game theory: crisp, fuzzy, and multi-choice games. Springer, Berlin Heidelberg

    Google Scholar 

  5. Saad W, Han Z, Debbah M, Hjørungnes A, Basa T (2009) Coalitional game theory for communication networks: a tutorial. IEEE Signal Proc Mag Spec Issue Game Theory 26(5):77–97

    Article  Google Scholar 

  6. Androutsellisand S, Spinellis D (2004) Survey of peer-to-peer content distribution technologies. ACM Comput Surv 36(4):335–371

    Article  Google Scholar 

  7. Stoica I, Morris R et al (2003) Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Trans Networking 11(1):17–32

    Article  Google Scholar 

  8. Lv Q, Cao P, Cohen E, Shenker S (2002) Search and replication in unstructured peer-to-peer networks. In Proc. of 16th International Conference on Supercomputing, pp. 84–95

  9. Yang B, Garcia-Molina H (2002) Improving search in peer-to-peer networks. In Proc. of the 22nd IEEE International Conference on Distributed Computing (IEEE ICDCS’02), pp 5–14

  10. Tsoumakos D, Roussopoulos N (2003) Adaptive probabilistic search for peer-to-peer networks. In Proc. of the 3rd IEEE International Conference on P2P Computing, Sweden

  11. Condie T, Kamvar SD, Garcia-Molina H (2004) Adaptive p2p topology. In International Conference on Peer-to-Peer Computing, pp 53–62

  12. Hsu C, Chou C, Hsu C, Chen S (2008) On improving message passing in unstructured peer-to-peer overlay networks. In Proc. of International Conference on Grid and Pervasive Computing-Workshop, pp 358–363

  13. Li M, Lee WC, Sivasubramaniam A (2004) Small world: an overlay network for peer-to-peer search. In Proc. of International Conference on Network Protocol (ICNP 2004), pp 228–238

  14. Kobayashi H, Takizawa H, Inaba T (2005) A self-organizing overlay network to exploit the locality of interests for effective resource discovery in P2P systems. In Proc. of IEEE Symposium on Applications and the Internet, pp 246–255

  15. Kobayashi Y, Watanabe T, Kanzaki A, Yoshihisa T, Hara T, Nishio S (2009) A dynamic cluster construction method based on query characteristics in Peer-to-Peer networks. In AP2PS ’09 Proc. of the 2009 First International Conference on Advances in P2P Systems

  16. Ratnasamy S, Handley M, Karp R, Shenker S (2002) Topologically-aware overlay construction and server selection. In Proc. of INFOCOM

  17. Rostamiand H, Habibi J (2005) A mathematical foundation for topology awareness of P2P overlay networks. In in Proc. of 4th International Conference On Grid and Cooperative Computing (GCC2005), pp 906–918

  18. Rasanjalee Himali DM, Prasad SK (2011) SPUN: a P2P probabilistic search algorithm based on successful paths in unstructured networks. In Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW), pp 1610–1617

  19. Lei Y, Hao Y, Can W, ZhiGuang Q (2010) An adaptive search method based on the interest in Gnutella-like network. In Computer Application and System Modeling (ICCASM), Oct 2010, pp V11-302–V11-306

  20. Garbacki P, Epema DHJ, van Steen M (2010) The design and evaluation of a self-organizing superpeer network. IEEE Trans Comput 59(3):317–331

    Article  MathSciNet  Google Scholar 

  21. Datta S, Giannella CR, Kargupta H (2009) Approximate distributed K-means clustering over a peer-to-peer network. IEEE Trans Knowl Data Eng 21(10):1372–1388

    Article  Google Scholar 

  22. Armetta F, Haddad M, Hassas S, Kheddouci H (2010) Self-organized routing for unstructured peer-to-peer networks. In 4th IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO), pp 273–274

  23. Xu M, Liu G (2011) Building self-adaptive peer-to-peer overlay networks with dynamic cluster structure. In 13th International Conference on Communication Technology (ICCT), pp 520–525

  24. Ghit B, Pop F, Cristea V (2011) Using bio-inspired models to design peer-to-peer overlays. In P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC), pp 248–252

  25. Saad W, Han Z, Basar T, Debbah M, Hjorungnes A (2010) A coalition formation game in partition form for peer-to-peer file sharing network. In Proc. for IEEE Globe Communication Conference, Miami

  26. Belmonte MV, Conejo R, Díaz M, Pérez-de-la-Cruz JL (2006) Coalition formation in P2P file sharing system. In Lecture Notes in Artificial Intelligence, CAEPIA’05, 4177, pp 153–162

  27. Soltani Panah A, Khorsandi S (2011) Overlay construction based on dynamic coalition formation game in P2P networks. 5th International Conference on Signal Processing and Communication Systems (ICSPCS), Hawaii

  28. Shehory O, Kraus S (1996) Formation of overlapping coalitions for precedence-ordered task-execution among autonomous agents. ICMAS-96, pp 330–337, December

  29. Namvarand O, Krishnamurth V (2010) Coalition formation for bearings-only localization in sensor networks—a cooperation game approach. IEEE Trans Signal Process 58(8):432–4338

    Google Scholar 

  30. Moscibroda T, Schmid S, Wattenhofer R (2006) On the topologies formed by selfish peers. In Proc. of the twenty-fifth annual ACM symposium on Principles of distributed computing, pp 133–142

  31. Chalkiadakis G, Elkind E, Markakis E, Polukarov M, Jennings N (2009) Stability of overlapping coalitions. ACM SIGecom Exchanges 8(1)

  32. http://planet.urv.es/planetsim

  33. http://www.acm.org/about/class/1998

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering and Information Technology, Amirkabir University of Technology, 424 Hafez Ave, 15875, Tehran, Iran

    Arezou Soltani Panah & Siavash Khorsandi

Authors
  1. Arezou Soltani Panah
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Siavash Khorsandi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Siavash Khorsandi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Soltani Panah, A., Khorsandi, S. A dynamic coalition formation game for search efficient adaptive overlay construction in unstructured peer-to-peer networks. Peer-to-Peer Netw. Appl. 7, 86–99 (2014). https://doi.org/10.1007/s12083-012-0185-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-012-0185-z

Keywords

Search

Navigation