Research Unit in Networking  

Abstract 
Y. Liao^{2}
, W. Du^{2}, P. Geurts^{1} and G. Leduc^{2}
^{1} Systems and Modelling, EECS department, University of Liège, Belgium (2013) AbstractThe knowledge of endtoend network distances is essential to many Internet applications. As active probing of all pairwise distances is infeasible in largescale networks, a natural idea is to measure a few pairs and to predict the other ones without actually measuring them. This paper formulates the prediction problem as matrix completion where the unknown entries in a pairwise distance matrix constructed from a network are to be predicted. By assuming that the distance matrix has a lowrank characteristics, the problem is solvable by lowrank approximation based on matrix factorization. The new formulation circumvents the wellknown drawbacks of existing approaches based on Euclidean embedding. A new algorithm, socalled Decentralized Matrix Factorization by Stochastic Gradient Descent (DMFSGD), is proposed. By letting network nodes exchange messages with each other, the algorithm is fully decentralized and only requires each node to collect and to process local measurements, with neither explicit matrix constructions nor special nodes such as landmarks and central servers. In addition, we compared comprehensively matrix factorization and Euclidean embedding to demonstrate the suitability of the former on network distance prediction. We further studied the incorporation of a robust loss function and of nonnegativity constraints. Extensive experiments on various publiclyavailable datasets of network delays show not only the scalability and the accuracy of our approach, but also its usability in real Internet applications. 

Editor:  G. Leduc  Webmaster:  C. Soldani  
Still running IPv4 at: 54.81.105.205... 
RUN 
Montefiore 
ULg © 20002015. 