Issue No. 12 - December (2009 vol. 20)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2009.22
Sylvain Dahan , Laboratoire d'Informatique LIFC, Besançon
Laurent Philippe , Laboratoire d'Informatique LIFC, Besançon
Jean-Marc Nicod , Laboratoire d'Informatique LIFC, Besançon
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 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 needs only 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.
Distributed systems, search algorithms, expanding ring algorithms, interconnection graphs.
L. Philippe, S. Dahan and J. Nicod, "The Distributed Spanning Tree Structure," in IEEE Transactions on Parallel & Distributed Systems, vol. 20, no. , pp. 1738-1751, 2009.