Rosebud: A Scalable Byzantine-Fault-Tolerant Storage Architecture
This paper presents Rosebud, a new Byzantine faulttolerantstorage architecture designed to be highly scalableand deployable in the wide-area. To support massiveamounts of data, we need to partition the data among thenodes. To support long-lived operation, we need to allowthe set of nodes in the syst...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://hdl.handle.net/1721.1/30440 |
| _version_ | 1811093443700588544 |
|---|---|
| author | Rodrigues, Rodrigo Liskov, Barbara |
| author2 | Programming Methodology |
| author_facet | Programming Methodology Rodrigues, Rodrigo Liskov, Barbara |
| author_sort | Rodrigues, Rodrigo |
| collection | MIT |
| description | This paper presents Rosebud, a new Byzantine faulttolerantstorage architecture designed to be highly scalableand deployable in the wide-area. To support massiveamounts of data, we need to partition the data among thenodes. To support long-lived operation, we need to allowthe set of nodes in the system to change. To our knowledge,we are the first to present a complete design and arunning implementation of Byzantine-fault-tolerant storagealgorithms for a large scale, dynamic membership.We deployed Rosebud in a wide area testbed and ran experimentsto evaluate its performance, and our experimentsshow that it performs well. We show that our storage algorithmsperform equivalently to highly optimized replicationalgorithms in the wide-area. We also show that performancedegradation is minor when the system reconfigures. |
| first_indexed | 2024-09-23T15:45:08Z |
| id | mit-1721.1/30440 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T15:45:08Z |
| publishDate | 2005 |
| record_format | dspace |
| spelling | mit-1721.1/304402019-04-11T06:23:22Z Rosebud: A Scalable Byzantine-Fault-Tolerant Storage Architecture Rodrigues, Rodrigo Liskov, Barbara Programming Methodology This paper presents Rosebud, a new Byzantine faulttolerantstorage architecture designed to be highly scalableand deployable in the wide-area. To support massiveamounts of data, we need to partition the data among thenodes. To support long-lived operation, we need to allowthe set of nodes in the system to change. To our knowledge,we are the first to present a complete design and arunning implementation of Byzantine-fault-tolerant storagealgorithms for a large scale, dynamic membership.We deployed Rosebud in a wide area testbed and ran experimentsto evaluate its performance, and our experimentsshow that it performs well. We show that our storage algorithmsperform equivalently to highly optimized replicationalgorithms in the wide-area. We also show that performancedegradation is minor when the system reconfigures. 2005-12-22T01:15:38Z 2005-12-22T01:15:38Z 2003-12-17 MIT-CSAIL-TR-2003-035 MIT-LCS-TR-932 http://hdl.handle.net/1721.1/30440 en_US Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory 14 p. 28245099 bytes 1025372 bytes application/postscript application/pdf application/postscript application/pdf |
| spellingShingle | Rodrigues, Rodrigo Liskov, Barbara Rosebud: A Scalable Byzantine-Fault-Tolerant Storage Architecture |
| title | Rosebud: A Scalable Byzantine-Fault-Tolerant Storage Architecture |
| title_full | Rosebud: A Scalable Byzantine-Fault-Tolerant Storage Architecture |
| title_fullStr | Rosebud: A Scalable Byzantine-Fault-Tolerant Storage Architecture |
| title_full_unstemmed | Rosebud: A Scalable Byzantine-Fault-Tolerant Storage Architecture |
| title_short | Rosebud: A Scalable Byzantine-Fault-Tolerant Storage Architecture |
| title_sort | rosebud a scalable byzantine fault tolerant storage architecture |
| url | http://hdl.handle.net/1721.1/30440 |
| work_keys_str_mv | AT rodriguesrodrigo rosebudascalablebyzantinefaulttolerantstoragearchitecture AT liskovbarbara rosebudascalablebyzantinefaulttolerantstoragearchitecture |