Lottery trees: motivational deployment of networked systems
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
How robust are gossip-based communication protocols?
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
SecureStream: An intrusion-tolerant protocol for live-streaming dissemination
Computer Communications
Dandelion: cooperative content distribution with robust incentives
ATC'07 2007 USENIX Annual Technical Conference on Proceedings of the USENIX Annual Technical Conference
Nysiad: practical protocol transformation to tolerate Byzantine failures
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Brahms: byzantine resilient random membership sampling
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Incentivizing outsourced computation
Proceedings of the 3rd international workshop on Economics of networked systems
AVMEM - availability-aware overlays for management operations in non-cooperative distributed systems
Proceedings of the ACM/IFIP/USENIX 2007 International Conference on Middleware
Model checking nash equilibria in MAD distributed systems
Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
Antfarm: efficient content distribution with managed swarms
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Rappel: Exploiting interest and network locality to improve fairness in publish-subscribe systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Brahms: Byzantine resilient random membership sampling
Computer Networks: The International Journal of Computer and Telecommunications Networking
EquiCast: Scalable multicast with selfish users
Computer Networks: The International Journal of Computer and Telecommunications Networking
Journal of Systems and Software
Proceedings of the 10th ACM/IFIP/USENIX International Conference on Middleware
Epidemic protocols for pervasive computing systems: moving focus from architecture to protocol
M-PAC '09 Proceedings of the International Workshop on Middleware for Pervasive Mobile and Embedded Computing
FairTorrent: bringing fairness to peer-to-peer systems
Proceedings of the 5th international conference on Emerging networking experiments and technologies
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
FoG: Fighting the Achilles' Heel of Gossip Protocols with Fountain Codes
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Model Checking Coalition Nash Equilibria in MAD Distributed Systems
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
AVMEM: availability-aware overlays for management operations in non-cooperative distributed systems
MIDDLEWARE2007 Proceedings of the 8th ACM/IFIP/USENIX international conference on Middleware
Middleware'09 Proceedings of the ACM/IFIP/USENIX 10th international conference on Middleware
Computer Networks: The International Journal of Computer and Telecommunications Networking
Scalable byzantine computation
ACM SIGACT News
Simplifying distributed system development
HotOS'09 Proceedings of the 12th conference on Hot topics in operating systems
Contracts: practical contribution incentives for P2P live streaming
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
Collusion-resilient credit-based reputations for peer-to-peer content distribution
Proceedings of the 2010 Workshop on Economics of Networks, Systems, and Computation
Sustaining collaboration in multicast despite rational collusion
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Efficient cooperative backup with decentralized trust management
ACM Transactions on Storage (TOS)
P2P as a CDN: A new service model for file sharing
Computer Networks: The International Journal of Computer and Telecommunications Networking
DCast: sustaining collaboration in overlay multicast despite rational collusion
Proceedings of the 2012 ACM conference on Computer and communications security
Future Generation Computer Systems
What's a little collusion between friends?
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Reasoning with MAD distributed systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Hi-index | 0.00 |
We present the first peer-to-peer data streaming application that guarantees predictable throughput and low latency in the BAR (Byzantine/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 gossip. A novel fair enough exchange primitive entices cooperation among selfish nodes on short timescales, avoiding the need for long-term node reputations. Our initial experience provides evidence for BAR Gossip's robustness. Our BAR-tolerant streaming application provides over 99% convergence for broadcast updates when all clients are selfish but not colluding, and over 95% convergence when up to 40% of clients collude while the rest follow the protocol. BAR Gossip also performs well when the client population consists of both selfish and Byzantine nodes, achieving over 93% convergence even when 20% of the nodes are Byzantine.