Majority and unanimity in synchronous networks with ubiquitous dynamic faults

Lecture Notes in Computer Science

Volumn 3499, Issue , 2005, Pages 262-276

  Santoro, Nicola ^a   Widmayer, Peter ^b  

^a CARLETON UNIVERSITY   (Canada)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEM RECOVERY; FAULT TOLERANT COMPUTER SYSTEMS; GRAPH THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; SYNCHRONIZATION; TELECOMMUNICATION LINKS; TOPOLOGY;

DYNAMIC FAULTS; FAILURE MODELS; SYNCHRONOUS NETWORKS; UBIQUITOUS FAILURES;

COMPUTER NETWORKS;

EID: 24944541399     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11429647_21     Document Type: Conference Paper

References (31)

1. M.K. Aguilera, W. Chen, and S. Toueg, "Failure detection and consensus in the crash-recovery model". Distributed Computing 13 (2), 99-125, 2000.
2. M.K. Aguilera and S. Toueg, "A simple bivalency proof that t-resilient consensus requires t+1 rounds". Information Processing Letters 71, 155-158, 1999.
3. Z. Bar-Joseph and M. Ben-Or, "A tight lower bound for randomized synchronous consensus", Proc. ACM Symp. on Principles of Distributed Computing (PODC 98), Puerto Vallarta, 193-199, 1998.
4. M. Ben-Or and D. Ron, "Agreement in presence of faults on networks of bounded degree", Information Processing Letters 57 (6), 329-334, 1996.
5. B.S. Chlebus, K. Diks, and A. Pelc, "Broadcasting in synchronous networks with dynamic faults". Networks 27, 309-318, 1996.
6. F. Cristian, H. Aghili, R. Strong, and D. Dolev, "Atomic broadcast: From simple message diffusion to Byzantine agreement". Information and Computation 118 (1), 158-179, 1995.
7. G. De Marco and A. Rescigno, "Tighter bounds on broadcasting in torus networks in presence of dynamic faults". Parallel Processing Letters 10, 39-49, 2000.
8. G. De Marco and U. Vaccaro, "Broadcasting in hypercubes and star graphs with dynamic faults", Information Processing Letters 66, 309-318, 1998.
9. S. Dobrev, "Computing input multiplicity in anonymous synchronous networks with dynamic faults". In Proc. 26th Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG 2000), LNCS 1928, 138-148, 2000.
10. S. Dobrev, "Communication-efficient broadcasting in complete networks with dynamic faults". In Proc. 9th Coll. on Structural Information and Communication complexity (SIROCCO'02), 101-113, 2002.
11. S. Dobrev and I. Vrt'o, "Optimal broadcasting in hypercubes with dynamic faults". Information Processing Letters 71, 81-85, 1999.
12. S. Dobrev and I. Vrt'o, "Optimal broadcasting in even tori with dynamic faults". Parallel Processing Letters 12, 17-22, 2002.
13. D. Dolev, "The Byzantine generals strike again". J. Algorithms 3 (1), 14-30, 1982.
14. D. Dolev and H. R. Strong, "Polynomial algorithms for multiple processor agreement". In Proc. 14th ACM Symp. on Theory of Computing (STOC 82), 401-407, 1982.
15. C. Dwork, D. Peleg, N. Pippenger and E. Upfal, "Fault tolerance in networks of bounded degree", SIAM J. Computing 17 (5), 975-988, 1988.
16. M. J. Fischer and N.A. Lynch, "A lower bound for the time to assure interactive consistency", Information Processing Letters 14 (4), 183-186, 1982.
17. M. J. Fischer, N.A. Lynch, and M. Merritt, "Easy impossibility proofs for distributed consensus problems", Distributed Computing 1 (1) 26-39, 1986.
18. M. J. Fischer, N.A. Lynch, and M.S. Paterson, "Impossibility of distributed consensus with one faulty process", J. ACM 32 (2), 1985.
19. P. Fraigniaud and C. Peyrat, "Broadcasting in a hypercube when some calls fail", Information Processing Letters 39, 115-119, 1991.
20. L. Gasienic and A. Pelc, "Broadcasting with linearly bounded faults", Discrete Applied Mathematics 83, 121-133, 1998.
21. J. Garay and Y. Moses, "Fully polynomial Byzantine agreement for n > 3t processors in t + 1 rounds". SIAM J. Computing 27 (1), 247-290, 1998.
22. R. Guerraoui and R. R. Levy, "Robust emulation of shared memory in a crashrecovery model. In Proc. 24th Int. Conf. on Dist. Computing Systems (ICDCS'04), 400-407, 2004.
23. V. Hadzilacos, "Connectivity requirements for Byzantine agreement under restricted types of failures". Distributed Computing 2, 95-103, 1987.
24. R. Kralovic, R. Kralovic, and P. Ruzicka, "Broadcasting with many faulty links". In Proc. 10th Coll. on Structural Information and Communication complexity (SIROCCO'03), 211-222, 2003.
25. L. Lamport, R. Shostak and M. Pease, "The Byzantine generals problem". ACM Trans. Programming Languages and Systems 4 (3), 382-401, 1982.
26. Z. Liptak and A. Nickelsen, "Broadcasting in complete networks with dynamic edge faults", In Proc. 4th Int. Conf. on Principles of Distributed Systems (OPODIS 00), Paris, 123-142, 2000.
27. Y. Moses and S. Rajsbaum, "A Layered Analysis of Consensus", SIAM J. Computing 31 (4), 989-1021, 2002.
28. K. J. Perry and S. Toueg, "Distributed agreement in the presence of processor and communication faults". IEEE Trans. Software Engineering SE-12 (3), 477-482, March 1986.
29. N. Santoro and P. Widmayer, "Time is not a healer". In Proc. 6th Symposium on Theoretical Aspects of Computer Science (STAGS 89), 304-313, 1989.
30. N. Santoro and P. Widmayer, "Distributed function evaluation in the presence of transmission faults". In Proc. Int. Symposium on Algorithms (SIGAL 90), 358-367, 1990.
31. U. Schmid and B. Weiss, "Formally verified Byzantine agreement in presence of link faults". In Proc. 22nd Int. Conf. on Distributed Computing Systems (ICDCS 02), 608-616, 2002.