| Abstract
|
Open distributed systems are typically com … Open distributed systems are typically composed by an unknown number of processes running in heterogeneous hosts. Their communication often requires tolerance to temporary disconnections and security against malicious actions. Tuple spaces are a well-known coordination model for this kind of
systems. They can support communication that is decoupled both in time and space. There are currently several implementations of distributed fault-tolerant tuple spaces but they are not Byzantine-resilient, i.e., they do not provide a correct service if some replicas are attacked and start to misbehave. This paper presents an efficient implementation of a Linearizable Byzantine fault-tolerant
Tuple Space (LBTS) that uses a novel Byzantine quorum systems replication technique in which most operations are implemented by quorum protocols while stronger operations are implemented by more expensive protocols based on consensus. LBTS is linearizable and wait-free, showing interesting performance gains when compared to a similar construction based on state machine replication. uction based on state machine replication.
|
| Author
|
Alysson Bessani +
, Miguel Correia +
, Joni Fraga +
, Lau Cheuk Lung +
|
| Journal
|
IEEE Transactions on Computers. Vol. 58 no. 8. pp. 1080-1094. IEEE Computer Society. August 2009. +
|
| Key
|
Bessani09tc2 +
|
| Month
|
aug +
|
| NumPubDate
|
2,009.08 +
|
| Project
|
Project:CRUTIAL +
|
| ResearchLine
|
Fault And Intrusion Tolerance in Open Distributed Systems (FIT) +
|
| Title
|
An Efficient Byzantine-Resilient Tuple Space +
|
| Type
|
article +
|
| Url
|
http://www.navigators.di.fc.ul.pt/archive/papers/tc09-lbts.pdf +
|
| Year
|
2009 +
|
| Categories |
Publication +
|
| Modification dateThis property is a special property in this wiki.
|
14 January 2013 14:41:04 +
|
