A Dynamic Prefix Tree for Service Discovery within Large Scale Grids

Abstract : Within computational grids, some services (software components, linear algebra 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 becomes crucial to propose new tools coping with such platforms. Emerging peer-to-peer technologies provide algorithms allowing the distribution and the retrieval of data items while addressing the dynamicity of the underlying network. 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 discovery that supports range queries and automatic completion of partial search strings, while providing fault-tolerance, and partially taking into account the topology of the underlying network. We validate this approach both by 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 run using several grid's data sets.
Type de document :
Rapport
[Research Report] RR-6028, INRIA. 2006, pp.23
Liste complète des métadonnées

Littérature citée [23 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00116111
Contributeur : Rapport de Recherche Inria <>
Soumis le : mardi 28 novembre 2006 - 09:53:29
Dernière modification le : mardi 16 janvier 2018 - 15:42:42
Document(s) archivé(s) le : vendredi 25 novembre 2016 - 14:02:08

Fichier

RR-6028.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00116111, version 4

Collections

Citation

Eddy Caron, Frédéric Desprez, Cédric Tedeschi. A Dynamic Prefix Tree for Service Discovery within Large Scale Grids. [Research Report] RR-6028, INRIA. 2006, pp.23. 〈inria-00116111v4〉

Partager

Métriques

Consultations de la notice

410

Téléchargements de fichiers

99