Skip to main content

Advertisement

SpringerLink
Log in

Using genetic algorithms to reorganize superpeer structure in peer to peer networks

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

In this article, we describe a genetic algorithm for optimizing the superpeer structure of semantic peer to peer networks. Peer to peer, also called P2P, networks enable us to search for content or information in a distributed fashion across a large number of peers while providing a level of fault tolerance by preventing disconnecting peers from disrupting the network. We seek to maximize the number of queries answered while minimizing the time in which they are answered. It will be shown that the genetic algorithm (GA) dramatically improves network performance and consistently finds networks better than those found by random search and hill climbing. A comparison will also be made to networks found through exhaustive search, showing that the GA will, for smaller networks, converge on a globally optimal solution.

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

Similar content being viewed by others

References

  1. Robert E, Beverly IV (2004) Reorganization in network regions for optimality and fairness. MSc Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, August 2004

  2. Koo SGM, Lee CSG, Kannan K (2004) A genetic-algorithm-based neighbor-selection strategy for hybrid peer-to-peer networks. In: Proceedings of the 13th IEEE international conference on computer communications and networks (ICCCN’04), Chicago, IL, October 2004

  3. Kalnis P, Ng WS, Ooi BC, Papadias D, Tan KL (2002) An adaptive peer to peer network for distributed caching of OLAP results. In: Proceedings of the 2002 ACM SIGMOD international conference on management of data, Madison, Wisconsin, pp 25–36

  4. Falkenauer E (1996) A hybrid grouping genetic algorithm for bin packing. J Heuristics 2(1):5–30

    Article  Google Scholar 

  5. Cooper BF, Garcia-Molina H (2002) Peer-to-peer resource trading in a reliable distributed system. In: Electronic proceedings of the 1st international workshop on peer-to-peer systems (IPTPS ’02), Cambridge, MA, March 2002

  6. Androutsellis-Theotokis S (2002) A survey of peer-to-peer file sharing technologies. White paper, electronic trading research unit (ELTRUN), Athens University of Economics and Business, 2002

  7. Michaelwicz Z (1998) Genetic algorithms + data structures = evolution programs. Springer-Verlag, 3rd, rev. and extended ed. 1996. Corr. 2nd printing

  8. Resource description framework (RDF) model and syntax specification. W3C Recommendation, February 1999 (http://www.w3.org/TR/REC-rdf-syntax/)

  9. ATIS Telecom Glossary, The alliance for telecommunications industry solutions, February 2001 (http://www.atis.org/tg2k/_network_architecture.html)

  10. Comer DE, Stevens D (1996) Internetworking with TCP/IP, vol III. Prentice Hall, May 1997, p 513

  11. Lv Q, Ratnasamy S, Shenker S (2002) Can heterogeneity make gnutella scalable. In: Electronic proceedings of the 1st international workshop on peer-to-peer systems (IPTPS ’02), Cambridge, MA, March 2002

  12. Adar E, Huberman B (2000) Free riding on gnutella. First Monday, vol 5, Number 10–October 2nd, 2000

  13. Sripanidkulchai K. The popularity of gnutella queries and its implications on scalability. Featured on O’Reilly’s http://www.openp2p.com website, February 2001

  14. Mitzenmacher M (2001) Compressed bloom filters. In: Proceedings of the 20th annual ACM symposium on principles of distributed computing, pp 144–150

  15. Garey MR, Johnson DS (1979) Computers and intractability—a guide to the theory of np-completeness. W. H. Freeman And Company, New York, p 340

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Artificial Intellignece Center, University of Georgia, Athens, Georgia, 30602, USA

    Jaymin Kessler

  2. Computer Science Department, University of Georgia, Athens, Georgia, 30602, USA

    Khaled Rasheed

  3. Large Scale Distributed Information Systems LAB (LSDIS), Computer Science Department, University of Georgia, Athens, Georgia, 30602, USA

    I. Budak Arpinar

Authors
  1. Jaymin Kessler
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Khaled Rasheed
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. I. Budak Arpinar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Khaled Rasheed.

Additional information

Jaymin Kessler has a bachelors degree in Computer Science from Ramapo College and a Masters Degree in AI from the University of Georgia. After graduation, he worked for Hypnotix making PS2 and Xbox games, and is currently working as a software engineer at Electronic Arts Tiburon.

Khaled Rasheed is an Associate Professor of Computer Science and the graduate coordinator of the Artificial Intelligence Center at the University of Georgia. His research interests include evolutionary computation, machine learning and bioinformatics. Dr. Rasheed received his PhD in computer science from Rutgers University in New Jersey.

I. Budak Arpinar is an Assistant Professor of Computer Science and member of the Large Scale Distributed Information Systems Lab at the University of Georgia. His research interests include semantic web, web services, and peer-to-peer systems. Dr. Arpinar received his PhD in computer science from the Middle East Technical University in Turkey.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kessler, J., Rasheed, K. & Arpinar, I.B. Using genetic algorithms to reorganize superpeer structure in peer to peer networks. Appl Intell 26, 35–52 (2007). https://doi.org/10.1007/s10489-006-0006-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-006-0006-2

Keywords

Search

Navigation