A Distributed Algorithm for Computing a Spanning Tree in Anonymous T-Prime Graphs


Metivier, Y., Wacrenier, P., Mosbah, M. and Gruner, S. (2001) A Distributed Algorithm for Computing a Spanning Tree in Anonymous T-Prime Graphs. OPODIS 2001: Proc of the 5th International Conference on Principles of Distributed Systems: Manzanillo (Mexico)

Download

Full text not available from this repository.

Description/Abstract

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>]

Item Type: Conference or Workshop Item (UNSPECIFIED)
Additional Information: Preliminary Proceedings available on CD-ROM.. Organisation: See http://webdia.cem.itesm.mx/ac/rogomez/OPODIS01/
Divisions: Faculty of Physical Sciences and Engineering > Electronics and Computer Science
ePrint ID: 256071
Date Deposited: 18 Feb 2002
Last Modified: 27 Mar 2014 19:58
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/256071

Actions (login required)

View Item View Item