Referenced Items are not available for this document.
We study consensus in a message-passing system where only some of the n2 links exhibit some synchrony. This problem was previously studied for systems with process crashes; we now consider Byzantine failures. We show that consensus can be solved in a system where there is at least one non-faulty process whose links are eventually timely; all other links can be arbitrarily slow. We also show that, in terms of problem solvability, such a system is strictly weaker than one where all links are eventually timely
Published in:
Dependable Systems and Networks, 2006. DSN 2006. International Conference on
Date of Conference: 25-28 June 2006
- Page(s):
- 147 - 155
- Print ISBN:
- 0-7695-2607-1
- INSPEC Accession Number:
- 9177438
- Conference Location :
- Philadelphia, PA
- Digital Object Identifier :
- 10.1109/DSN.2006.22
- 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.
