Measuring ISP topologies with rocketfuel
IEEE/ACM Transactions on Networking (TON)
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Meridian: a lightweight network location service without virtual coordinates
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
DIMES: let the internet measure itself
ACM SIGCOMM Computer Communication Review
ASAP: an AS-Aware Peer-Relay Protocol for High Quality VoIP
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Building an AS-topology model that captures route diversity
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
A structural approach to latency prediction
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
iPlane: an information plane for distributed services
OSDI '06 Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7
iPlane Nano: path prediction for peer-to-peer applications
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Matchmaking for online games and other latency-sensitive P2P systems
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Network coordinates in the wild
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Has internet delay gotten better or worse?
Proceedings of the 5th International Conference on Future Internet Technologies
A structural approach for PoP geo-location
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Many measurement systems have been proposed in recent years to shed light on the internal performance of the Internet. Their common goal is to allow distributed applications to improve end-user experience. A common hurdle they face is the need to deploy yet another measurement infrastructure. In this work, we demonstrate that without any new measurement infrastructure or active probing we obtain composite performance estimates from AS-by-AS segments and the estimates are as good as (or even better than) those from existing estimation methodologies that use on-demand, customized active probing. The main contribution of this paper is an estimation algorithm that breaks down measurement data into segments, identifies relevant segments efficiently, and, by carefully stitching segments together, produces delay and path estimates between any two end points. Fittingly, we call our algorithm path stitching. Our results show remarkably good accuracy: error in delay is below 20 ms in 80% of end-to-end paths.