Paper Info
Title
Performances Study of the Distributed Spanning Tree an Overlay Network for Server Lookup
Abstract
Random graph and tree are two topologies used to build overlay networks. These overlay networks may be used by large scale discovery mechanisms to run search algorithms. The Distributed Spanning Tree (DST) is another topology that may be used as overlay. In a DST, every computer is a leaf. DST's non-leaf nodes are sets of computers instead of computers. Thus, it allows the use of tree traversal algorithms while avoiding the usual tree's bottlenecks. As a result, the DST allows more efficient executions of search algorithms in term of number of sent messages and in term of load balancing. In this paper, we describe the results of several simulations of flooding algorithm executions. These simulations are run on the three previous topologies and for different numbers of nodes. These simulations indicate that the DST structure is more efficient than graph topology which, in turn, is more efficient than tree topology in term of traversal speed and in term of supported load for every simulated scale. We study as well the behaviour of the DST when nodes are added or deleted to show that the structure is adapted to dynamic environments.
Year
DOI
Venue
2008
10.1109/ICIW.2008.9
Athens
Keywords
Field
DocType
tree topology,dst structure,tree traversal algorithm,search algorithm,previous topology,overlay network,performances study,large scale discovery mechanism,cient execution,usual tree,server lookup,graph topology,overlay networks,load balancing,middleware,load balance,search algorithms,web server,computational modeling,computer networks,random graph,network topology,spanning tree,resource allocation,tree graphs,topology
Random graph,Tree (graph theory),Search algorithm,Tree traversal,Computer science,Load balancing (computing),Computer network,Network topology,Flooding algorithm,Overlay network,Distributed computing
Conference
ISBN
Citations 
PageRank 
978-0-7695-3163-2
0
0.34
References 
Authors
7
4
Name
Order
Citations
PageRank
Sylvain Dahan171.35
Alexandru Dobrila2132.34
Jean-Marc Nicod39518.10
Laurent Philippe47112.95