IDMaps: a global internet host distance estimation service
IEEE/ACM Transactions on Networking (TON)
On the stability of network distance estimation
ACM SIGMETRICS Performance Evaluation Review
King: estimating latency between arbitrary internet end hosts
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
M-coop: A Scalable Infrastructure for Network Measurement
WIAPP '03 Proceedings of the The Third IEEE Workshop on Internet Applications
Peer-to-peer information retrieval using self-organizing semantic overlay networks
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Constructing internet coordinate system based on delay measurement
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Virtual landmarks for the internet
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
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
PCoord: Network Position Estimation Using Peer-to-Peer Measurements
NCA '04 Proceedings of the Network Computing and Applications, Third IEEE International Symposium
Meridian: a lightweight network location service without virtual coordinates
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Stable and Accurate Network Coordinates
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
A network positioning system for the internet
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Internet routing policies and round-trip-times
PAM'05 Proceedings of the 6th international conference on Passive and Active Network Measurement
Computing the unmeasured: an algebraic approach to Internet mapping
IEEE Journal on Selected Areas in Communications
Towards network triangle inequality violation aware distributed systems
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Proceedings of the 17th international conference on World Wide Web
The CHART system: a high-performance, fair transport architecture based on explicit-rate signaling
ACM SIGOPS Operating Systems Review
QoS-guaranteed path selection algorithm for service composition
Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
The partial migration of game state and dynamic server selection to reduce latency
Multimedia Tools and Applications
NCShield: securing decentralized, matrix factorization-based network coordinate systems
Proceedings of the 2012 IEEE 20th International Workshop on Quality of Service
Journal of Computer and System Sciences
A hierarchical overlay with cluster-based reputation tree for dynamic peer-to-peer systems
Journal of Network and Computer Applications
Mobile Peer-to-Peer data dissemination in wireless ad-hoc networks
Information Sciences: an International Journal
Future Generation Computer Systems
HybridNN: An accurate and scalable network location service based on the inframetric model
Future Generation Computer Systems
Latency based group discovery algorithm for network aware cloud scheduling
Future Generation Computer Systems
Server Selection and Topology Control for Multi-Party Video Conferences
Proceedings of Network and Operating System Support on Digital Audio and Video Workshop
On the Accuracy of Packet Delay Estimation in Distributed Service Networks
Journal of Network and Systems Management
| Hi-index | 0.00 |
Network proximity and latency estimation is an important component in discovering and locating services and applications. With the growing number of services and service providers in the large-scale Internet, accurately estimating network proximity/latency with minimal probing overhead becomes essential for scalable deployment. Although there exist a number of network distance estimation schemes, they either rely on extensive infrastructure support, require the IP address of the potential targets, falsely cluster distant nodes, or perform poorly with even few measurement errors. We propose Netvigator, a scalable network proximity and latency estimation tool that uses information obtained from probing a small number of landmark nodes and intermediate routers (termed milestones) that are discovered en route to the landmarks, to identify the closest nodes. With very little additional probing overhead, Netvigator uses distance information to the milestones to accurately locate the closest nodes. We developed a Netvigator prototype and report our performance evaluation on PlanetLab and in the intranet of a large enterprise. Netvigator is a running service on PlanetLab as a part of HP Labs' S3 (Scalable Sensing Service).