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

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.

[1]  T. McGlynn,et al.  Grid-Based Galaxy Morphology Analysis for the National Virtual Observatory , 2003, ACM/IEEE SC 2003 Conference (SC'03).

[2]  Peter Druschel,et al.  Topology-aware routing in structured peer-to-peer overlay networks , 2003 .

[3]  Scott Shenker,et al.  Making gnutella-like P2P systems scalable , 2003, SIGCOMM '03.

[4]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[5]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[6]  William Pugh,et al.  Skip lists: a probabilistic alternative to balanced trees , 1989, CACM.

[7]  Hector Garcia-Molina,et al.  Designing a super-peer network , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

[8]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[9]  Jennifer M. Schopf,et al.  A performance study of monitoring and information services for distributed systems , 2003, High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on.

[10]  Erwin Laure,et al.  Advanced Replica Management with Reptor , 2003, PPAM.

[11]  Matei Ripeanu,et al.  Peer-to-peer architecture case study: Gnutella network , 2001, Proceedings First International Conference on Peer-to-Peer Computing.

[12]  Stefan Savage,et al.  Structured superpeers: leveraging heterogeneity to provide constant-time lookup , 2003, Proceedings the Third IEEE Workshop on Internet Applications. WIAPP 2003.

[13]  William Pugh,et al.  Skip Lists: A Probabilistic Alternative to Balanced Trees , 1989, WADS.

[14]  John S. Heidemann,et al.  Management of Replicated Volume Location Data in the Ficus Replicated File System , 1991, USENIX Summer.

[15]  Ben Y. Zhao,et al.  Tapestry: a fault-tolerant wide-area application infrastructure , 2002, CCRV.

[16]  Jia Wang,et al.  Analyzing peer-to-peer traffic across large networks , 2004, IEEE/ACM Trans. Netw..

[17]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002 .

[18]  Dennis Shasha,et al.  The dangers of replication and a solution , 1996, SIGMOD '96.

[19]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[20]  Rajmohan Rajaraman,et al.  Accessing Nearby Copies of Replicated Objects in a Distributed Environment , 1997, SPAA '97.

[21]  Craig Everhart,et al.  BDesign and Specification of the Cellular Andrew Environment , 1988 .

[22]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[23]  Ian Clarke,et al.  Protecting Free Expression Online with Freenet , 2002, IEEE Internet Comput..

[24]  Bruce J. Walker,et al.  The LOCUS Distributed System Architecture , 1986 .

[25]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[26]  Ian T. Foster,et al.  Grid information services for distributed resource sharing , 2001, Proceedings 10th IEEE International Symposium on High Performance Distributed Computing.

[27]  C. Kesselman,et al.  Montage: A Grid Enabled Image Mosaic Service for the National Virtual Observatory , 2004 .

[28]  Mahadev Satyanarayanan,et al.  Coda: A Highly Available File System for a Distributed Workstation Environment , 1990, IEEE Trans. Computers.

[29]  Scott Shenker,et al.  Routing Algorithms for DHTs: Some Open Questions , 2002, IPTPS.

[30]  Ian T. Foster,et al.  On Death, Taxes, and the Convergence of Peer-to-Peer and Grid Computing , 2003, IPTPS.

[31]  Yolanda Gil,et al.  Pegasus: Mapping Scientific Workflows onto the Grid , 2004, European Across Grids Conference.

[32]  Ian T. Foster,et al.  Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design , 2002, ArXiv.

[33]  James Aspnes,et al.  Skip graphs , 2003, SODA '03.

[34]  Satoshi Matsuoka,et al.  Worldwide Fast File Replication on Grid Datafarm , 2003, ArXiv.

[35]  David R. Karger,et al.  Koorde: A Simple Degree-Optimal Distributed Hash Table , 2003, IPTPS.

[36]  Marvin Theimer,et al.  The Case for Non-transparent Replication: Examples from Bayou , 1998, IEEE Data Eng. Bull..

[37]  Michael Stonebraker,et al.  Data replication in Mariposa , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[38]  Erwin Laure,et al.  Replica Management in Data Grids , 2002 .

[39]  Henry F. Korth,et al.  Replication and consistency: being lazy helps sometimes , 1997, PODS.

[40]  Stefan Saroiu,et al.  A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .

[41]  Adam Arbree,et al.  Mapping Abstract Complex Workflows onto Grid Environments , 2003, Journal of Grid Computing.

[42]  Marvin Theimer,et al.  Flexible update propagation for weakly consistent replication , 1997, SOSP.

[43]  Arie Shoshani,et al.  The Earth System Grid: Supporting the Next Generation of Climate Modeling Research , 2005, Proceedings of the IEEE.

[44]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[45]  Michael B. Jones,et al.  SkipNet: A Scalable Overlay Network with Practical Locality Properties , 2003, USENIX Symposium on Internet Technologies and Systems.

[46]  Robert Tappan Morris,et al.  The case for resilient overlay networks , 2001, Proceedings Eighth Workshop on Hot Topics in Operating Systems.

[47]  Mahadev Satyanarayanan,et al.  Coda: a highly available file system for a distributed workstation environment , 1989, Proceedings of the Second Workshop on Workstation Operating Systems.

[48]  Peter Z. Kunszt,et al.  Giggle: A Framework for Constructing Scalable Replica Location Services , 2002, ACM/IEEE SC 2002 Conference (SC'02).

[49]  Kevin Barraclough,et al.  I and i , 2001, BMJ : British Medical Journal.

[50]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[51]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[52]  Ian T. Foster,et al.  A decentralized, adaptive replica location mechanism , 2002, Proceedings 11th IEEE International Symposium on High Performance Distributed Computing.

[53]  Carl Kesselman,et al.  Performance and scalability of a replica location service , 2004, Proceedings. 13th IEEE International Symposium on High performance Distributed Computing, 2004..

[54]  Jia Wang,et al.  Analyzing peer-to-peer traffic across large networks , 2002, IMW '02.