Referenced Items are not available for this document.
We design two protocols that maintain the nodes of any computer network in a rooted spanning tree and in a unidirectional ring, respectively, in the presence of any finite number of fail-stop failures and repairs of network nodes and communication channels. Our protocols are fully distributed, have optimal time and space complexity, and illustrate two different methods for the design of nonmasking fault-tolerant protocols
Published in:
Network Protocols, 1994. Proceedings., 1994 International Conference on
Date of Conference: 25-28 Oct 1994
- Page(s):
- 221 - 228
- Meeting Date :
- 25 Oct 1994-28 Oct 1994
- Print ISBN:
- 0-8186-6685-4
- INSPEC Accession Number:
- 4834863
- Conference Location :
- Boston, MA
- Digital Object Identifier :
- 10.1109/ICNP.1994.344357
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
