Showing cs.DCShow all
3 papers · 1 filter
cs.DC2005
Papillon: Greedy Routing in Rings
Ittai Abraham, Dahlia Malkhi, Gurmeet Singh Manku
We study {\sc greedy} routing over nodes placed in a ring, with the \emph{distance} between two nodes defined to be the clockwise or the absolute distance between them along th…
cs.DC1999
The Load and Availability of Byzantine Quorum Systems
Dahlia Malkhi, Michael Reiter, Avishai Wool
Replicated services accessed via {\em quorums} enable each access to be performed at only a subset (quorum) of the servers, and achieve consistency across accesses by requiring any…
cs.DC1999
On Propagating Updates in a Byzantine Environment
Dahlia Malkhi, Yishay Mansour, Michael Reiter
We study how to efficiently diffuse updates to a large distributed system of data replicas, some of which may exhibit arbitrary (Byzantine) failures. We assume that strictly fewer…