The end-to-end effects of Internet path selection
Proceedings of the 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)
King: estimating latency between arbitrary internet end hosts
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
On selfish routing in internet-like environments
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Tussle in cyberspace: defining tomorrow's internet
IEEE/ACM Transactions on Networking (TON)
Meridian: a lightweight network location service without virtual coordinates
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
On suitability of Euclidean embedding of internet hosts
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Source selectable path diversity via routing deflections
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
AS relationships: inference and validation
ACM SIGCOMM Computer Communication Review
On the accuracy of embeddings for internet coordinate systems
IMC '05 Proceedings of the 5th 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
Towards network triangle inequality violation aware distributed systems
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Donnybrook: enabling large-scale, high-speed, peer-to-peer games
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Symbiotic relationships in internet routing overlays
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Internet routing policies and round-trip-times
PAM'05 Proceedings of the 6th international conference on Passive and Active Network Measurement
Characteristics of Internet Latency and Their Impact on Distance Prediction Accuracy
CNSR '09 Proceedings of the 2009 Seventh Annual Communication Networks and Services Research Conference
Improving online gaming quality using detour paths
Proceedings of the international conference on Multimedia
Dynamic landmark triangles: A simple and efficient mechanism for inter-host latency estimation
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the feasibility of bandwidth detouring
PAM'11 Proceedings of the 12th international conference on Passive and active measurement
The impact of triangular inequality violations on medoid-based clustering
ISMIS'11 Proceedings of the 19th international conference on Foundations of intelligent systems
Fair and Efficient Dead Reckoning-Based Update Dissemination for Distributed Virtual Environments
PADS '12 Proceedings of the 2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation
Optimizing client assignment for enhancing interactivity in distributed interactive applications
IEEE/ACM Transactions on Networking (TON)
Multimedia Tools and Applications
Lcast: Software-defined inter-domain multicast
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Triangle inequality violations (TIVs) are the effect of packets between two nodes being routed on the longer direct path between them when a shorter detour path through an intermediary is available. TIVs are a natural, widespread and persistent consequence of Internet routing policies. By exposing opportunities to improve the delay between two nodes, TIVs can help myriad applications that seek to minimize end-to-end latency. However, sending traffic along the detour paths revealed by TIVs may influence Internet routing negatively. In this paper we study the interaction between triangle inequality violations and policy routing in the Internet. We use measured and predicted AS paths between Internet nodes to show that 25% of the detour paths exposed by TIVs are in fact available to BGP but are simply deemed "less efficient". We also compare the AS paths of detours and direct paths and find that detours use AS edges that are rarely followed by default Internet paths, while avoiding others that BGP seems to prefer. Our study is important both for understanding the various interactions that occur at the routing layer as well as their effects on applications that seek to use TIVs to minimize latency.