NDLI: DHT overlay schemes for scalable p-range resource discovery

Content Provider	IEEE Xplore Digital Library
Author	Liping Chen Candan, K.S. Tatemura, J. Agrawal, D. Cavendish, D.
Copyright Year	2005
Description	Author affiliation: NEC Labs. America Inc., Princeton, NJ, USA (Liping Chen; Candan, K.S.; Tatemura, J.; Agrawal, D.; Cavendish, D.)
Abstract	The information service is a critical component of a grid infrastructure for resource discovery. Although P2P computing paradigm could address some of the scalability issues that plagued grid resource discovery, most existing distributed hash table (DHT) based P2P overlays have difficulty in treating attribute range queries that are common in resource discovery lookups due to the inherent randomness of hash functions. Recently, there have been various attempts to solve the range search problem over DHT networks [Aberer, et al. (2003), Gao and Steenkiste (2004), Ratnasamy, et al. (2003), and Tanin, et al. (2005)]. Central to all of these is a mapping scheme which maps the tree-structured logical index space to some DHT-based physical node space. In this paper, we propose a general framework to put all these under the same umbrella based on how mapping of the tree-structured index that identifies a physical node responsible of a particular range is done through replication. We identify three schemes which should cover the spectrum of all meaningful replication schemes: the tree replication scheme (TRS) replicates the entire tree; the path caching scheme (PCS) replicates paths from root to leaves; and the node replication scheme (NRS) replicates individual logical nodes.
Starting Page	297
Ending Page	298
File Size	361826
Page Count	2
File Format	PDF
ISBN	0780390377
ISSN	10828907
DOI	10.1109/HPDC.2005.1520983
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2005-07-24
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Costs Peer to peer computing Personal communication networks Scalability Tree data structures National electric code Computer science Distributed computing Grid computing Search problems
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

On overlay schemes to support point-in-range queries for scalable grid resource discovery

Range Query Using Learning-Aware RPS in DHT-Based Peer-to-Peer Networks

Distributed Indexing for Resource Discovery in P2P Networks

On Overlay Schemes to Support Point-in-Range Queries for Scalable Grid Resource Discovery

On overlay schemes to support point-in-range queries for scalable grid resource discovery.

L.Feng, Distributed Suffix Tree Overlay for Peer-to-Peer Search (2008)

Binary Search Tree: An Efficient Overlay Structure to Support Range Query

A Modified CCC for More Efficient Keyword Search in DHT-Based Peer-to-Peer Network

Distributed Suffix Tree Overlay for Peer-to-Peer Search

DHT overlay schemes for scalable p-range resource discovery

Similar Documents

On overlay schemes to support point-in-range queries for scalable grid resource discovery

Range Query Using Learning-Aware RPS in DHT-Based Peer-to-Peer Networks

Distributed Indexing for Resource Discovery in P2P Networks

On Overlay Schemes to Support Point-in-Range Queries for Scalable Grid Resource Discovery

On overlay schemes to support point-in-range queries for scalable grid resource discovery.

L.Feng, Distributed Suffix Tree Overlay for Peer-to-Peer Search (2008)

Binary Search Tree: An Efficient Overlay Structure to Support Range Query

A Modified CCC for More Efficient Keyword Search in DHT-Based Peer-to-Peer Network

Distributed Suffix Tree Overlay for Peer-to-Peer Search

DHT overlay schemes for scalable p-range resource discovery