Paper Info
Title
G-Grid: a class of scalable and self-organizing data structures for multi-dimensional querying and content routing in p2p networks
Abstract
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.
Year
DOI
Venue
2003
10.1007/978-3-540-25840-7_13
AP2PC
Keywords
Field
DocType
content routing,range query,autonomous peer,single data,self-organizing data structure,network topology,p2p system,multi-dimensional querying,p2p environment,mobile ad-hoc network,p2p network,data structure,data management,self organization,p2p,grid computing
Grid computing,Peer-to-peer,Static routing,Computer science,Range query (data structures),Network topology,Distributed algorithm,Wireless ad hoc network,File sharing,Distributed computing
Conference
Volume
ISSN
ISBN
2872
0302-9743
3-540-24053-5
Citations 
PageRank 
References 
18
0.77
12
Authors
2
Name
Order
Citations
PageRank
aris m ouksel1430117.72
G. Moro219216.25