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

Chen Liping, K. Selçuk Candan, Junichi Tatemura, Divyakant Agrawal, Dirceu Cavendish

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

13 Citations (Scopus)

Abstract

A resource directory is a critical component of a Grid architecture. P2P computing paradigm could address some of the scaldbility issues that make distributed resource discovery services challenging. Unfortunately, most existing Distributed Hash Table (DHT) based P2P overlays have difficulty in treating attribute range queries that are common in resource discovery lookups. This paper proposes a general frame-work for range-based resource discovery. In particular, the proposed framework maps tree-structured logical data (i.e., range indexing) onto a DHT-based physical node space (i.e., resource brokers). In this paper, we consider three mapping schemes from the logical space onto the physical space. Each mapping scheme uses a different replication mechanism to reduce range search time and to achieve load balance. We analytically and experimentally compare the performance characteristics (query/update costs and workload distributions) of these schemes and discuss their applicability under different resource discovery service scenarios.

Original languageEnglish
Title of host publicationProceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005
Pages23-30
Number of pages8
Volume2005
DOIs
Publication statusPublished - 1 Dec 2005
Externally publishedYes
Event5th IEEE International Conference on Peer-to-Peer Computing, P2P 2005 - onstanz, Germany
Duration: 31 Aug 20052 Sep 2005

Other

Other5th IEEE International Conference on Peer-to-Peer Computing, P2P 2005
CountryGermany
Cityonstanz
Period31/8/052/9/05

Fingerprint

Costs

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Liping, C., Candan, K. S., Tatemura, J., Agrawal, D., & Cavendish, D. (2005). On overlay schemes to support point-in-range queries for scalable Grid resource discovery. In Proceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005 (Vol. 2005, pp. 23-30). [1551017] https://doi.org/10.1109/P2P.2005.21

On overlay schemes to support point-in-range queries for scalable Grid resource discovery. / Liping, Chen; Candan, K. Selçuk; Tatemura, Junichi; Agrawal, Divyakant; Cavendish, Dirceu.

Proceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005. Vol. 2005 2005. p. 23-30 1551017.

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

Liping, C, Candan, KS, Tatemura, J, Agrawal, D & Cavendish, D 2005, On overlay schemes to support point-in-range queries for scalable Grid resource discovery. in Proceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005. vol. 2005, 1551017, pp. 23-30, 5th IEEE International Conference on Peer-to-Peer Computing, P2P 2005, onstanz, Germany, 31/8/05. https://doi.org/10.1109/P2P.2005.21
Liping C, Candan KS, Tatemura J, Agrawal D, Cavendish D. On overlay schemes to support point-in-range queries for scalable Grid resource discovery. In Proceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005. Vol. 2005. 2005. p. 23-30. 1551017 https://doi.org/10.1109/P2P.2005.21
Liping, Chen ; Candan, K. Selçuk ; Tatemura, Junichi ; Agrawal, Divyakant ; Cavendish, Dirceu. / On overlay schemes to support point-in-range queries for scalable Grid resource discovery. Proceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005. Vol. 2005 2005. pp. 23-30
@inproceedings{9c33637f2e444c298523ab39e9000174,
title = "On overlay schemes to support point-in-range queries for scalable Grid resource discovery",
abstract = "A resource directory is a critical component of a Grid architecture. P2P computing paradigm could address some of the scaldbility issues that make distributed resource discovery services challenging. Unfortunately, most existing Distributed Hash Table (DHT) based P2P overlays have difficulty in treating attribute range queries that are common in resource discovery lookups. This paper proposes a general frame-work for range-based resource discovery. In particular, the proposed framework maps tree-structured logical data (i.e., range indexing) onto a DHT-based physical node space (i.e., resource brokers). In this paper, we consider three mapping schemes from the logical space onto the physical space. Each mapping scheme uses a different replication mechanism to reduce range search time and to achieve load balance. We analytically and experimentally compare the performance characteristics (query/update costs and workload distributions) of these schemes and discuss their applicability under different resource discovery service scenarios.",
author = "Chen Liping and Candan, {K. Sel{\cc}uk} and Junichi Tatemura and Divyakant Agrawal and Dirceu Cavendish",
year = "2005",
month = "12",
day = "1",
doi = "10.1109/P2P.2005.21",
language = "English",
isbn = "0769523765",
volume = "2005",
pages = "23--30",
booktitle = "Proceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005",

}

TY - GEN

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

AU - Liping, Chen

AU - Candan, K. Selçuk

AU - Tatemura, Junichi

AU - Agrawal, Divyakant

AU - Cavendish, Dirceu

PY - 2005/12/1

Y1 - 2005/12/1

N2 - A resource directory is a critical component of a Grid architecture. P2P computing paradigm could address some of the scaldbility issues that make distributed resource discovery services challenging. Unfortunately, most existing Distributed Hash Table (DHT) based P2P overlays have difficulty in treating attribute range queries that are common in resource discovery lookups. This paper proposes a general frame-work for range-based resource discovery. In particular, the proposed framework maps tree-structured logical data (i.e., range indexing) onto a DHT-based physical node space (i.e., resource brokers). In this paper, we consider three mapping schemes from the logical space onto the physical space. Each mapping scheme uses a different replication mechanism to reduce range search time and to achieve load balance. We analytically and experimentally compare the performance characteristics (query/update costs and workload distributions) of these schemes and discuss their applicability under different resource discovery service scenarios.

AB - A resource directory is a critical component of a Grid architecture. P2P computing paradigm could address some of the scaldbility issues that make distributed resource discovery services challenging. Unfortunately, most existing Distributed Hash Table (DHT) based P2P overlays have difficulty in treating attribute range queries that are common in resource discovery lookups. This paper proposes a general frame-work for range-based resource discovery. In particular, the proposed framework maps tree-structured logical data (i.e., range indexing) onto a DHT-based physical node space (i.e., resource brokers). In this paper, we consider three mapping schemes from the logical space onto the physical space. Each mapping scheme uses a different replication mechanism to reduce range search time and to achieve load balance. We analytically and experimentally compare the performance characteristics (query/update costs and workload distributions) of these schemes and discuss their applicability under different resource discovery service scenarios.

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

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

U2 - 10.1109/P2P.2005.21

DO - 10.1109/P2P.2005.21

M3 - Conference contribution

SN - 0769523765

SN - 9780769523767

VL - 2005

SP - 23

EP - 30

BT - Proceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005

ER -