Metivier, Y., Wacrenier, P., Mosbah, M. and Gruner, S.
A Distributed Algorithm for Computing a Spanning Tree in Anonymous T-Prime Graphs
At OPODIS 2001: Proc of the 5th International Conference on Principles of Distributed Systems: Manzanillo (Mexico).
Full text not available from this repository.
A random-based distributed protocol for computing spanning trees in anonymous networks is presented. This cannot be achieved with deterministic (non-random) protocols. The distributed actuation of the protocol will succed if the network is representable as T-prime graph. Otherwise, the attempt may fail (though the probability of failure seems to be small in many practical cases). Based on some runtime experiments, the protocol's avarage message complexity is briefly discussed. [<A HREF="http://www.stefan-gruner.de/spanning.ps.gz">Download Paper *.ps.gz</A>]
Conference or Workshop Item
||Preliminary Proceedings available on CD-ROM.. Organisation: See http://webdia.cem.itesm.mx/ac/rogomez/OPODIS01/
|Venue - Dates:
||OPODIS 2001: Proc of the 5th International Conference on Principles of Distributed Systems: Manzanillo (Mexico), 2001-12-01
||Electronics & Computer Science
||18 Feb 2002
||17 Apr 2017 23:10
|Further Information:||Google Scholar|
Actions (login required)