Sciweavers

148 search results - page 27 / 30
» Self-stabilization of Byzantine Protocols
Sort
View
PODC
2009
ACM
14 years 10 months ago
Brief announcement: global consistency can be easier than point-to-point communication
Global consistency or Byzantine Agreement (BA) and reliable point-to-point communication are two of the most important and well-studied problems in distributed computing. Informal...
Prasant Gopal, Anuj Gupta, Pranav K. Vasishta, Piy...
SRDS
2007
IEEE
14 years 4 months ago
Customizable Fault Tolerance for Wide-Area Replication
Constructing logical machines out of collections of physical machines is a well-known technique for improving the robustness and fault tolerance of distributed systems. We present...
Yair Amir, Brian A. Coan, Jonathan Kirsch, John La...
SODA
2008
ACM
96views Algorithms» more  SODA 2008»
13 years 11 months ago
Unconditionally reliable message transmission in directed networks
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
Bhavani Shankar, Prasant Gopal, Kannan Srinathan, ...
CANS
2007
Springer
150views Cryptology» more  CANS 2007»
14 years 4 months ago
Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary
Abstract. In this paper we study Perfectly Secure Message Transmission (PSMT) between a sender S and a receiver R, connected in a directed synchronous network through multiple para...
Arpita Patra, Bhavani Shankar, Ashish Choudhary, K...
PADL
2009
Springer
14 years 10 months ago
Operational Semantics for Declarative Networking
Declarative Networking has been recently promoted as a high-level programming paradigm to more conveniently describe and implement systems that run in a distributed fashion over a ...
Juan A. Navarro, Andrey Rybalchenko