Modeling TCP throughput: a simple model and its empirical validation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
On inferring autonomous system relationships in the internet
IEEE/ACM Transactions on Networking (TON)
TCP congestion control with a misbehaving receiver
ACM SIGCOMM Computer Communication Review
King: estimating latency between arbitrary internet end hosts
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
A routing underlay for overlay networks
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
On selfish routing in internet-like environments
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Samsara: honor among thieves in peer-to-peer storage
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
An analysis of internet content delivery systems
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
Scalable routing overlay networks
ACM SIGOPS Operating Systems Review
OverQos: an overlay based architecture for enhancing internet Qos
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Improving the reliability of internet paths with one-hop source routing
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Dandelion: cooperative content distribution with robust incentives
ATC'07 2007 USENIX Annual Technical Conference on Proceedings of the USENIX Annual Technical Conference
Detecting in-flight page changes with web tripwires
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Donnybrook: enabling large-scale, high-speed, peer-to-peer games
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Motivating participation in internet routing overlays
Proceedings of the 3rd international workshop on Economics of networked systems
Do incentives build robustness in bit torrent
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Network coordinates in the wild
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Triangle Inequality and Routing Policy Violations in the Internet
PAM '09 Proceedings of the 10th International Conference on Passive and Active Network Measurement
Triangle inequality variations in the internet
Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference
Scaling all-pairs overlay routing
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
Quilt: a patchwork of multicast regions
Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems
Deconstructing internet paths: an approach for AS-level detour route discovery
IPTPS'09 Proceedings of the 8th international conference on Peer-to-peer systems
Don't love thy nearest neighbor
IPTPS'10 Proceedings of the 9th international conference on Peer-to-peer systems
Improving online gaming quality using detour paths
Proceedings of the international conference on Multimedia
Taming the triangle inequality violations with network coordinate system on real internet
Proceedings of the Re-Architecting the Internet Workshop
Finding routing shortcuts using an internet coordinate system
IWSOS'11 Proceedings of the 5th international conference on Self-organizing systems
On the feasibility of bandwidth detouring
PAM'11 Proceedings of the 12th international conference on Passive and active measurement
The design and implementation of the A3 application-aware anonymity platform
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
We propose to construct routing overlay networks using the following principle: that overlay edges should be based on mutual advantage between pairs of hosts. Upon this principle, we design, implement, and evaluate Peer-Wise, a latency-reducing overlay network. To show the feasibility of PeerWise, we must show first that mutual advantage exists in the Internet: perhaps contrary to expectation, that there are not only "haves" and "have nots" of low-latency connectivity. Second, we must provide a scalable means of finding promising edges and overlay routes; we seek embedding error in network coordinates to expose both shorter-than-default "detour" routes and longer-than-expected default routes. We evaluate the cost of limiting PeerWise to mutually advantageous links, then build the intelligent components that put PeerWise into practice. We design and evaluate "virtual" network coordinates for destinations not participating in the overlay, neighbor selection algorithms to find promising relays, and relay selection algorithms to choose the neighbor to traverse for a good detour. Finally, we show that PeerWise is practical through a wide-area deployment and evaluation.