{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:28:07Z","timestamp":1772119687198,"version":"3.50.1"},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key R&D Program of China","award":["2018YFB0204300"],"award-info":[{"award-number":["2018YFB0204300"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61602500"],"award-info":[{"award-number":["61602500"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61402509"],"award-info":[{"award-number":["61402509"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","award":["TEC2017-90034-C2-1-R"],"award-info":[{"award-number":["TEC2017-90034-C2-1-R"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1109\/tnet.2019.2923815","type":"journal-article","created":{"date-parts":[[2019,7,15]],"date-time":"2019-07-15T23:45:26Z","timestamp":1563234326000},"page":"1598-1611","source":"Crossref","is-referenced-by-count":6,"title":["A Skewness-Aware Matrix Factorization Approach for Mesh-Structured Cloud Services"],"prefix":"10.1109","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7564-5239","authenticated-orcid":false,"given":"Yongquan","family":"Fu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9743-2034","authenticated-orcid":false,"given":"Dongsheng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7837-0886","authenticated-orcid":false,"given":"Pere","family":"Barlet-Ros","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chun","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhen","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7479-0189","authenticated-orcid":false,"given":"Siqi","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huayou","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.2307\/2685263"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102441"},{"key":"ref33","first-page":"367","article-title":"iPlane: An information plane for distributed services","author":"madhyastha","year":"2006","journal-title":"Proc USENIX OSDI"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218395"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2228881"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2898663"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.1993.342465"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2742647.2742670"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019258"},{"key":"ref34","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":"ref28","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s10107-019-01374-3","article-title":"First-order methods almost always avoid strict saddle points","volume":"176","author":"lee","year":"2017","journal-title":"Math Program"},{"key":"ref27","first-page":"4520","article-title":"Provable efficient online matrix completion via non-convex stochastic gradient descent","author":"jin","year":"2016","journal-title":"Proc NIPS"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.99"},{"key":"ref2","year":"2016","journal-title":"NTP"},{"key":"ref1","year":"2016","journal-title":"The Linux PTP Project"},{"key":"ref20","first-page":"2973","article-title":"Matrix completion has no spurious local minimum","author":"ge","year":"2016","journal-title":"Proc NIPS"},{"key":"ref22","author":"golub","year":"1996","journal-title":"Matrix Computations"},{"key":"ref21","first-page":"3656","article-title":"On the optimization landscape of tensor decompositions","author":"ge","year":"2017","journal-title":"Proc NIPS"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787496"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934907"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1126\/science.1127647","article-title":"Reducing the dimensionality of data with neural networks","volume":"313","author":"hinton","year":"2006","journal-title":"Science"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-15509-8_27"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/3289604"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2835403"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8057117"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2612695"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2017.2700796"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592600"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2015.2440242"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143876"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/40.748796"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.277"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2715331"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS.2009.19"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2012.11.001"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2012.12.002"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2581592"},{"key":"ref18","first-page":"797","article-title":"Escaping from saddle points—Online stochastic gradient for tensor decomposition","author":"ge","year":"2015","journal-title":"Proc COLT"},{"key":"ref19","first-page":"1233","article-title":"No spurious local minima in nonconvex low rank problems: A unified geometric analysis","author":"ge","year":"2017","journal-title":"Proc ICML"},{"key":"ref4","year":"2018","journal-title":"Istio Service Mesh"},{"key":"ref3","year":"2018","journal-title":"Conduit Service Mesh"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1508865.1508905"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2184319.2184343"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015471"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2639108.2639129"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2005.845141"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623494268443"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2819504"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/IWQoS.2015.7404720"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218633"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2797094"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2598574"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159962"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-008-5073-7"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/130934271"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/8804282\/08763920.pdf?arnumber=8763920","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:14:52Z","timestamp":1657746892000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8763920\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":57,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2019.2923815","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8]]}}}