Non-skipping timestamps for byzantine data storage systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3274, Issue , 2004, Pages 405-419

  Bazzi, Rida A ^a   Ding, Yin ^a  

^a Arizona State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

BYZANTINE FAILURES; DATA STORAGE SYSTEMS; FAULTY SERVERS; REPLICATED DATA; SPACE REQUIREMENTS; TIME STAMPS;

DIGITAL STORAGE;

EID: 35048817626     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30186-8_29     Document Type: Article

References (18)

1. R. A. Bazzi. Access cost for asynchronous byzantine quorum systems. Distributed Computing Journal, 14:41-48, January 1992.
2. Castro and Liskov. Practical byzantine fault tolerance. In OSDI: Symposium on Operating Systems Design and Implementation. USENIX Association, Cosponsored by IEEE TCOS and ACM SIGOPS, 1999.
3. R. Fan. Efficient replication of large data objects. In Thesis, Computer Science and Engineering, MIT, 2003.
4. M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1):124-149, January 1991.
5. M. P. Herlihy and J. M. Wing. Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems (TOPLAS), 12(3):463-492, 1990.
6. Lamport, Shostak, and Pease. The byzantine generals problem. In Advances in Ultra-Dependable Distributed Systems, N. Suri, C. J. Walter, and M. M. Hugue (Eds.), IEEE Computer Society Press. 1995.
7. L. Lamport. On interprocess communication. In Distributed Computing, pages 1:76-101, 1986.
8. M. Li, J. Tromp, and P. M. B. Vitányi. How to share concurrent wait-free variables. Journal of the ACM, 43(4):723-746, 1996.
9. D. Malkhi and M. Reiter. Byzantine quorum systems. In Proceedings of the 29th ACM Symposium on Theory of Computing (STOC), pages 569-578, 1997.
10. D. Malkhi, M. Reiter, and A. Wool. The load and availability of Byzantine quorum systems. SIAM J. Computing, 29(6):1889-1906, 2000.
11. D. Malkhi and M. K. Reiter. Secure and scalable replication in phalanx. In Symposium on Reliable Distributed Systems, pages 51-58, 1998.
12. D. Malkhi, M. K. Reiter, and R. N. Wright. Probabilistic quorum systems. In Symposium on Principles of Distributed Computing, pages 267-273, 1997.
13. J.-P. Martin, L. Alvisi, and M. Dahlin. Minimal Byzantine storage. In Distributed Computing, 16th international Conference, DISC 2002, pages 311-325, October 2002.
14. M. Naor and A. Wool. The load, capacity and availability of quorum systems. SIAM J. Computing, 27(2):423-447, April 1998.
15. J.-F. Paris. Voting with witnesses: A consistency scheme for replicated files. In In Proc. of the 6th International Conference on Distributed Computer Systems, pages 606-612, 1986.
16. G. Peterson and J. Burns. Concurrent reading while writing ii: The multiwriter case. In In Proc. 28th IEEE Symp. Found. Comput. Sci., pages 383-392, 1987.
17. E. Pierce and L. Alvisi. A framework for semantic reasoning about byzantine quorum systems, 2001.
18. L. S. Rivka Ladin, Barbara Liskov and S. Ghemawat. Providing high availability using lazy replication. ACM Transaction on Computer Systems, 10(4):360-391, 1992.