Skip to main content

Percolation-Based Replica Discovery in Peer-to-Peer Grid Infrastructures

  • Conference paper
Networks for Grid Applications (GridNets 2009)

Abstract

Peer-to-peer Grids are collaborative distributed computing/data processing systems, characterized by large scale, heterogeneity, lack of central control, unreliable components and frequent dynamic changes in both topology and configuration. In such systems, it is desirable to maintain and make widely accessible timely and up-to-date information about shared resources available to the active participants. Accordingly we introduce a scalable searching framework for locating and retrieving dataset replica information in random unstructured peer-to-peer Grids built on the Internet, based on a widely known uniform caching and searching algorithm. Such algorithm is based on bond percolation, a mathematical phase transition model well suited for random walk searches in random power law networks, which automatically shields low connectivity nodes from traffic and reduces total traffic to scale sub-linearly with network size. The proposed schema is able to find the requested information reliably end efficiently, even if every node in the network starts with a unique different set of contents as a shared resources.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Botros, S., Waterhouse, S.: Search in JXTA and other distributed networks. In: P2P Computing conference (2001)

    Google Scholar 

  2. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable Network. In: ACM SIGCOM (2001)

    Google Scholar 

  3. Dabek, F., Brunskill, E., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I., Balakrishnan, H.: Building peer-to-peer systems with Chord, a Distributed Lookup Service (2001), http://pdos.lcs.mit.edu/chord

  4. Zhao, B.Y., Kubiatowicz, I., Joseph, A.: Tapestry: An infrastructure for fault-tolerant wide area location and routing”, Computer Science Department, UCB Report UCB/CSD-O 1-1141 (2001)

    Google Scholar 

  5. Lv, Q., Cohen, E., Li, K., Shenker, S.: Search and Replication in unstructured peer-to-peer network. In: International Conference on Supercomputing (2002)

    Google Scholar 

  6. Gkantsidis, C., Mihail, M., Saberi, A.: Hybrid Search Schemes for Unstructured Peer-to-Peer Networks. In: IEEE Infocom 2005. IEEE CS Press, Los Alamitos (2005)

    Google Scholar 

  7. Adamic, L.A., Lukose, R.M., Puniyani, A.R., Huberman, B.A.: Search in Power-Law Networks. Physical Review E 64 (2001)

    Google Scholar 

  8. Gkantsidis, C., Mihail, M., Saberi, A.: Random Walks in Peer-to-Peer Networks. In: IEEE INFOCOM 2004, Hong Kong, China (2004)

    Google Scholar 

  9. Sarshar, N., Roychowdury, V., Boykin, P.O.: Percolation search algorithm, making unstructured p2p networks scalable. In: Fourth IEEE P2P 2004, Zurich, Switzerland. IEEE Computer Society Press, Los Alamitos (2004)

    Google Scholar 

  10. Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power–law relationships of the Internet topology. In: Proceedings of ACM SIGCOMM 1999, October 1999, pp. 251–262 (1999)

    Google Scholar 

  11. Barabasi, A., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  12. Grimmett, G.: Percolation, 2nd edn. Springer, New York (1999)

    Book  MATH  Google Scholar 

  13. Meester, R., Roy, R.: Continuum Percolation. Cambridge Univ. Press, Cambridge (1996)

    Book  MATH  Google Scholar 

  14. Broadbent, S.R., Hammersley, J.M.: Percolation processes in Crystals and mazes. Proc. Cambridge Philosoph. Soc. 53, 629–641 (1957)

    Article  MathSciNet  MATH  Google Scholar 

  15. Newman, M.E.J.: The structure and function of complex networks. SIAM Review 45(2), 167–256 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  16. Sarshar, N., Boykin, P.O., Roychowdury, V.: Scalable percolation search on complex networks. Theoretical Computer Science 355, 48–64 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  17. Sun Microsystems. The JXTA project and peer-to-peer technology (November 2004), http://www.jxta.org

  18. Wang: P2PS (Peer-to-Peer Simplified. In: 13th Conference - Frontiers of Grid Applications and Technologies, Louisiana State University, pp. 54–59 (2005)

    Google Scholar 

  19. Pajek project, http://vlado.fmf.uni-lj.si/pub/networks/pajek

  20. Albert, R., Barabasi, A.: Topology of Evolving Networks: Local Events and Universality. Phys. Rev. Lett. 85, 5234–5237 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering

About this paper

Cite this paper

Palmieri, F. (2010). Percolation-Based Replica Discovery in Peer-to-Peer Grid Infrastructures. In: Doulamis, A., Mambretti, J., Tomkos, I., Varvarigou, T. (eds) Networks for Grid Applications. GridNets 2009. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 25. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11733-6_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11733-6_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11732-9

  • Online ISBN: 978-3-642-11733-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics