End-to-end Internet packet dynamics
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
The end-to-end effects of Internet path selection
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Delayed Internet routing convergence
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
King: estimating latency between arbitrary internet end hosts
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
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
Measurement based analysis, modeling, and synthesis of the internet delay space
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
On the accuracy of embeddings for internet coordinate systems
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Towards network triangle inequality violation aware distributed systems
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Symbiotic relationships in internet routing overlays
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Network coordinates in the wild
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Internet routing policies and round-trip-times
PAM'05 Proceedings of the 6th international conference on Passive and Active Network Measurement
Pitfalls for testbed evaluations of internet systems
ACM SIGCOMM Computer Communication Review
A pattern-based prediction: An empirical approach to predict end-to-end network latency
Journal of Systems and Software
Secure latency estimation with treeple
Proceedings of the 17th ACM conference on Computer and communications security
Taming the triangle inequality violations with network coordinate system on real internet
Proceedings of the Re-Architecting the Internet Workshop
How to tell if your cloud files are vulnerable to drive crashes
Proceedings of the 18th ACM conference on Computer and communications security
NCShield: securing decentralized, matrix factorization-based network coordinate systems
Proceedings of the 2012 IEEE 20th International Workshop on Quality of Service
Modelling the tradeoffs in Overlay-ISP cooperation
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part II
Outsourcing network functionality
Proceedings of the first workshop on Hot topics in software defined networks
Multimedia Tools and Applications
HybridNN: An accurate and scalable network location service based on the inframetric model
Future Generation Computer Systems
Hi-index | 0.00 |
Triangle inequality violations (TIVs) are important for latency sensitive distributed applications. On one hand, they can expose opportunities to improve network routing by finding shorter paths between nodes. On the other hand, TIVs can frustrate network embedding or positioning systems that treat the Internet as a metric space where the triangle inequality holds. Even though triangle inequality violations are both significant and curious, their study has been limited to aggregate data sets that combine measurements taken over long periods of time. The limitations of these data sets open crucial questions in the design of systems that exploit (or avoid) TIVs: are TIVs stable or transient? Or are they illusions caused by aggregating measurements taken at different times? We collect latency matrices at varying sizes and time granularities and study dynamic properties of triangle inequality violations in the Internet. We show that TIVs are not results of measurement error and that their number varies with time. We examine how latency aggregates of data measured over longer periods of time preserve TIVs. Using medians to compute violations eliminates most of the TIVs that appear sporadically during the measurement but it misses many of the ones that are present for more than five hours.