Sciweavers

11 search results - page 2 / 3
» podc 2012
Sort
View
PODC
2012
ACM
11 years 7 months ago
Asynchronous failure detectors
Failure detectors — oracles that provide information about process crashes — are an important ion for crash tolerance in distributed systems. Although current failure-detector...
Alejandro Cornejo, Nancy A. Lynch, Srikanth Sastry
PODC
2012
ACM
11 years 7 months ago
On the price of equivocation in byzantine agreement
In the Byzantine agreement problem, a set of n processors, any f of whom may be arbitrarily faulty, must reach agreement on a value proposed by one of the correct processors. It i...
Alexander Jaffe, Thomas Moscibroda, Siddhartha Sen
PODC
2012
ACM
11 years 7 months ago
Brief announcement: a calculus of policy-based routing systems
The BGP (Border Gateway Protocol) is the single inter-domain routing protocol that enables network operators within each autonomous system (AS) to influence routing decisions by ...
Anduo Wang, Carolyn L. Talcott, Alexander J. T. Gu...
PODC
2012
ACM
11 years 7 months ago
The cost of fault tolerance in multi-party communication complexity
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gib...
PODC
2012
ACM
11 years 7 months ago
Byzantine broadcast in point-to-point networks using local linear coding
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
Guanfeng Liang, Nitin H. Vaidya