A distributed algorithm for computing a spanning tree in anonymous T-prime graphs
A distributed algorithm for computing a spanning tree in anonymous T-prime graphs
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 average message complexity is briefly discussed.
Metivier, Y.
91373609-4401-4cf3-937d-ad59f423e174
Wacrenier, P.
9e990ceb-d945-4b49-aa60-f2a06100c3fa
Mosbah, M.
76999736-f2f1-4278-b9b4-43831aaf6532
Gruner, S.
66ccd82a-f66d-4b87-8894-60303019064b
December 2001
Metivier, Y.
91373609-4401-4cf3-937d-ad59f423e174
Wacrenier, P.
9e990ceb-d945-4b49-aa60-f2a06100c3fa
Mosbah, M.
76999736-f2f1-4278-b9b4-43831aaf6532
Gruner, S.
66ccd82a-f66d-4b87-8894-60303019064b
Metivier, Y., Wacrenier, P., Mosbah, M. and Gruner, S.
(2001)
A distributed algorithm for computing a spanning tree in anonymous T-prime graphs.
Proceedings of the 5th International Conference on Principles of Distributed Systems, , Manzanillo, Mexico.
01 Dec 2001.
Record type:
Conference or Workshop Item
(Other)
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 average message complexity is briefly discussed.
This record has no associated files available for download.
More information
Published date: December 2001
Additional Information:
Preliminary Proceedings available on CD-ROM.. Organisation: See http://webdia.cem.itesm.mx/ac/rogomez/OPODIS01/
Venue - Dates:
Proceedings of the 5th International Conference on Principles of Distributed Systems, , Manzanillo, Mexico, 2001-12-01 - 2001-12-01
Organisations:
Electronics & Computer Science
Identifiers
Local EPrints ID: 256071
URI: http://eprints.soton.ac.uk/id/eprint/256071
PURE UUID: 4d709fc4-eec7-47f2-9c02-4b4ada0f8cd3
Catalogue record
Date deposited: 18 Feb 2002
Last modified: 14 Mar 2024 05:37
Export record
Contributors
Author:
Y. Metivier
Author:
P. Wacrenier
Author:
M. Mosbah
Author:
S. Gruner
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics