ABSTRACT
We consider the problem of providing byzantine-tolerant storage in distributed systems where client-server links are much thinner and slower than server-server links. We provide storage algorithms that are unique in two ways. First, our algorithms take into consideration the asymmetry in network connectivity by minimizing client-server communication. To provide this property, we rely on a small amount of partial (eventual) synchrony. Second, our algorithms provide a new property called limited effect, which is important for storage systems. To provide the latter property, we use synchronized clocks, which are increasingly common due to GPS devices and NTP, even in otherwise "asynchronous systems" like the Internet. We present two algorithms called QUAD and LINEAR, which provide a trade-off between failure resiliency and efficiency. Our algorithms implement an abortable register [3], which is an abstraction used in some real storage systems, but abortable registers are weaker than atomic registers. Thus, one might wonder if we could have implemented atomic registers instead. We answer this question in the negative: we prove that there are no implementations of atomic registers that provide the limited effect property in systems with failures, even with synchronized clocks.
- M. Abd-El-Malek, G. R. Ganger, G. R. Goodson, M. K. Reiter, and J. J. Wylie. Fault-scalable byzantine fault-tolerant services. In Symposium on Operating Systems Principles, pages 59--74, Oct. 2005. Google ScholarDigital Library
- I. Abraham, G. Chockler, I. Keidar, and D. Malkhi. Wait-free regular storage from byzantine components. Information Processing Letters, 101(2):60--65, Jan. 2007. Google ScholarDigital Library
- M. K. Aguilera, S. Frolund, V. Hadzilacos, S. L. Horn, and S. Toueg. Abortable and query-abortable objects and their efficient implementation. In Symposium on Principles of Distributed Computing, pages 23--32, Aug. 2007. Google ScholarDigital Library
- A. S. Aiyer, L. Alvisi, and R. A. Bazzi. Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions. In International Symposium on Distributed Computing, pages 7--19, Sept. 2007. Google ScholarDigital Library
- H. Attiya, A. Bar-Noy, and D. Dolev. Sharing memory robustly in message-passing systems. Journal of the ACM, 42(1):124--142, Jan. 1995. Google ScholarDigital Library
- H. Attiya and A. Bar-Or. Sharing memory with semi-byzantine clients and faulty storage servers. Parallel Processing Letters, 16(4):419--428, Dec. 2006.Google ScholarCross Ref
- C. Cachin and S. Tessaro. Optimal resilience for erasure-coded byzantine distributed storage. In International Conference on Dependable Systems and Networks, pages 115--124, June 2006. Google ScholarDigital Library
- M. Castro and B. Liskov. Practical byzantine fault tolerance. In Symposium on Operating Systems Design and Implementation, pages 173--186, Feb. 1999. Google ScholarDigital Library
- G. Chockler and D. Malkhi. Active disk paxos with infinitely many processes. In ACM Symposium on Principles of Distributed Computing, pages 78--87, July 2002. Google ScholarDigital Library
- J. Cowling, D. Meyers, B. Liskov, R. Rodrigues, and L. Shrira. HQ replication: A hybrid quorum protocol for byzantine fault tolerance. In Symposium on operating systems design and implementation, pages 177--190, Dec. 2006. Longer version available as MIT Technical Report MIT-CSAIL-TR-2007-009. Google ScholarDigital Library
- P. Dutta, S. Frolund, R. Guerraoui, and B. Pochon. An efficient universal construction for message-passing systems. In International Symposium on Distributed Computing, pages 133--147, Oct. 2002. Google ScholarDigital Library
- M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374--382, Apr. 1985. Google ScholarDigital Library
- S. Frolund, A. Merchant, Y. Saito, S. Spence, and A. Veitch. A decentralized algorithm for erasure-coded virtual disks. In International Conference on Dependable Systems and Networks, pages 125--134, June 2004. Google ScholarDigital Library
- G. Goodson, J. Wylie, G. Ganger, and M. Reiter. Efficient byzantine-tolerant erasure-coded storage. In International Conference on Dependable Systems, pages 135--144, June 2004. Google ScholarDigital Library
- D. Hendler and N. Shavit. Operation-valency and the cost of coordination. In Symposium on Principles of Distributed Computing, pages 84--91, July 2003. Google ScholarDigital Library
- M. Herlihy, V. Luchangco, and M. Moir. Obstruction-free synchronization: Double-ended queues as an example. In International Conference on Distributed Computing Systems, pages 522--529. IEEE Computer Society, May 2003. Google ScholarDigital Library
- M. Herlihy and J. Wing. Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3):463--492, July 1990. Google ScholarDigital Library
- R. Kotla, L. Alvisi, M. Dahlin, A. Clement, and E. Wong. Zyzzyva: speculative byzantine fault tolerance. In Symposium on Operating Systems Principles, pages 45--58, Oct. 2007. Google ScholarDigital Library
- D. Malkhi and M. Reiter. Secure and scalable replication in Phalanx. In IEEE Symposium on Reliable Distributed Systems, pages 51--60, Oct. 1998. Google ScholarDigital Library
- J.-P. Martin, L. Alvisi, and M. Dahlin. Minimal byzantine storage. In International Symposium on Distributed Computing, pages 311--326, Oct. 2002. Google ScholarDigital Library
- D. L. Mills. Computer Network Time Synchronization: the Network Time Protocol. CRC Press, 2006. Google ScholarDigital Library
- Y. Saito, S. Frolund, A. Veitch, A. Merchant, and S. Spence. FAB: building reliable enterprise storage systems on a shoestring. In Workshop on Hot Topics in Operating Systems, pages 169--174, May 2003. Google ScholarDigital Library
- Y. Saito, S. Frolund, A. Veitch, A. Merchant, and S. Spence. FAB: building distributed enterprise disk arrays from commodity components. In International conference on Architectural support for programming languages and operating systems, pages 48--58, Oct. 2004. Google ScholarDigital Library
Index Terms
- Remote storage with byzantine servers
Recommendations
Byzantine disk paxos: optimal resilience with byzantine shared memory
AbstractWe present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n < 3t disks, t of which may fail by becoming non-responsive or arbitrarily corrupted. We give two constructions of this algorithm; that ...
Use case study of HDD-SSD hybrid storage, distributed storage and HDD storage on OpenStack
IDEAS '15: Proceedings of the 19th International Database Engineering & Applications SymposiumFor typical IaaS cloud usage, frequent provisioning of virtual volumes is needed. However, performance of HDD storage is not sufficient and becomes bottleneck in IaaS cloud. In this paper, we studied a comparison of HDD-SSD hybrid storage, distributed ...
Storage systems for movies-on-demand video servers
MSS '95: Proceedings of the 14th IEEE Symposium on Mass Storage SystemsWe evaluate storage system alternatives for movies-on-demand video servers. We begin by characterizing the movies-on-demand workload. We briefly discuss performance in disk arrays. First, we study disk farms in which one movie is stored per disk. This ...
Comments