Numerical recipes in C: the art of scientific computing
Numerical recipes in C: the art of scientific computing
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
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
Journal of Global Optimization
King: estimating latency between arbitrary internet end hosts
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Properties of Embedding Methods for Similarity Searching in Metric Spaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
Constructing internet coordinate system based on delay measurement
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Constructing internet coordinate system based on delay measurement
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Experience with an evolving overlay network testbed
ACM SIGCOMM Computer Communication Review
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Modeling distances in large-scale networks by matrix factorization
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
An empirical evaluation of internet latency expansion
ACM SIGCOMM Computer Communication Review
Constructing internet coordinate system based on delay measurement
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
Scalable routing overlay networks
ACM SIGOPS Operating Systems Review
ClosestNode.com: an open access, scalable, shared geocast service for distributed systems
ACM SIGOPS Operating Systems Review
Estimating network proximity and latency
ACM SIGCOMM Computer Communication Review
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
Using structure indices for efficient approximation of network properties
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Measurement based analysis, modeling, and synthesis of the internet delay space
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Constraint-based geolocation of internet hosts
IEEE/ACM Transactions on Networking (TON)
A network positioning system for the internet
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
On the accuracy of embeddings for internet coordinate systems
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Reconstructing approximate tree metrics
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
Learning network structure from passive measurements
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
On the accuracy of decentralized virtual coordinate systems in adversarial networks
Proceedings of the 14th ACM conference on Computer and communications security
CHESS: An application-aware space for enhanced scalable services in overlay networks
Computer Communications
Practical large-scale latency estimation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hyperspaces for object clustering and approximate matching in peer-to-peer overlays
HOTOS'07 Proceedings of the 11th USENIX workshop on Hot topics in operating systems
Hyperbolic embedding of internet graph for distance estimation and overlay construction
IEEE/ACM Transactions on Networking (TON)
PeerCast: Churn-resilient end system multicast on heterogeneous overlay networks
Journal of Network and Computer Applications
Network discovery from passive measurements
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Distributed algorithms for stable and secure network coordinates
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
On the internet delay space dimensionality
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
Disseminating streaming data in a dynamic environment: an adaptive and cost-based approach
The VLDB Journal — The International Journal on Very Large Data Bases
Distributed localization for anisotropic sensor networks
ACM Transactions on Sensor Networks (TOSN)
MEDYM: match-early with dynamic multicast for content-based publish-subscribe networks
Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware
P2P Networking and Applications
P2P Networking and Applications
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
Where Is My Peer? Evaluation of the Vivaldi Network Coordinate System in Azureus
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Phoenix: Towards an Accurate, Practical and Decentralized Network Coordinate System
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
SDEC: A P2P Semantic Distance Embedding Based on Virtual Coordinate System
UIC '09 Proceedings of the 6th International Conference on Ubiquitous Intelligence and Computing
Matchmaking for online games and other latency-sensitive P2P systems
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Scalable proximity estimation and link prediction in online social networks
Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference
Fast shortest path distance estimation in large networks
Proceedings of the 18th ACM conference on Information and knowledge management
Estimation of network distances using off-line measurements
Computer Communications
MULTI+: A robust and topology-aware peer-to-peer multicast service
Computer Communications
DCS: A Distributed Coordinate System for Network Positioning
DS-RT '09 Proceedings of the 2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications
Practical connectivity-based routing in wireless sensor networks using dimension reduction
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Pitfalls for testbed evaluations of internet systems
ACM SIGCOMM Computer Communication Review
Fundamental effects of clustering on the Euclidean embedding of internet hosts
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
HNDP: a novel network distance prediction mechanism
NPC'07 Proceedings of the 2007 IFIP international conference on Network and parallel computing
A cluster based approach for network distance embedding
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
Exploiting network distance based Euclidean coordinates for the one hop relay selection
APNOMS'09 Proceedings of the 12th Asia-Pacific network operations and management conference on Management enabling the future internet for changing business and new computing services
On suitability of Euclidean embedding for host-based network coordinate systems
IEEE/ACM Transactions on Networking (TON)
Measurement-based analysis, modeling, and synthesis of the internet delay space
IEEE/ACM Transactions on Networking (TON)
INFOCOM'10 Proceedings of the 29th conference on Information communications
Orion: shortest path estimation for large social graphs
WOSN'10 Proceedings of the 3rd conference on Online social networks
Robust Decentralized Virtual Coordinate Systems in Adversarial Environments
ACM Transactions on Information and System Security (TISSEC)
Study and performance of localization methods in IP based networks: Vivaldi algorithm
Journal of Network and Computer Applications
A virtual and distributed control layer with proximity awareness for group conferencing in P2PSIP
Principles, Systems and Applications of IP Telecommunications
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
Indexing Network Structure with Shortest-Path Trees
ACM Transactions on Knowledge Discovery from Data (TKDD)
GRAP: Grey risk assessment based on projection in ad hoc networks
Journal of Parallel and Distributed Computing
UDP NAT and firewall puncturing in the wild
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part II
Decentralized prediction of end-to-end network performance classes
Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies
Network measurement based modeling and optimization for IP geolocation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Application-Level versus network-level proximity
AINTEC'05 Proceedings of the First Asian Internet Engineering conference on Technologies for Advanced Heterogeneous Networks
An efficient overlay link performance monitoring technique
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Locality prediction for oblivious clients
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Internet routing policies and round-trip-times
PAM'05 Proceedings of the 6th international conference on Passive and Active Network Measurement
Leopard: a locality aware peer-to-peer system with no hot spot
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
MEDYM: match-early with dynamic multicast for content-based publish-subscribe networks
Middleware'05 Proceedings of the ACM/IFIP/USENIX 6th international conference on Middleware
Securing application-level topology estimation networks: facing the frog-boiling attack
RAID'11 Proceedings of the 14th international conference on Recent Advances in Intrusion Detection
Partitioned multi-indexing: bringing order to social search
Proceedings of the 21st international conference on World Wide Web
Active clustering of biological sequences
The Journal of Machine Learning Research
Shortest-path queries for complex networks: exploiting low tree-width outside the core
Proceedings of the 15th International Conference on Extending Database Technology
Fast exact shortest-path distance queries on large networks by pruned landmark labeling
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Proceedings of the 23rd international conference on World wide web
DMFSGD: a decentralized matrix factorization algorithm for network distance prediction
IEEE/ACM Transactions on Networking (TON)
On the Accuracy of Packet Delay Estimation in Distributed Service Networks
Journal of Network and Systems Management
| Hi-index | 0.00 |
Internet coordinate schemes have been proposed as a method for estimating minimum round trip time between hosts without direct measurement. In such a scheme, each host is assigned a set of coordinates, and Euclidean distance is used to form the desired estimate. Two key questions are: How accurate are coordinate schemes across the Internet as a whole? And: are coordinate assignment schemes fast enough, and scalable enough, for large scale use? In this paper we make contributions toward answering both those questions. Whereas the coordinate assignment problem has in the past been approached by nonlinear optimization, we develop a faster method based on dimensionality reduction of the Lipschitz embedding. We show that this method is reasonably accurate, even when applied to measurements spanning the Internet, and that it naturally leads to a scalable measurement strategy based on the notion of virtual landmarks.