Local search heuristic for k-median and facility location problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Journal of the ACM (JACM)
On selfish routing in internet-like environments
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
The impact of DHT routing geometry on resilience and proximity
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Market-Based Resource Allocation for Content Delivery in the Internet
IEEE Transactions on Computers
Robust incentive techniques for peer-to-peer networks
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Secure routing for structured peer-to-peer overlay networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
The price of selfish behavior in bilateral network formation
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
Dynamic overlay routing based on available bandwidth estimation: a simulation study
Computer Networks: The International Journal of Computer and Telecommunications Networking - Overlay distribution structures and their applications
On the topologies formed by selfish peers
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Minimizing churn in distributed systems
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Reliability and security in the CoDeeN content distribution network
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Congestion games with malicious players
Proceedings of the 8th ACM conference on Electronic commerce
Colyseus: a distributed architecture for online multiplayer games
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
Modeling Heterogeneous User Churn and Local Resilience of Unstructured P2P Networks
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
ECHOS: edge capacity hosting overlays of nano data centers
ACM SIGCOMM Computer Communication Review
A comparison of structured and unstructured P2P approaches to heterogeneous random peer selection
ATC'07 2007 USENIX Annual Technical Conference on Proceedings of the USENIX Annual Technical Conference
Donnybrook: enabling large-scale, high-speed, peer-to-peer games
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Network coordinates in the wild
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Comparison of public end-to-end bandwidth estimation tools on high-speed links
PAM'05 Proceedings of the 6th international conference on Passive and Active Network Measurement
QRON: QoS-aware routing in overlay networks
IEEE Journal on Selected Areas in Communications
A geography-aware service overlay network for managing moving objects
MobiDE '12 Proceedings of the Eleventh ACM International Workshop on Data Engineering for Wireless and Mobile Access
Selfish overlay network creation and maintenance
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
A foundational issue underlying many overlay network applications ranging from routing to peer-to-peer file sharing is that of connectivity management, i.e., folding new arrivals into an existing overlay, and re-wiring to cope with changing network conditions. Previous work has considered the problem from two perspectives: devising practical heuristics for specific applications designed to work well in real deployments, and providing abstractions for the underlying problem that are analytically tractable, especially via game-theoretic analysis. In this paper, we unify these two thrusts by using insights gleaned from novel, realistic theoretic models in the design of EGOIST -- a distributed overlay routing system that we implemented, deployed, and evaluated on PlanetLab. Using extensive measurements of paths between nodes, we demonstrate that EGOIST'S neighbor selection primitives significantly outperform existing heuristics on a variety of performance metrics, including delay, available bandwidth, and node utilization. Moreover, we demonstrate that EGOIST is competitive with an optimal, but unscalable full-mesh approach, remains highly effective under significant churn, is robust to cheating, and incurs minimal overhead. Finally, we use a multiplayer peer-to-peer game to demonstrate the value of EGOIST to end-user applications.