The Distributed Spanning Tree Structure - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Parallel and Distributed Systems Année : 2009

The Distributed Spanning Tree Structure

Résumé

Search algorithms are a key issue to share resources in large distributed systems as peer networks. Several distributed interconnection structures and algorithms have already been studied in this context. With expanding ring algorithms, the efficiency of searches depends on the topology used to send query requests and on the dynamics of the structure. In this paper, we present an interconnection structure that limits the number of messages needed for search queries. This structure, called Distributed Spanning Tree (DST), defines each node as the root of a spanning tree. So, it behaves as a tree for the number of messages but it balances the load generated by the requests among computers and, thus, it avoids to overload the root~node. This structure is scalable because it only needs a logarithmic memory space per computer to be maintained. A formal and practical description of the structure is presented and we describe traversal algorithms. Simulations show that DST based searches behave better than randomly generated graphs and trees as it generates less messages to query all computers while avoiding the tree bottlenecks.
Fichier principal
Vignette du fichier
dpn09_ij.pdf (477.02 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00560821 , version 1 (30-01-2011)

Identifiants

  • HAL Id : hal-00560821 , version 1

Citer

Sylvain Dahan, Laurent Philippe, Jean-Marc Nicod. The Distributed Spanning Tree Structure. IEEE Transactions on Parallel and Distributed Systems, 2009, pp.1738--1751. ⟨hal-00560821⟩
119 Consultations
1446 Téléchargements

Partager

Gmail Facebook X LinkedIn More