Skip to main content
Log in

Applying Peer-to-Peer Techniques to Grid Replica Location Services

  • Published:
Journal of Grid Computing Aims and scope Submit manuscript

Abstract

Peer-to-peer systems offer attractive system management properties, including the ability of components that join the network to self-organize; scalability up to tens of thousands of members; the ability of the network to automatically repair its topology after node failures; and techniques for maintaining redundant information to improve reliability and load balancing. We investigate applying peer-to-peer techniques to Grid services that are oriented toward resource discovery. In particular, we apply the Chord structured peer-to-peer overlay network to the Globus Replica Location Service, which allows registration and discovery of data replicas. We describe the design and performance of a Peer-to-Peer Replica Location Service (P-RLS) that uses the Chord algorithm to self-organize P-RLS servers and exploits the Chord overlay network to replicate P-RLS mappings adaptively. We present performance measurements and simulation results for the P-RLS system. We also discuss outstanding issues for applying peer-to-peer techniques to Grid resource discovery services.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

Abbreviations

P2P:

peer-to-peer

RLS:

Replica Location Service

P-RLS:

Peer-to-peer Replica Location Service

LRC:

Local Replica Catalog

RLI:

Replica Location Index

References

  1. The Compact Muon Solenoid, An Experiment for the Large Hadron Collider at CERN, http://cmsinfo.cern.ch/Welcome.html/, 2005.

  2. Gnutella, http://www.gnutella.com, 2004.

  3. Grid and Utility Computing, http://devresource.hp.com/drc/topics/utility_comp.jsp, Hewlett Packard, 2004.

  4. Grid Research Integration Deployment and Support Center, http://grids-center.org/, 2004.

  5. QCDGrid: Probing the Building Blocks of Matter with the Power of the Grid, http://www.gridpp.ac.uk/qcdgrid/, 2005.

  6. Southern California Earthquake Center (SCEC), http://www.scec.org/, 2005.

  7. D.G. Andersen, H. Balakrishnan, M.F. Kaashoek and R. Morris, “The Case for Resilient Overlay Networks”, in 8th Workshop on Hot Topics in Operating Systems (HotOS-VIII), Elmau/Oberbayern, Germany, 2001.

  8. J. Aspnes, G. Shah, “Skip Graphs”, in Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003.

  9. C. Baru, R. Moore et al., “The SDSC Storage Resource Broker”, in CASCON'98 Conference, 1998.

  10. D. Bernholdt, S. Bharathi, D. Brown, K. Chancio, M. Chen, A. Chervenak, L. Cinquini, B. Drach, I. Foster, P. Fox, J. Garcia, C. Kesselman, R. Markel, D. Middleton, V. Nefedova, L. Pouchard, A. Shoshani, A. Sim, G. Strand and D. Williams, “The Earth System Grid: Supporting the Next Generation of Climate Modeling Research”, Proceedings of the IEEE, Vol. 93, No. 3, pp. 485–495.

  11. G.B. Berriman et al., “Vol XXX, 2003, Montage a Grid Enabled Image Mosaic Service for the National Virtual Observatory”, in ADASS XIII, ASP Conference Series, 2003.

  12. R. Bhagwan, S. Savage and G.M. Voelker, “Understanding availability”, in The 2nd International Workshop on Peer-to-Peer Systems, 2003.

  13. B. Bloom, “Space/Time Trade-Offs in Hash Coding with Allowable Errors” Communications of ACM, Vol. 13, No. 7, pp. 422–426.

  14. Y. Breitbart and H. Korth, “Replication and Consistency: Being Lazy Helps Sometimes”, in 16th ACM SIGACT/SIGMOD Symposium on the Principles of Database Systems, Tucson, AZ, 1997.

  15. M. Castro, P. Druschel, Y.C. Hu and A. Rowstron, “Topology-Aware routing in Structured Peer-to-Peer Overlay Networks”, in Intl. Workshop on Future Directions in Distributed Computing, 2002.

  16. Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham and L. Breslau, “Making Gnutella-Like P2P Systems Scalable”, in ACM SIGCOMM 2003, Karlshruhe, Germany, 2003.

  17. Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham and S. Shenker, “Making Gnutella-Like P2P Systems scalable”, in ACM SIGCOMM 2003, Karlsruhe, Germany, 2003.

  18. A. Chervenak, E. Deelman, I. Foster, L. Guy, W. Hoschek, A. Iamnitchi, C. Kesselman, P. Kunst, M. Ripeanu, B. Schwartzkopf, H. Stockinger, K. Stockinger and B. Tierney, “Giggle: A Framework for Constructing Scalable Replica Location Services”, in SC2002 Conference, Baltimore, Maryland, 2002.

  19. A.L. Chervenak, N. Palavalli, S. Bharathi, C. Kesselman and R. Schwartzkopf, “Performance and Scalability of a Replica Location Service”, in Thirteenth IEEE Int'l Symposium High Performance Distributed Computing (HPDC-13), Honolulu, Hawaii, 2004.

  20. I. Clarke et al., “Protecting Free Expression Online with Freenet”, IEEE Internet Computing Journal, Vol. 6, No. 1, pp. 40–49.

  21. K. Czajkowski, S. Fitzgerald, I. Foster and C. Kesselman, “Grid Information Services for Distributed Resource Sharing”, in Tenth IEEE International Symposium on High-Performance Distributed Computing (HPDC-10), 2001, IEEE.

  22. DataTag. Grid Laboratory Uniform Environment (GLUE), 2004.

  23. E. Deelman et al., “Grid-Based Galaxy Morphology Analysis for the National Virtual Observatory”, in SC2003, 2003.

  24. E. Deelman et al., “Mapping Abstract Complex Workflows Onto Grid Environments”, Journal of Grid Computing, Vol. 1, pp. 25–39.

  25. E. Deelman, J. Blythe, Y. Gil, C. Kesselman, G. Mehta, S. Patil, M. Su, K. Vahi and M. Livny, “Pegasus : Mapping Scientific Workflows Onto the Grid”, in Across Grids Conference, Nicosia, Cyprus, 2004.

  26. I. Foster and A. Iamnitchi, “On Death, Taxes, and the Convergence of Peer-to-Peer and Grid Computing”, in Int'l Workshop on Peer-to-Peer Systems (IPTPS'03), Berkeley, California, USA, 2003.

  27. J. Gray, P. Helland, P. O'Neil and D. Shasha, “The Dangers of Replication and a Solution”, in ACM SIGMOD Conference, 1996.

  28. L. Guy, P. Kunszt, E. Laure, H. Stockinger and K. Stockinger, “Replica management in data grids”, in Global Grid Forum 5, 2002.

  29. N. Harvey et al., “SkipNet: A Scalable Overlay Network with Practical Locality Properties”, in Fourth USENIX Symposium on Internet Technologies and Systems (USITS '03), Seattle, Washington, 2003.

  30. F. Kaashoek and David R. Karger, “Koorde: A Simple Degree-Optimal Hash Table”, in 2nd International Workshop on Peer-to-Peer Systems (IPTPS '03), 2003.

  31. J.D. Kephart, “Chess The Vision of Autonomic Computing”, Computer Magazine.

  32. P. Kunszt et al., “Advanced Replica Management with Reptor”, in 5th International Conference on Parallel Processing and Applied Mathematics, Czestochowa, Poland, 2003, Springer.

  33. LIGO Project, “LIGO – Laser Interferometer Gravitational Wave Observatory”, http://www.ligo.caltech.edu/, 2004.

  34. Q. Lv, P. Cao, E. Cohen, K. Li and S. Shenker, “Search and Replication in Unstructured Peer-to-Peer Networks”, in 16th ACM International Conference on Supercomputing (ICS'02), New York, USA, 2002.

  35. A.Y.C. Mizrak, V. Kumar and S. Savage, “Structured Superpeers: Leveraging Heterogeneity to Provide Constant-Time Lookup”, in IEEE Workshop on Internet Applications, San Jose, 2003.

  36. J.T.W. Page et al., “Management of Replicated Volume Location Data in the Ficus Replicated File System”, in USENIX Conference, 1996.

  37. K. Petersen et al., “Flexible Update Propagation for Weakly Consistent Replication”, in 16th ACM Symposium on Operating Systems Principles (SOSP-16), Saint Malo, France, 1997.

  38. C. Plaxton, R. Rajaraman and A. Richa, “Accessing Nearby Copies of Replicated Objects in a Distributed Environment”, in ACM SPAA, Newport, Rhode Island, 1997.

  39. G. Popek, The Locus Distributed System Architecture, MIT, 1986.

  40. W. Pugh, “Skip Lists: A Probabilistic Alternative to Balanced Trees”, in Workshop on Algorithms and Data Structures, 1989.

  41. S. Ratnasamy, P. Francis, M. Handley, R. Karp and S. Shenker, “A Scalable Content-Addressable Network”, in ACM SIGCOMM, 2001.

  42. S. Ratnasamy, S. Shenker and I. Stoica, “Routing Algorithms for DHTs: Some Open Questions”, in IPTPS02, Cambridge, USA, 2002.

  43. M. Ripeanu, “Peer-to-Peer Architecture Case Study: Gnutella Network”, in IEEE 1st International Conference on Peer-to-peer Computing (P2P2001), Linkoping, Sweden, 2001, IEEE.

  44. M. Ripeanu, I. Foster and A. Iamnitchi, “Mapping the Gnutella network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design”, IEEE Internet Computing Journal, Vol. 6.

  45. M. Ripeanu, I. Foster and A. Iamnitchi, “Mapping the Gnutella network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design”, IEEE Internet Computing Journal.

  46. M. Ripeanu and Ian Foster, “A Decentralized, Adaptive, Replica Location Mechanism”, in 11th IEEE International Symposium on High Performance Distributed Computing (HPDC-11), Edinburgh, Scotland, 2002.

  47. A. Rowstron and P. Druschel, “Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems”, in International Conference on Distributed Systems Platforms (Middleware), 2001.

  48. R. Sandberg, D. Goldberg, S. Kleiman, D. Walsh and B. Lyon, “Design and Implementation of the Sun Network File System”, in USENIX Conference, 1985.

  49. S. Saroiu, P.K. Gummadi and S.D. Gribble, “A Measurement Study of Peer-to-Peer File Sharing Systems”, in Multimedia Computing and Networking, 2002.

  50. M. Satyanarayanan et al., “Coda: A Highly Available System for a Distributed Workstation Environment”, IEEE Transactions on Computers, Vol. 39, No. 4, pp. 447–459.

  51. S. Sen and Jia Wong, “Analyzing Peer-to-Peer Traffic Across Large Networks”, in Proceedings of the Second ACM SIGCOMM Workshop on Internet Measurment, 2002.

  52. J. Sidell et al., “Data Replication in Mariposa”, in 12th International Conference on Data Engineering, New Orleans, Los Angeles, 1996.

  53. I. Stoica, R. Morris, D. Karger, M. Frans Kaashoek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications”, in ACM SIGCOMM, 2001.

  54. O. Tatebe et al., “Worldwide Fast File Replication on Grid Datafarm”, in 2003 Computing in High Energy and Nuclear Physics (CHEP03), 2003.

  55. D.B. Terry, K. Petersen, M.J. Spreitzer and M.M. Theimer, “The Case for Non-transparent Replication: Examples from Bayou”, in 14th International Conference on Data Engineering, 1998.

  56. M. Wiesmann et al., “Database Replication Techniques: A Three Paramater Classification”, in 19th IEEE Symposium on Reliable Distributed Systems, Nuernberg, Germany, 2002.

  57. B. Yang and H. Garcia-Molina, “Designing A Super-Peer Network”, in IEEE Int'l Conf. on Data Engineering, 2003.

  58. E.R. Zayas and C.F. Everhart, “Design and Specification of the Cellular Andrew Environment”, Carnegie–Mellon University, 1988.

  59. X. Zhang, J. Freschl and J.M. Schopf, “A Performance Study of Monitoring and Information Services for Distributed Systems”, in Twelfth IEEE Int'l Symposium High Performance Distributed Computing (HPDC-12), Seattle, Washington, 2003.

  60. B.Y. Zhao, J.D. Kubiatowicz and A.D. Joseph, “Tapestry: An Infrastructure for Fault-Resilient Wide-Area Location and Routing”, U.C. Berkeley, 2001.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ann L. Chervenak.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chervenak, A.L., Cai, M. Applying Peer-to-Peer Techniques to Grid Replica Location Services. J Grid Computing 4, 49–69 (2006). https://doi.org/10.1007/s10723-005-9009-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10723-005-9009-1

Key words

Navigation