{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T14:42:47Z","timestamp":1774968167871,"version":"3.50.1"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2013,10,1]],"date-time":"2013-10-01T00:00:00Z","timestamp":1380585600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1109\/tnet.2012.2228881","type":"journal-article","created":{"date-parts":[[2012,12,13]],"date-time":"2012-12-13T19:06:29Z","timestamp":1355425589000},"page":"1511-1524","source":"Crossref","is-referenced-by-count":76,"title":["DMFSGD: A Decentralized Matrix Factorization Algorithm for Network Distance Prediction"],"prefix":"10.1109","volume":"21","author":[{"given":"Yongjun","family":"Liao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Geurts","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy","family":"Leduc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","author":"borg","year":"2005","journal-title":"Modern Multidimensional Scaling Theory and Applications"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/637201.637203"},{"key":"ref33","first-page":"623","article-title":"Scalable collaborative filtering approaches for large recommender systems","volume":"10","author":"tak\ufffdcs","year":"2009","journal-title":"J Mach Learning Res"},{"key":"ref32","first-page":"556","article-title":"Algorithms for non-negative matrix factorization","author":"lee","year":"2001","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref31","author":"golub","year":"1996","journal-title":"Matrix Computations"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080103"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2007.19.10.2756"},{"key":"ref36","first-page":"592","article-title":"Robust <formula formulatype=\"inline\"><tex Notation=\"TeX\">$L{\\_}1$<\/tex><\/formula> norm factorization in the presence of outliers and missing data by alternative convex programming","volume":"2","author":"ke","year":"2005","journal-title":"Proc Comput Vision Pattern Recogn"},{"key":"ref35","first-page":"19","article-title":"Some thoughts about the design of loss functions","volume":"5","author":"hennig","year":"2007","journal-title":"REVSTAT?Statist J"},{"key":"ref34","author":"bertsekas","year":"1999","journal-title":"Nonlinear Programming"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2010.032810.00007"},{"key":"ref40","year":"2012","journal-title":"?MATLAB mdscale ?"},{"key":"ref11","first-page":"22","article-title":"Network coordinates in the wild","author":"ledlie","year":"2007","journal-title":"Proc USENIX\/ACM Symp Netw Syst Design Implement"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1007\/978-3-540-31966-5_19","article-title":"Internet routing policies and round-trip times","author":"zheng","year":"2005","journal-title":"Proc Passive Active Meas"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1140103.1140296"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298331"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/978-3-540-24668-8_8","article-title":"The interdomain connectivity of PlanetLab nodes","author":"banerjee","year":"2004","journal-title":"Proc Passive Active Meas"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1330107.1330122"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205567"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79232-1_19"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019369"},{"key":"ref27","year":"0","journal-title":"?Vuze bittorrent ?"},{"key":"ref3","author":"dabek","year":"2005","journal-title":"A distributed hash table"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019258"},{"key":"ref29","first-page":"904","article-title":"On routing asymmetry in the Internet","volume":"2","author":"he","year":"2005","journal-title":"Proc IEEE Globecom"},{"key":"ref5","first-page":"10","article-title":"OASIS: Anycast for any service","author":"freedman","year":"2006","journal-title":"Proc USENIX\/ACM Symp Netw Syst Design Implement"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"2273","DOI":"10.1109\/JSAC.2006.884026","article-title":"IDES: An Internet distance estimation service for large networks","volume":"24","author":"mao","year":"2006","journal-title":"IEEE J Sel Areas Commun"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015471"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/964723.383072"},{"key":"ref9","first-page":"15","article-title":"Network distance prediction based on decentralized matrix factorization","author":"liao","year":"2010","journal-title":"Proc IFIP Netw Conf"},{"key":"ref1","author":"crovella","year":"2006","journal-title":"Internet Measurement Infrastructure Traffic and Applications"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/948205.948223"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1030194.1015475"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.884025"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/2079296.2079310"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.118"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/1452520.1452537"},{"key":"ref23","first-page":"720","article-title":"Weighted low-rank approximations","author":"nati","year":"2003","journal-title":"Proc Int Conf Mach Learning"},{"key":"ref26","author":"bottou","year":"1998","journal-title":"Online Learning and Neural Networks"},{"key":"ref25","first-page":"329","article-title":"Large-scale convex minimization with a low-rank constraint","author":"shalev-shwartz","year":"2011","journal-title":"Proc Int Conf Mach Learning"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/90\/6631543\/06381499.pdf?arnumber=6381499","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:51:36Z","timestamp":1638219096000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6381499\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":42,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2012.2228881","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10]]}}}