Matrix computations (3rd ed.)
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
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
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
Towards network triangle inequality violation aware distributed systems
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Phoenix: Towards an Accurate, Practical and Decentralized Network Coordinate System
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Internet routing policies and round-trip-times
PAM'05 Proceedings of the 6th international conference on Passive and Active Network Measurement
A Survey on Network Coordinates Systems, Design, and Security
IEEE Communications Surveys & Tutorials
IDES: An Internet Distance Estimation Service for Large Networks
IEEE Journal on Selected Areas in Communications
Using the last-mile model as a distributed scheme for available bandwidth prediction
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
Decentralized prediction of end-to-end network performance classes
Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies
NCShield: securing decentralized, matrix factorization-based network coordinate systems
Proceedings of the 2012 IEEE 20th International Workshop on Quality of Service
Towards a robust framework of network coordinate systems
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part I
Network latency prediction using high accuracy prediction tree
Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication
Future Generation Computer Systems
DMFSGD: a decentralized matrix factorization algorithm for network distance prediction
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
Network Coordinate Systems (NCS) are promising techniques to predict unknown network distances from a limited number of measurements. Most NCS algorithms are based on metric space embedding and suffer from the inability to represent distance asymmetries and Triangle Inequality Violations (TIVs). To overcome these drawbacks, we formulate the problem of network distance prediction as guessing the missing elements of a distance matrix and solve it by matrix factorization. A distinct feature of our approach, called Decentralized Matrix Factorization (DMF), is that it is fully decentralized. The factorization of the incomplete distance matrix is collaboratively and iteratively done at all nodes with each node retrieving only a small number of distance measurements. There are no special nodes such as landmarks nor a central node where the distance measurements are collected and stored. We compare DMF with two popular NCS algorithms: Vivaldi and IDES. The former is based on metric space embedding, while the latter is also based on matrix factorization but uses landmarks. Experimental results show that DMF achieves competitive accuracy with the double advantage of having no landmarks and of being able to represent distance asymmetries and TIVs.