Byzantine fault tolerant systems behave correctly when no more than f out of 3f + 1 replicas fail. When there are more than f failures, traditional BFT protocols make no guarantee...
Voting protocols ensure the consistency of replicated objects by requiring all read and write requests to collect an appropriate quorum of replicas. We propose to replace some of ...
Wireless sensor nodes lack hardware support for tamperresistance and are often deployed in unattended environments, thus leaving them vulnerable to capture and compromise by an ad...
Bo Zhu, Venkata Gopala Krishna Addada, Sanjeev Set...
The paper introduces Self-Replicating Objects (SROs), a new nt programming abstraction. An SRO is implemented and used much like an ordinary .NET object and can expose arbitrary us...
Abstract. One of the main challenges of grid systems of large scale and data intensive is that of providing high availability and performance, in spite of the unreliability and del...
Clock-related operations are one of the many sources of replica non-determinism and of replica inconsistency in fault-tolerant distributed systems. In passive replication, if the ...
Wenbing Zhao, Louise E. Moser, P. M. Melliar-Smith
We propose an architecture for self-adjusting and self-healing atomic memory in highly dynamic systems exploiting peer-to-peer (p2p) techniques. Our approach, named SAM, brings to...
Emmanuelle Anceaume, Maria Gradinariu, Vincent Gra...
Grid computing is an important mechanism for utilizing distributed computing resources. These resources are distributed in different geographical locations, but are organized to p...
In a data-indexed DHT overlay network, published data annotations form distributed databases. Queries are distributed to these databases in a nonuniform way. Constructing content d...
Bassam A. Alqaralleh, Chen Wang, Bing Bing Zhou, A...
We present a replication-based approach that enables both fast and reliable stream processing over wide area networks. Our approach replicates stream processing operators in a man...