DepSpace: A byzantine fault-tolerant coordination service

EuroSys'08 - Proceedings of the EuroSys 2008 Conference

Volumn , Issue , 2008, Pages 163-176

  Bessani, Alysson Neves ^a   Alchieri, Eduardo Pelison ^b   Correia, Miguel ^a   Fraga, Joni Silva ^b  

^a UNIVERSITY OF LISBON   (Portugal)

^b FEDERAL UNIVERSITY OF SANTA CATARINA   (Brazil)

Author keywords

Byzantine fault tolerance; Confidentiality; Tuple space

Indexed keywords

BYZANTINE FAULT TOLERANCE; BYZANTINE FAULTS; CONFIDENTIALITY; COORDINATION MODELS; CRITICAL DATUM; OPEN DISTRIBUTED SYSTEMS; REPLICATED DATUM; SPACE AND TIME; TUPLE SPACE; TUPLE-SPACE COORDINATION MODELS;

ACCESS CONTROL; ERRORS; FAULT TOLERANCE; FAULT TOLERANT COMPUTER SYSTEMS; RELIABILITY;

QUALITY ASSURANCE;

EID: 57749193316     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1352592.1352610     Document Type: Conference Paper

References (45)

1. M. Abd-El-Malek, G. Ganger, G. Goodson, M. Reiter, and J. Wylie. Fault-scalable Byzantine fault-tolerant services. In Proceedings of the 20th ACM Symposium on Operating Systems Principles - SOSP'05, Oct. 2005.
2. M. K. Aguilera, A. Merchant, M. Shah, A. Veitch, and C. Karamanolis. Sinfonia: A new paradigm for building scalable distributed systems. In Proceedings of the 21st ACM Symposium on Operating Systems Principles - SOSP'07, Oct. 2007.
3. J. Albrecht, C. Tuttle, A. C. Snoeren, and A. Vahdat. Loose synchronization for large-scale networked systems. In Proceedings of the 2006 Usenix Annual Technical Conference - Usenix'06, 2006.
4. A. Avizienis, J.-C. Laprie, B. Randell, and C. Landwehr. Basic concepts and taxonomy of dependable and secure computing. IEEE Transactions on Dependable and Secure Computing, 1 (1): 11-33, Mar. 2004.
5. D. E. Bakken and R. D. Schlichting. Supporting fault-tolerant parallel programing in Linda. IEEE Transactions on Parallel and Distributed Systems, 6(3):287-302, Mar. 1995.
6. A. N. Bessani, M. Correia, J. S. Fraga, and L. C. Lung. Sharing memory between Byzantine processes using policy-enforced tuple spaces. In Proceedings of 26th IEEE International Conference on Distributed Computing Systems - ICDCS 2006, July 2006.
7. A. N. Bessani, M. Correia, J. S. Fraga, and L. C. Lung. Decoupled quorum-based Byzantine-resilient coordination in open distributed systems. Technical Report DI-FCUL TR 07-9, Dep. of Informatics, University of Lisbon, May 2007.
8. M. Burrows. The chubby lock service. In Proceedings of 7th Symposium on Operating Systems Design and Implementations - OSDI 2006, Nov. 2006.
9. N. Busi, R. Gorrieri, R. Lucchi, and G. Zavattaro. SecSpaces: a data-driven coordination model for environments open to untrusted agents. Electronical Notes in Theoretical Computer Science, 68(3), 2003.
10. N. Busi, R. Gorrieri, and G. Zavattaro. On the expressiveness of Linda coordination primitives. Information and Computation, 156(1-2):90-121, Jan. 2000.
11. G. Cabri, L. Leonardi, and F. Zambonelli. Mobile agents coordination models for Internet applications. IEEE Computer, 33(2), 2000.
12. C. Cachin and S. Tessaro. Asynchronous verifiable information dispersal. In Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems - SRDS 2005, Oct. 2005.
13. N. Carriero and D. Gelernter. How to write parallel programs: a guide to the perplexed. ACM Computing Surveys, 21(3):323-357, Sept. 1989.
14. M. Castro and B. Liskov. Practical Byzantine fault-tolerance and proactive recovery. ACM Transactions on Computer Systems, 20(4), 2002.
15. M. Castro, R. Rodrigues, and B. Liskov. BASE: Using abstraction to improve fault tolerance. ACM Transactions on Computer Systems, 21(3), Aug. 2003.
16. T. Chandra, R. Griesemer, and J. Redstone. Paxos made live - an engineering perspective (2006 invited talk). In Proceedings of the 26th ACM Symposium on Principles of Distributed Computing - PODC'07, Aug. 2007.
17. Codehaus. Groovy programing language homepage. Available at http://groovy.codehaus.org/, 2006.
18. J. Cowling, D. Myers, B. Liskov, R. Rodrigues, and L. Shrira. HQ-Replication: A hybrid quorum protocol for Byzantine fault tolerance. In Proceedings of 7th Symposium on Operating Systems Design and Implementations - OSDI 2006, Nov. 2006.
19. C. Dwork, N. A. Lynch, and L. Stockmeyer. Consensus in the presence of partial synchrony. Journal of the ACM, 35(2):288-322, Apr. 1988.
20. F. Favarim, J. S. Fraga, L. C. Lung, and M. Correia. GridTS: A new approach for fault-tolerant scheduling in grid computing. In Proceedings of 6th IEEE Symposium on Network Computing and Applications - NCA 2007, July 2007.
21. J. S. Fraga and D. Powell. A fault- and intrusion-tolerant file system. In Proceedings of the 3rd International Conference on Computer Security, 1985.
22. D. Gelernter, Generative communication in Linda. ACM Transactions on Programing Languages and Systems, 7(1):80-112, Jan. 1985.
23. GigaSpaces. GigaSpaces - write once, scale anywere. Avaliable at http://www.gigaspaces.com/, 2007.
24. G. R. Goodson, J. J. Wylie, G. R. Ganger, and M. K. Reiter. Efficient Byzantine-tolerant erasure-coded storage. In Proceedings of Dependable Systems and Networks - DSN 2004, June 2004.
25. J. Hendricks, G. Ganger, and M. Reiter. Low-overhead Byzantine fault-tolerant storage. In Proceedings of the 21st ACM Symposium on Operating Systems Principles - SOSP'07, Oct. 2007.
26. M. Herlihy. Wait-free synchronization. ACM Transactions on Programing Languages and Systems, 13(1):124-149, Jan. 1991.
27. M. Herlihy and J. M. Wing. Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programing Languages and Systems, 12(3):463-492, July 1990.
28. R. Kotla, L., Alvisi, M. Dahlin, A. Clement, and E. Wong. Zyzzyva: Speculative Byzantine fault tolerance. In Proceedings of the 21st ACM Symposium on Operating Systems Principles - SOSP'07, Oct. 2007.
29. S. Lakshmanan, M. Ahamad, and H. Venkateswaran. Responsive security for stored data. IEEE Transactions on Parallel and Distributed Systems, 14(9):818-828, Sept. 2003.
30. T. J. Lehman, A. Cozzi, Y. Xiong, J. Gottschalk, V. Vasudevan, S. Landis, P. Davis, B. Khavar, and P. Bowman. Hitting the distributed computing sweet spot with TSpaces. Computer Networks, 35(4):457-472, Mar. 2001.
31. M. A. Marsh and F. B. Schneider. CODEX: A robust and secure secret distribution system. IEEE Transactions on Dependable and Secure Computing, 1(1):34-47, Jan. 2004.
32. J.-P. Martin and L. Alvisi. Fast Byzantine consensus. IEEE Transactions on Dependable and Secure Computing, 3(3):202-215, July 2006.
33. N. H. Minsky, Y. M. Minsky, and V. Ungureanu. Making tuple-spaces safe for heterogeneous distributed systems. In Proceedings of the 15th ACM Symposium on Applied Computing - SAC 2000, 2000.
34. R. R. Obelheiro, A. N. Bessani, L. C. Lung, and M. Correia. How practical are intrusion-tolerant distributed systems? DI-FCUL TR 06-15, Dep. of Informatics, University of Lisbon, Sept. 2006.
35. F. B. Schneider. Implementing fault-tolerant service using the state machine aproach: A tutorial. ACM Computing Surveys, 22(4), 1990.
36. B. Schoenmakers. A simple publicly verifiable secret sharing scheme and its application to electronic voting. In Proceedings of the 19th International Cryptology Conference on Advances in Cryptology - CRYPTO'99, Aug. 1999.
37. E. J. Segall. Resilient distributed objects: Basic results and applications to shared spaces. In Proceedings of the 7th IEEE Symposium, on Parallel and Distributed Processing - SPDP'95, Oct. 1995.
38. A. Shamir. How to share a secret. Communications of ACM, 22(11):612-613, Nov. 1979.
39. Sun Microsystems. JavaSpaces service specification. Availiable at http://www.jini.org/standards, 2003.
40. P. Verissimo, N. F. Neves, and M. P. Correia. Intrusion-tolerant architectures: Concepts and design. In Architecting Dependable Systems, volume 2677 of LNCS. 2003.
41. J. Vitek, C. Bryce, and M. Oriol. Coordination processes with Secure Spaces. Science of Computer Programming, 46(1-2):163-193, Jan. 2003.
42. B. White, J. Lepreau, L. Stoller, R. Ricci, S. Guruprasad, M. Newbold, M. Hibler, C. Barb, and A. Joglekar. An integrated experimental environment for distributed systems and networks. In Proceedings of 5th Symposium on Operating Systems Design and Implementations - OSDI 2002, Dec. 2002.
43. A. Xu and B. Liskov. A design for a fault-tolerant, distributed implementation of Linda. In Proceedings of the 19th Symposium on Fault-Tolerant Computing - FTCS'89, June 1989.
44. J. Yin, J.-P. Martin, A. Venkataramani, L. Alvisi, and M. Dahlin. Separating agreement form execution for Byzantine fault tolerant services. In Proceedings of the 19th ACM Symposium, on Operating Systems Principles - SOSP'03, Oct. 2003.
45. P. Zielinski. Paxos at war. Technical Report UCAM-CL-TR-593, University of Cambridge Computer Laboratory, June 2004.