PODC
2006
ACM
14 years 5 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
PODC
2006
ACM
14 years 5 months ago
2006
ACM
We study the implication that various timeliness and failure detector assumptions have on the performance of consensus algorithms that exploit them. We present a general framework...
PODC
2006
ACM
14 years 5 months ago
2006
ACM
PODC
2006
ACM
14 years 5 months ago
2006
ACM
A quorum system over a universe of logical elements is a collection of subsets (quorums) of elements, any two of which intersect. In numerous distributed algorithms, the elements ...
PODC
2006
ACM
14 years 5 months ago
2006
ACM
PODC
2006
ACM
14 years 5 months ago
2006
ACM
PODC
2006
ACM
14 years 5 months ago
2006
ACM
PODC
2006
ACM
14 years 5 months ago
2006
ACM
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
PODC
2006
ACM
14 years 5 months ago
2006
ACM
Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of informatio...
PODC
2006
ACM
14 years 5 months ago
2006
ACM
We consider deterministic distributed broadcasting on multiple access channels in the framework of adversarial queuing. Packets are injected dynamically by an adversary that is co...