Range addressable network

A P2P cache architecture for data ranges

A. Kothari, D. Agrawal, A. Gupta, S. Suri

Research output: Chapter in Book/Report/Conference proceedingConference contribution

15 Citations (Scopus)

Abstract

Peer-to-peer computing paradigm is emerging as a scalable and robust model for sharing media objects. We propose an architecture and describe the associated algorithms and data structures to support the execution of range selection queries over data scattered across a P2P network especially for resource discovery in grid environments. We develop a distributed data structure referred to as a range addressable network that provides the following two quality-of-service guarantees: (i) the located peer is one with the smallest superset of the query range (important from the application perspective), and (ii) in a P2P network of n peers, a query is routed through O(log n) peers before the intended peer is found (important from the system perspective). Our preliminary experimental evaluation indicates that the range addressable network has desirable properties of scalability and load-balancing, which are crucial for the success of a large-scale P2P system.

Original languageEnglish
Title of host publicationProceedings - 3rd International Conference on Peer-to-Peer Computing, P2P 2003
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages14-22
Number of pages9
ISBN (Print)0769520235, 9780769520230
DOIs
Publication statusPublished - 2003
Externally publishedYes
Event3rd International Conference on Peer-to-Peer Computing, P2P 2003 - Linkoping, Sweden
Duration: 1 Sep 20033 Sep 2003

Other

Other3rd International Conference on Peer-to-Peer Computing, P2P 2003
CountrySweden
CityLinkoping
Period1/9/033/9/03

Fingerprint

Data structures
Resource allocation
Scalability
Large scale systems
Quality of service

Keywords

  • Computer architecture
  • Computer vision
  • Data structures
  • Databases
  • Grid computing
  • Indexing
  • Peer to peer computing
  • Power system reliability
  • Robustness
  • Scalability

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

Kothari, A., Agrawal, D., Gupta, A., & Suri, S. (2003). Range addressable network: A P2P cache architecture for data ranges. In Proceedings - 3rd International Conference on Peer-to-Peer Computing, P2P 2003 (pp. 14-22). [1231499] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/PTP.2003.1231499

Range addressable network : A P2P cache architecture for data ranges. / Kothari, A.; Agrawal, D.; Gupta, A.; Suri, S.

Proceedings - 3rd International Conference on Peer-to-Peer Computing, P2P 2003. Institute of Electrical and Electronics Engineers Inc., 2003. p. 14-22 1231499.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kothari, A, Agrawal, D, Gupta, A & Suri, S 2003, Range addressable network: A P2P cache architecture for data ranges. in Proceedings - 3rd International Conference on Peer-to-Peer Computing, P2P 2003., 1231499, Institute of Electrical and Electronics Engineers Inc., pp. 14-22, 3rd International Conference on Peer-to-Peer Computing, P2P 2003, Linkoping, Sweden, 1/9/03. https://doi.org/10.1109/PTP.2003.1231499
Kothari A, Agrawal D, Gupta A, Suri S. Range addressable network: A P2P cache architecture for data ranges. In Proceedings - 3rd International Conference on Peer-to-Peer Computing, P2P 2003. Institute of Electrical and Electronics Engineers Inc. 2003. p. 14-22. 1231499 https://doi.org/10.1109/PTP.2003.1231499
Kothari, A. ; Agrawal, D. ; Gupta, A. ; Suri, S. / Range addressable network : A P2P cache architecture for data ranges. Proceedings - 3rd International Conference on Peer-to-Peer Computing, P2P 2003. Institute of Electrical and Electronics Engineers Inc., 2003. pp. 14-22
@inproceedings{c2ef246ecff543eaafced2dca1de8da8,
title = "Range addressable network: A P2P cache architecture for data ranges",
abstract = "Peer-to-peer computing paradigm is emerging as a scalable and robust model for sharing media objects. We propose an architecture and describe the associated algorithms and data structures to support the execution of range selection queries over data scattered across a P2P network especially for resource discovery in grid environments. We develop a distributed data structure referred to as a range addressable network that provides the following two quality-of-service guarantees: (i) the located peer is one with the smallest superset of the query range (important from the application perspective), and (ii) in a P2P network of n peers, a query is routed through O(log n) peers before the intended peer is found (important from the system perspective). Our preliminary experimental evaluation indicates that the range addressable network has desirable properties of scalability and load-balancing, which are crucial for the success of a large-scale P2P system.",
keywords = "Computer architecture, Computer vision, Data structures, Databases, Grid computing, Indexing, Peer to peer computing, Power system reliability, Robustness, Scalability",
author = "A. Kothari and D. Agrawal and A. Gupta and S. Suri",
year = "2003",
doi = "10.1109/PTP.2003.1231499",
language = "English",
isbn = "0769520235",
pages = "14--22",
booktitle = "Proceedings - 3rd International Conference on Peer-to-Peer Computing, P2P 2003",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Range addressable network

T2 - A P2P cache architecture for data ranges

AU - Kothari, A.

AU - Agrawal, D.

AU - Gupta, A.

AU - Suri, S.

PY - 2003

Y1 - 2003

N2 - Peer-to-peer computing paradigm is emerging as a scalable and robust model for sharing media objects. We propose an architecture and describe the associated algorithms and data structures to support the execution of range selection queries over data scattered across a P2P network especially for resource discovery in grid environments. We develop a distributed data structure referred to as a range addressable network that provides the following two quality-of-service guarantees: (i) the located peer is one with the smallest superset of the query range (important from the application perspective), and (ii) in a P2P network of n peers, a query is routed through O(log n) peers before the intended peer is found (important from the system perspective). Our preliminary experimental evaluation indicates that the range addressable network has desirable properties of scalability and load-balancing, which are crucial for the success of a large-scale P2P system.

AB - Peer-to-peer computing paradigm is emerging as a scalable and robust model for sharing media objects. We propose an architecture and describe the associated algorithms and data structures to support the execution of range selection queries over data scattered across a P2P network especially for resource discovery in grid environments. We develop a distributed data structure referred to as a range addressable network that provides the following two quality-of-service guarantees: (i) the located peer is one with the smallest superset of the query range (important from the application perspective), and (ii) in a P2P network of n peers, a query is routed through O(log n) peers before the intended peer is found (important from the system perspective). Our preliminary experimental evaluation indicates that the range addressable network has desirable properties of scalability and load-balancing, which are crucial for the success of a large-scale P2P system.

KW - Computer architecture

KW - Computer vision

KW - Data structures

KW - Databases

KW - Grid computing

KW - Indexing

KW - Peer to peer computing

KW - Power system reliability

KW - Robustness

KW - Scalability

UR - http://www.scopus.com/inward/record.url?scp=33744818227&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33744818227&partnerID=8YFLogxK

U2 - 10.1109/PTP.2003.1231499

DO - 10.1109/PTP.2003.1231499

M3 - Conference contribution

SN - 0769520235

SN - 9780769520230

SP - 14

EP - 22

BT - Proceedings - 3rd International Conference on Peer-to-Peer Computing, P2P 2003

PB - Institute of Electrical and Electronics Engineers Inc.

ER -