e-approximations with minimum packing constraint violation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Analysis of a local search heuristic for facility location problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Journal of the ACM (JACM)
Distributed algorithmic mechanism design: recent results and future directions
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
A constant-factor approximation algorithm for the k-median problem
Journal of Computer and System Sciences - STOC 1999
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On selfish routing in internet-like environments
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
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Bullet: high bandwidth data dissemination using an overlay mesh
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
SplitStream: high-bandwidth multicast in cooperative environments
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Market-Based Resource Allocation for Content Delivery in the Internet
IEEE Transactions on Computers
Local Search Heuristics for k-Median and Facility Location Problems
SIAM Journal on Computing
Robust incentive techniques for peer-to-peer networks
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
The price of selfish behavior in bilateral network formation
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Performance of peer-to-peer networks: service capacity and role of resource sharing policies
Performance Evaluation - P2P computing systems
Improving Traffic Locality in BitTorrent via Biased Neighbor Selection
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Analyzing Multiple File Downloading in BitTorrent
ICPP '06 Proceedings of the 2006 International Conference on Parallel Processing
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
Can ISPS and P2P users cooperate for improved performance?
ACM SIGCOMM Computer Communication Review
The price of anarchy in network creation games
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Algorithmic Game Theory
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
Donnybrook: enabling large-scale, high-speed, peer-to-peer games
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
EGOIST: overlay routing using selfish neighbor selection
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Overlay network creation and maintenance with selfish users
Overlay network creation and maintenance with selfish users
Reducibility among Fractional Stability Problems
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Distributed Network Formation for n-Way Broadcast Applications
IEEE Transactions on Parallel and Distributed Systems
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
Hi-index | 0.00 |
A foundational issue underlying many overlay network applications ranging from routing to peer-to-peer file sharing is that of the network formation, i.e., folding new arrivals into an existing overlay, and rewiring to cope with changing network conditions. Previous work has considered the problem from two perspectives: devising practical heuristics for the case of cooperative peers and performing game-theoretic analysis for the case of selfish peers. In this paper, we unify the aforementioned thrusts by defining and studying the selfish neighbor selection (SNS) game and its application to overlay routing. At the heart of SNS stands the restriction that peers are allowed up to a certain number of neighbors. This makes SNS substantially different from existing network formation games that impose no bounds on peer degrees. Having bounded degrees has important practical consequences as it permits the creation of overlay structures that require O(n) instead of O(n2) link monitoring overhead. We show that a node's "best response" wiring strategy amounts to solving a k-median problem on asymmetric distance. Best-response wirings have substantial practical utility as they permit selfish nodes to reap substantial performance benefits when connecting to overlays of nonselfish nodes. A more intricate consequence is that even nonselfish nodes can benefit from the existence of some selfish nodes since the latter, via their local optimizations, create a highly optimized backbone, upon which even simple heuristic wirings yield good performance. To capitalize on the above properties, we design, build, and deploy EGOIST, an SNS-inspired prototype overlay routing system for PlanetLab. We demonstrate that EGOIST outperforms existing heuristic overlays on a variety of performance metrics, including delay, available bandwidth, and node utilization, while it remains competitive with an optimal but unscalable full-mesh overlay.