A dynamic prefix tree for service discovery within large scale grids

Abstract : Within computational grids, some services (software components, linearalgebra libraries, etc.) are made available by some servers to some clients.In spite of the growing popularity of such grids, the service discovery,although efficient in many cases, does not reach several requirements.Among them, the flexibility of the discovery and its efficiency on wide-area dynamic platforms are two major issues. Therefore, it becomescrucial to propose new tools coping with such platforms. Emerging peer-to-peer technologies provide algorithms allowing the distribution and theretrieval of data items while addressing the dynamicity of the underlyingnetwork.We study in this paper the service discovery in a pure peer-to-peer environment. We describe a new trie-based approach for the service discoverythat supports range queries and automatic completion of partial searchstrings, while providing fault-tolerance, and partially taking into accountthe topology of the underlying network. We validate this approach bothby analysis and simulation. Traditional metrics considered in peer-to-peer systems exhibits interesting complexities within our architecture.The analysis' results are confirmed by some simulation experiments runusing several grid's data sets.
Document type :
Reports
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal-lara.archives-ouvertes.fr/hal-02102481
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 1:29:02 PM
Last modification on : Tuesday, April 23, 2019 - 2:24:08 PM

File

RR2006-33.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02102481, version 1

Collections

Citation

Eddy Caron, Frédéric Desprez, Cédric Tedeschi. A dynamic prefix tree for service discovery within large scale grids. [Research Report] Laboratoire de l'informatique du parallélisme. 2006, 2+14p. ⟨hal-02102481⟩

Share

Metrics

Record views

20

Files downloads

29