Locating nearby copies of replicated Internet servers
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
On the network impact of dynamic server selection
Computer Networks: The International Journal of Computer and Telecommunications Networking
ACM Computing Surveys (CSUR)
IDMaps: a global internet host distance estimation service
IEEE/ACM Transactions on Networking (TON)
On the constancy of internet path properties
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Finding nearest neighbors in growth-restricted metrics
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
King: estimating latency between arbitrary internet end hosts
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Efficient topology-aware overlay network
ACM SIGCOMM Computer Communication Review
Server Selection Using Dynamic Path Characterization in Wide-Area Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Index-driven similarity search in metric spaces (Survey Article)
ACM Transactions on Database Systems (TODS)
PIC: Practical Internet Coordinates for Distance Estimation
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
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
Estimating network proximity and latency
ACM SIGCOMM Computer Communication Review
Drafting behind Akamai (travelocity-based detouring)
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Peer-to-Peer resource discovery in Grids: Models and systems
Future Generation Computer Systems
OASIS: anycast for any service
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
ACM Transactions on Computer Systems (TOCS)
Towards fast decentralized construction of locality-aware overlay networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Towards network triangle inequality violation aware distributed systems
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
iPlane: an information plane for distributed services
OSDI '06 Proceedings of the 7th symposium on Operating systems design and implementation
Gossiping in distributed systems
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Relative Network Positioning via CDN Redirections
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
On the difficulty of finding the nearest peer in p2p systems
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
Proceedings of the 6th International Conference on Advances in Mobile Computing and Multimedia
On the treeness of internet latency and bandwidth
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
iPlane Nano: path prediction for peer-to-peer applications
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Triangle inequality variations in the internet
Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference
Moving beyond end-to-end path information to optimize CDN performance
Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference
P2P/Grid-based overlay architecture to support VoIP services in large-scale IP networks
Future Generation Computer Systems
eSciGrid: A P2P-based e-science Grid for scalable and efficient data sharing
Future Generation Computer Systems
Pitfalls for testbed evaluations of internet systems
ACM SIGCOMM Computer Communication Review
Ensuring the performance and scalability of peer-to-peer distributed virtual environments
Future Generation Computer Systems
Measurement-based analysis, modeling, and synthesis of the internet delay space
IEEE/ACM Transactions on Networking (TON)
Communications of the ACM
INFOCOM'10 Proceedings of the 29th conference on Information communications
Perspectives on grid computing
Future Generation Computer Systems
DONAR: decentralized server selection for cloud services
Proceedings of the ACM SIGCOMM 2010 conference
A measurement study of the origins of end-to-end delay variations
PAM'10 Proceedings of the 11th international conference on Passive and active measurement
Hybrid Computing-Where HPC meets grid and Cloud Computing
Future Generation Computer Systems
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
Hi-index | 0.00 |
Locating servers that have shortest interactive delay towards an Internet host provides an important service for large-scale latency sensitive networked applications, such as VoIP, online network games, or interactive network services on the cloud. Existing algorithms assume that the delay space is a metric space, which implies that the delay between two nodes is symmetric and the triangle inequality holds. In practice, the delay space is not metric, which lowers the accuracy of metric-based algorithms. We develop a new scheme whose theoretical foundation is based on the inframetric model, which has weaker assumptions than the metric model. We prove that the location requests can be completed efficiently if the delay space exhibits modest inframetric dimensions, which we can confirm empirically. Finally, we propose HybridNN (Hybrid Nearest Service Node Location) that finds the closest service node accurately thanks to the inframetric model and scalably by combining delay predictions with direct probes to a pruned set of neighbors. Simulation results show that HybridNN locates in nearly all cases the true nearest service nodes. Experiments on PlanetLab show that with modest query overhead and maintenance traffic HybridNN can provide accurate nearest service nodes that are close to optimal.