G-Grid: A Class of Scalable and Self-Organizing Data Structures for Multi-dimensional Querying and Content Routing in P2P Networks

Peer-to-Peer (P2P) technologies promise to provide efficient distribution, sharing and management of resources, such as storage, processing, routing and other sundry service capabilities, over autonomous and heterogeneous peers. Yet, most current P2P systems only support rudimentary query and content routing over a single data attribute, such as the file-sharing applications popularized in Napster, Gnutella and so forth. Full-fledged applications in distributed data management and grid computing demand more complex functionality, including querying and content routing over multiple attributes. In this paper we present a class of scalable and self-organizing multi-dimensional distributed data structures able to efficiently perform range queries in totally decentralized dynamic P2P environments. These structures are not imposed a priori over the network of peers. Rather, they emerge from the independent interactions of autonomous peers. They are also adaptive to unanticipated changes in the network topology. This robustness property expands their range of usefulness to many application areas such as mobile ad-hoc networks.

[1]  Aris M. Ouksel,et al.  A robust and efficient spatial data structure , 1992, Acta Informatica.

[2]  Witold Litwin,et al.  RP*: A Family of Order Preserving Scalable Distributed Data Structures , 1994, VLDB.

[3]  Enrico Nardelli,et al.  ADST: An Order Preserving Scalable Distributed Data Structure with Constant Access Costs , 2001, SOFSEM.

[4]  Leszek Pacholski,et al.  SOFSEM 2001: Theory and Practice of Informatics , 2001, Lecture Notes in Computer Science.

[5]  Witold Litwin,et al.  LH* - Linear Hashing for Distributed Files , 1993, SIGMOD Conference.

[6]  Sonia Bergamaschi,et al.  Agents and Peer-to-Peer Computing - 5th International Workshop, AP2PC 2006, Hakodate, Japan, May 9, 2006, Revised and Invited Papers , 2008, AP2PC.

[7]  Witold Litwin,et al.  LH*—a scalable, distributed data structure , 1996, TODS.

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

[9]  Peter Widmayer,et al.  Distributing a search tree among a growing number of processors , 1994, SIGMOD '94.

[10]  Aris M. Ouksel.  The interpolation-based grid file , 1985, PODS '85.

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

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

[13]  Aris M. Ouksel,et al.  Agents and Peer-to-Peer Computing: A Promising Combination of Paradigms , 2002, AP2PC.

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

[15]  Vijay Kumar,et al.  Management of Concurrency in Interpolation Based Grid File Organization and its Performance , 1994, Inf. Sci..

[16]  Karl Aberer,et al.  Improving Data Access in P2P Systems , 2002, IEEE Internet Comput..

[17]  Karl Aberer,et al.  P-Grid: a self-organizing structured P2P system , 2003, SGMD.

[18]  Beng Chin Ooi,et al.  PeerDB: a P2P-based system for distributed data sharing , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).