Efficiency of Tree-Structured Peer-to-peer Service Discovery Systems

Abstract : The efficiency of service discovery is a crucial point in the development of fully decentralized middlewares intended to manage large scale computational grids. The work conducted on this issue led to the design of many peer-to-peer fashioned approaches. More specifically, the need for flexibility and complexity in the service discovery has seen the emergence of a new kind of overlays, based on tries, also known as lexicographic trees. Although these overlays are efficient and well designed, they require a costly maintenance and do not accurately take into account the heterogeneity of nodes and the changing popularity of the services requested by users. In this paper, we focus on reducing the cost of the maintenance of a particular architecture, based on a dynamic prefix tree, while enhancing it with some load balancing techniques that dynamically adapt the load of the nodes in order to maximize the throughput of the system. The algorithms developed couple a self-organizing prefix tree overlay with load balancing techniques inspired by similar previous works undertaken for distributed hash tables. After some simulation results showing how our load balancing heuristics perform in such an overlay and compare to other heuristics, we provide a fair comparison of this architecture and similar overlays recently proposed.
Type de document :
Rapport
[Research Report] RR2008-18, LIP - ENS Lyon. 2008
Liste complète des métadonnées

https://hal.inria.fr/hal-01428771
Contributeur : Eddy Caron <>
Soumis le : vendredi 6 janvier 2017 - 15:09:59
Dernière modification le : vendredi 20 avril 2018 - 15:44:26

Identifiants

  • HAL Id : hal-01428771, version 1

Collections

Citation

Eddy Caron, Frédéric Desprez, Cédric Tedeschi. Efficiency of Tree-Structured Peer-to-peer Service Discovery Systems. [Research Report] RR2008-18, LIP - ENS Lyon. 2008. 〈hal-01428771〉

Partager

Métriques

Consultations de la notice

279