DMFSGD: A decentralized matrix factorization algorithm for network distance prediction

IEEE/ACM Transactions on Networking

Volumn 21, Issue 5, 2013, Pages 1511-1524

  Liao, Yongjun ^a   Du, Wei ^a,b   Geurts, Pierre ^a   Leduc, Guy ^a  

^a UNIVERSITY OF LIÈGE   (Belgium)

^b UNIVERSITY OF INNSBRUCK   (Austria)

Author keywords

Matrix completion; Matrix factorization; Network distance prediction; Stochastic gradient descent

Indexed keywords

EUCLIDEAN EMBEDDING; INTERNET APPLICATION; LOW RANK APPROXIMATIONS; MATRIX COMPLETION; MATRIX FACTORIZATIONS; NETWORK DISTANCE; NON-NEGATIVITY CONSTRAINTS; STOCHASTIC GRADIENT DESCENT;

ALGORITHMS; INTERNET; TIME VARYING NETWORKS;

FORECASTING;

EID: 84887090190     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2012.2228881     Document Type: Article

References (42)

1. M. Crovella and B. Krishnamurthy, Internet Measurement: Infrastructure, Traffic and Applications. New York: Wiley, 2006.
2. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A scalable content-addressable network," in Proc. ACM SIGCOMM, San Diego, CA, Aug. 2001, pp. 161-172. (Pubitemid 32981962)
3. F. Dabek, "A distributed hash table," Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge, MA, Nov. 2005.
4. S. Ratnasamy,M. Handley, R. Karp, and S. Shenker, " Topologicallyaware overlay construction and server selection," in Proc. IEEE INFOCOM, New York, NY, Jun. 2002, pp. 1190-1199.
5. M. J. Freedman, K. Laskhminarayanan, and D. Mazières, "OASIS: Anycast for any service," in Proc. USENIX Symp. Netw. Syst. Design Implement., San Jose, CA, May 2006, pp. 10-23.
6. T. S. E. Ng and H. Zhang, "Predicting Internet network distance with coordinates-based approaches," in Proc. IEEE INFOCOM, NewYork, NY, Jun. 2002, pp. 170-179.
7. F. Dabek, R. Cox, F. Kaashoek, and R. Morris, "Vivaldi: A decentralized network coordinate system," in Proc. ACM SIGCOMM, Portland, OR, Aug. 2004, pp. 15-26. (Pubitemid 40954866)
8. Y. Mao, L. Saul, and J. M. Smith, "IDES: An Internet distance estimation service for large networks," IEEE J. Sel. Areas Commun., vol. 24, no. 12, pp. 2273-2284, Dec. 2006.
9. Y. Liao, P. Geurts, and G. Leduc, "Network distance prediction based on decentralized matrix factorization," in Proc. IFIP Netw. Conf., Chennai, India, May 2010, pp. 15-26.
10. B. Donnet, B. Gueye, and M. A. Kaafar, "A survey on network coordinates systems, design, and security," IEEE Commun. Surveys Tuts., vol. 12, no. 4, pp. 488-503, 4th Quart., 2010.
11. J. Ledlie, P. Gardner, and M. I. Seltzer, "Network coordinates in the wild," in Proc. USENIX Symp. Netw. Syst. Design Implement., Apr. 2007, pp. 22-35.
12. H. Zheng, E. K. Lua, M. Pias, and T. Griffin, "Internet routing policies and round-trip times," in Proc. Passive ActiveMeas., Boston, MA,Apr. 2005, pp. 236-250. (Pubitemid 41252750)
13. S. Lee, Z. Zhang, S. Sahu, and D. Saha, "On suitability of Euclidean embedding of Internet hosts," Perform. Eval. Rev., vol. 34, no. 1, pp. 157-168, 2006. (Pubitemid 44619088)
14. G. Wang, B. Zhang, and T. S. E. Ng, "Towards network triangle inequality violation aware distributed systems," in Proc. ACM/SIGCOMM Internet Meas. Conf., San Diego, CA, Oct. 2007, pp. 175-188.
15. S. Banerjee, T. G. Griffin, and M. Pias, "The interdomain connectivity of PlanetLab nodes," in Proc. Passive Active Meas., Antibes Juan-les- Pins, France, Apr. 2004, pp. 73-82.
16. E. K. Lua, T. Griffin, M. Pias, H. Zheng, and J. Crowcroft, "On the accuracy of embeddings for Internet coordinate systems," in Proc. ACM/ SIGCOMM Internet Meas. Conf., Berkeley, CA, 2005, pp. 1-14.
17. E. J. Candès and B. Recht, "Exact matrix completion via convex optimization," Found. Comput. Math., vol. 9, no. 6, pp. 717-772, 2009.
18. E. J. Candès and Y. Plan, "Matrix completion with noise," Proc. IEEE, vol. 98, no. 6, pp. 925-936, Jun. 2010.
19. R. H. Keshavan, S. Oh, and A. Montanari, "Matrix completion from a few entries," Comput. Res. Repository, 2009, abs/0901.3150.
20. L. Tang and M. Crovella, "Virtual landmarks for the Internet," in Proc. ACM/SIGCOMM Internet Meas. Conf., Miami, FL, Oct. 2003, pp. 143-152. (Pubitemid 40730646)
21. D. B. Chua, E.D.Kolaczyk, and M. Crovella, "Network kriging," IEEE J. Sel. Areas Commun., vol. 24, no. 12, pp. 2263-2272, Dec. 2006. (Pubitemid 44955766)
22. Y. Chen,D. Bindel,H. Song, and R. H.Katz, "An algebraic approach to practical and scalable overlay networkmonitoring," Comput. Commun. Rev., vol. 34, no. 4, pp. 55-66, Aug. 2004. (Pubitemid 40954869)
23. N. S. Nati and T. Jaakkola, "Weighted low-rank approximations," in Proc. Int. Conf.Mach. Learning,Washington, DC, 2003, pp. 720-727.
24. A. M. Buchanan and A. W. Fitzgibbon, "Damped newton algorithms for matrix factorization with missing data," in Proc. Comput. Vision Pattern Recogn., San Diego, CA, 2005, vol. 2, pp. 316-322.
25. S. Shalev-Shwartz, A. Gonen, and O. Shamir, "Large-scale convex minimization with a low-rank constraint," in Proc. Int. Conf. Mach. Learning, Bellevue, WA, 2011, pp. 329-336.
26. L. Bottou, ,D. Saad, Ed., "Online algorithms and stochastic approximations," in Online Learning and Neural Networks. Cambridge, U.K.: Cambridge Univ. Press, 1998.
27. Azureus Software, Inc., Mountain View, CA, "Vuze bittorrent," [Online]. Available: http://www.vuze.com/
28. A. Pathak, H. Pucha, Y. Zhang, Y. C. Hu, and Z. M. Mao, "A measurement study of Internet delay asymmetry," in Proc. Passive Active Meas., Cleveland, OH, Apr. 2008, pp. 182-191. (Pubitemid 351702291)
29. Y. He, M. Faloutsos, S. Krishnamurthy, B. Huffaker, Y. He, M. Faloutsos, S. Krishnamurthy, and B. Huffaker, "On routing asymmetry in the Internet," in Proc. IEEE GLOBECOM, St. Louis, MO, 2005, vol. 2, pp. 904-909. (Pubitemid 46171264)
30. B. Wong, A. Slivkins, and E. Sirer, "Meridian: A lightweight network location service without virtual coordinates," in Proc. ACM SIGCOMM, Philadelphia, PA, Aug. 2005, pp. 85-96. (Pubitemid 46323496)
31. G. H. Golub and C. F. van Loan, Matrix Computations, 3rd ed. Baltimore, MD: Johns Hopkins Univ. Press, 1996.
32. D. D. Lee and H. S. Seung, "Algorithms for non-negativematrix factorization," in Proc. Adv. Neural Inf. Process. Syst., Vancouver, Canada, 2001, pp. 556-562.
33. G. Takács, I. Pilászy, B. Németh, and D. Tikk, "Scalable collaborative filtering approaches for large recommender systems," J. Mach. Learning Res., vol. 10, pp. 623-656, June 2009.
34. D. Bertsekas, Nonlinear Programming. Belmont, MA: Athena Scientific, 1999.
35. C. Hennig and M. Kutlukaya, "Some thoughts about the design of loss functions," REVSTAT-Statist. J., vol. 5, no. 1, pp. 19-39, 2007.
36. Q. Ke and T. Kanade, "Robust norm factorization in the presence of outliers and missing data by alternative convex programming," in Proc. Comput. Vision Pattern Recogn., San Diego, CA, 2005, vol. 2, pp. 592-599.
37. C.-J. Lin, "Projected gradient methods for nonnegative matrix factorization," Neural Comput., vol. 19, no. 10, pp. 2756-2779, Oct. 2007.
38. K. P. Gummadi, S. Saroiu, and S. D. Gribble, "King: Estimating latency between arbitrary Internet end hosts," in Proc. ACM/SIGCOMM Internet Meas. Workshop, Marseille, France, Nov. 2002, pp. 5-18.
39. I. Borg and P. Groenen,ModernMultidimensional Scaling: Theory and Applications. New York: Springer, 2005.
40. MathWorks, Natick, MA, "MATLAB mdscale," 2012 [Online]. Available: http://www.mathworks.com/help/stats/mdscale.html
41. G.Wang and T. S. E. Ng, "Distributed algorithms for stable and secure network coordinates," in Proc. ACM/SIGCOMM Internet Meas. Conf., Vouliagmeni, Greece, Oct. 2008, pp. 131-144.
42. Y. Liao,W. Du, P. Geurts, and G. Leduc, "Decentralized prediction of end-to-end network performance classes," in Proc. CoNEXT, Tokyo, Japan, Dec. 2011, pp. 14:1-14:12.