Non-stop Internet model based on Circle Quorum System
暂无分享,去创建一个
Jianling Sun | Ping Song | Zhijun He | Jianling Sun | Ping Song | Zhijun He
[1] Mostafa H. Ammar,et al. Performance Characterization of Quorum-Consensus Algorithms for Replicated Data , 1989, IEEE Trans. Software Eng..
[2] Cho-Li Wang,et al. Directed Point: An Efficient Communication Subsystem for Cluster Computing , 1998 .
[3] Gustavo Alonso,et al. How to select a replication protocol according to scalability, availability and communication overhead , 2001, Proceedings 20th IEEE Symposium on Reliable Distributed Systems.
[4] Michael Dahlin,et al. Small byzantine quorum systems , 2002, Proceedings International Conference on Dependable Systems and Networks.
[5] Man Hon Wong,et al. Diamond Quorum Consensus for High Capacity and Efficiency in a Replicated Database System , 2004, Distributed and Parallel Databases.
[6] Akhil Kumar. An Efficient SuperGrid Protocol for High Availability and Load Balancing , 2000, IEEE Trans. Computers.
[7] Jan Janecek,et al. Dynamic behaviour of the distributed tree quorum algorithm , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.
[8] Michael K. Reiter,et al. Fault detection for Byzantine quorum systems , 1999, Dependable Computing for Critical Applications 7.
[9] Tatsuhiro Tsuchiya,et al. Byzantine quorum systems with maximum availability , 2002, Information Processing Letters.
[10] David Peleg,et al. Crumbling walls: a class of practical and efficient quorum systems , 1995, PODC '95.