Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Harry C. Li, Allen Clement, Edmund L. Wong, Jeff Napper, Indrajit Roy, Lorenzo Alvisi, Michael Dahlin
 

Summary: BAR Gossip
Harry C. Li, Allen Clement, Edmund L. Wong, Jeff Napper, Indrajit Roy,
Lorenzo Alvisi, Michael Dahlin
Laboratory for Advanced Systems Research (LASR),
Dept. of Computer Sciences,
The University of Texas at Austin
We present the first peer-to-peer data stream-
ing application that guarantees predictable
throughput and low latency in the BAR (Byzan-
tine/Altruistic/Rational) model, in which non-
altruistic nodes can behave in ways that are
self-serving (rational) or arbitrarily malicious
(Byzantine). At the core of our solution is a BAR-
tolerant version of gossip, a well-known technique
for scalable and reliable data dissemination. BAR
Gossip relies on verifiable pseudo-random partner
selection to eliminate non-determinism that can
be used to game the system while maintaining the
robustness and rapid convergence of traditional gos-
sip. A novel fair enough exchange primitive entices

  

Source: Alvisi, Lorenzo - Department of Computer Sciences, University of Texas at Austin

 

Collections: Computer Technologies and Information Sciences