{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T22:52:24Z","timestamp":1740178344026,"version":"3.37.3"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2018,2,1]],"date-time":"2018-02-01T00:00:00Z","timestamp":1517443200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61671142","61373159"],"award-info":[{"award-number":["61671142","61373159"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Emerg. Top. Comput. Intell."],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1109\/tetci.2017.2755692","type":"journal-article","created":{"date-parts":[[2018,1,19]],"date-time":"2018-01-19T19:13:39Z","timestamp":1516389219000},"page":"25-40","source":"Crossref","is-referenced-by-count":10,"title":["Scheduling for Time-Constrained Big-File Transfer Over Multiple Paths in Cloud Computing"],"prefix":"10.1109","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6811-3851","authenticated-orcid":false,"given":"Chuan","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8424-8542","authenticated-orcid":false,"given":"Yuanguo","family":"Bi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6921-7369","authenticated-orcid":false,"given":"Guangjie","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jucheng","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zheng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs I","volume":"6","author":"erd?s","year":"1959","journal-title":"Publicationes Mathematicae (Debrecen)"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47867-1_4"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.02.046"},{"key":"ref32","first-page":"539","article-title":"Maximum multicommodity flows over time without intermediate storage","author":"gro\u00df","year":"2012","journal-title":"European Symposium on Algorithms"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1002\/net.10112"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2534169.2486012"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462042"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.11.712"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703427215"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2063384.2063475"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2534169.2486019"},{"year":"0","key":"ref40","article-title":"PULP."},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s41650-017-0027-5"},{"key":"ref12","first-page":"134","article-title":"On multipath routing using widest pair of disjoint paths","author":"shen","year":"2004","journal-title":"Proc IEEE 2004 Workshop High Perform Switching Routing"},{"journal-title":"Flows in Networks","year":"2015","author":"ford","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2004.836000"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2014.2342668"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2014.02.017"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.pmcj.2013.06.004"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2015.2444845"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2015.2481486"},{"journal-title":"Routing Flow and Capacity Design in Communication and Computer Networks","year":"2004","author":"pi\u00f3ro","key":"ref28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2594235"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230080107"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2740070.2626336"},{"year":"2016","key":"ref6","article-title":"Surfnet."},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848072"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2017.1600658CM"},{"year":"2016","key":"ref8","article-title":"ESnet, OSCARS: On-demand secure circuits and advance reservation system."},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2005.1541694"},{"year":"2016","key":"ref2","article-title":"Facebook."},{"year":"2016","key":"ref9","article-title":"Internet2."},{"year":"2016","key":"ref1","article-title":"Dzero."},{"key":"ref46","first-page":"2","article-title":"Routing and wavelength assignment in all optical networks using differential evolution optimization","volume":"26","author":"lezama","year":"2017","journal-title":"Photon Netw Commun"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.3390\/s16020246"},{"year":"0","key":"ref45","article-title":"GÉANT network."},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/SDN4FNS.2013.6702533"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2016.2645941"},{"key":"ref42","first-page":"1903","article-title":"Qos routing mechanisms and OSPF extensions","author":"orda","year":"2017","journal-title":"Proc 1997 IEEE Global Communications Conf"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2014.02.008"},{"year":"2017","key":"ref41","article-title":"NetworkX."},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2007.902852"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-014-9911-7"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1477942.1477970"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2321159"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(02)00210-4"}],"container-title":["IEEE Transactions on Emerging Topics in Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7433297\/8264905\/08264907.pdf?arnumber=8264907","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T16:37:17Z","timestamp":1693499837000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8264907\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2]]},"references-count":46,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tetci.2017.2755692","relation":{},"ISSN":["2471-285X"],"issn-type":[{"type":"electronic","value":"2471-285X"}],"subject":[],"published":{"date-parts":[[2018,2]]}}}