Estimating network proximity and latency
ACM SIGCOMM Computer Communication Review
Towards network triangle inequality violation aware distributed systems
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Compositional gossip: a conceptual architecture for designing gossip-based applications
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Distributed algorithms for stable and secure network coordinates
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
TR-clustering: Alleviating the impact of false clustering on P2P overlay networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
P2P Networking and Applications
P2P Networking and Applications
Distributed content delivery using load-aware network coordinates
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Rappel: Exploiting interest and network locality to improve fairness in publish-subscribe systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed overlay anycast tables using space filling curves
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Proxima: towards lightweight and flexible anycast service
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Rigel: A Scalable and Lightweight Replica Selection Service for Replicated Distributed File System
CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
Don't love thy nearest neighbor
IPTPS'10 Proceedings of the 9th international conference on Peer-to-peer systems
Study and performance of localization methods in IP based networks: Vivaldi algorithm
Journal of Network and Computer Applications
Taming the triangle inequality violations with network coordinate system on real internet
Proceedings of the Re-Architecting the Internet Workshop
Network coordinates in the wild
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Dynamic landmark triangles: A simple and efficient mechanism for inter-host latency estimation
Computer Networks: The International Journal of Computer and Telecommunications Networking
The Frog-Boiling Attack: Limitations of Secure Network Coordinate Systems
ACM Transactions on Information and System Security (TISSEC)
REED: Optimizing first person shooter game server discovery using network coordinates
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
NCShield: securing decentralized, matrix factorization-based network coordinate systems
Proceedings of the 2012 IEEE 20th International Workshop on Quality of Service
KoNKS: konsensus-style network koordinate system
Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security
Incorporating change detection in network coordinate systems for large data transfers
Proceedings of the 17th Panhellenic Conference on Informatics
| Hi-index | 0.00 |
Network coordinates provide a scalable way to estimate latencies among large numbers of hosts. While there are several algorithms for producing coordinates, none account for the fact that nodes observe a stream of distinct observations that may vary by as much as three orders-ofmagnitude. With such variable data, coordinate systems are prone to high error and instability in live deployments. In addition, dynamics such as triangle violations can lead to coordinate oscillations, producing further instability and making it difficult for applications to know when their coordinates have truly changed. Because simulation results demonstrate that network coordinates are capable of providing low cost and sufficiently accurate answers to common queries, it is vital that we develop the ability to obtain similar results in practice. We propose two filters which combined to improve network coordinate accuracy by 54% and coordinate stability by 96% when run on a real, largescale network.