The University of Southampton
University of Southampton Institutional Repository

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 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 avarage 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
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, 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 avarage message complexity is briefly discussed.

Full text not available from this repository.

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, 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: 29 Jan 2020 15:23

Export record

Contributors

Author: Y. Metivier
Author: P. Wacrenier
Author: M. Mosbah
Author: S. Gruner

University divisions

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×