Reference : Network Distance Prediction Based on Decentralized Matrix Factorization
Scientific congresses and symposiums : Paper published in a journal
Engineering, computing & technology : Computer science
http://hdl.handle.net/2268/36473
Network Distance Prediction Based on Decentralized Matrix Factorization
English
Liao, Yongjun [Université de Liège - ULg > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Réseaux informatiques >]
Geurts, Pierre [Université de Liège - ULg > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Systèmes et modélisation >]
Leduc, Guy mailto [Université de Liège - ULg > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Réseaux informatiques >]
11-May-2010
Lecture Notes in Computer Science
Springer
6091
15-26
Yes
No
International
0302-9743
1611-3349
Berlin
Germany
IFIP Networking 2010
11-13 May 2010
Chennai
India
[en] Network coordinate system ; matrix factorization
[en] 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 thatDMF achieves
competitive accuracy with the double advantage of having no landmarks
and of being able to represent distance asymmetries and TIVs.
EU, and Belgian State Science Policy Office
FP7 ECODE, NoE PASCAL2, IAP DYSCO
Researchers
http://hdl.handle.net/2268/36473
10.1007/978-3-642-12963-6_2
Best paper award
FP7 ; 223936 - ECODE - Experimental COgnitive Distributed Engine

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
YL-networking2010.pdfAuthor postprint1.71 MBView/Open

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.