End-to-end routing behavior in the Internet
IEEE/ACM Transactions on Networking (TON)
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
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)
King: estimating latency between arbitrary internet end hosts
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Some findings on the network performance of broadband hosts
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
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
Lessons from resource allocators for large-scale multiuser testbeds
ACM SIGOPS Operating Systems Review
ClosestNode.com: an open access, scalable, shared geocast service for distributed systems
ACM SIGOPS Operating Systems Review
A structural approach to latency prediction
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
Fast nonnegative matrix factorization and its application for protein fold recognition
EURASIP Journal on Applied Signal Processing
Towards network triangle inequality violation aware distributed systems
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Online Discussion Participation Prediction Using Non-negative Matrix Factorization
WI-IATW '07 Proceedings of the 2007 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Workshops
CHESS: An application-aware space for enhanced scalable services in overlay networks
Computer Communications
USING AUTONOMOUS SYSTEM TOPOLOGICAL INFORMATION IN A WEB SERVER PERFORMANCE PREDICTION
Cybernetics and Systems
Distributed algorithms for stable and secure network coordinates
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
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
Spatio-temporal compressive sensing and internet traffic matrices
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
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
Weighted Nonnegative Matrix Co-Tri-Factorization for Collaborative Prediction
ACML '09 Proceedings of the 1st Asian Conference on Machine Learning: Advances in Machine Learning
Application performance metrics for evaluating delay estimation schemes
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
Indexing Network Structure with Shortest-Path Trees
ACM Transactions on Knowledge Discovery from Data (TKDD)
Managing data transfers in computer clusters with orchestra
Proceedings of the ACM SIGCOMM 2011 conference
A careful assessment of recommendation algorithms related to dimension reduction techniques
Knowledge-Based Systems
Clustered embedding of massive social networks
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Application dependency discovery using matrix factorization
Proceedings of the 2012 IEEE 20th International Workshop on Quality of Service
Spatio-temporal compressive sensing and internet traffic matrices
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
In this paper, we propose a model for representing and predicting distances in large-scale networks by matrix factorization. The model is useful for network distance sensitive applications, such as content distribution networks, topology-aware overlays, and server selections. Our approach overcomes several limitations of previous coordinates-based mechanisms, which cannot model sub-optimal routing or asymmetric routing policies. We describe two algorithms --- singular value decomposition (SVD) and nonnegative matrix factorization (NMF)---for representing a matrix of network distances as the product of two smaller matrices. With such a representation, we build a scalable system--- Internet Distance Estimation Service (IDES)---that predicts large numbers of network distances from limited numbers of measurements. Extensive simulations on real-world data sets show that IDES leads to more accurate, efficient and robust predictions of latencies in large-scale networks than previous approaches.