{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,24]],"date-time":"2024-06-24T23:12:33Z","timestamp":1719270753258},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T00:00:00Z","timestamp":1496275200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Commun. Inf. Netw."],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s41650-017-0027-5","type":"journal-article","created":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T09:10:36Z","timestamp":1498122636000},"page":"126-135","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Scheduling algorithms for time-constrained big-file transfers in the Internet of Vehicles"],"prefix":"10.23919","volume":"2","author":[{"given":"Chuan","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuanguo","family":"Bi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zeshen","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinfa","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","published-online":{"date-parts":[[2017,6,22]]},"reference":[{"issue":"12","key":"27_CR1","doi-asserted-by":"crossref","first-page":"3613","DOI":"10.1109\/TITS.2016.2584079","volume":"17","author":"Y. G. Bi","year":"2016","unstructured":"Y. G. Bi, H. B. Zhou, W. C. Xu, et al. An efficient PMIPv6-based Handoff Scheme for urban vehicular networks [J]. IEEE transactions on intelligent transportation systems, 2016, 17(12): 3613\u20133628.","journal-title":"IEEE transactions on intelligent transportation systems"},{"issue":"2","key":"27_CR2","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/s11036-012-0350-x","volume":"18","author":"Y. G. Bi","year":"2013","unstructured":"Y. G. Bi, L. X. Cai, X. S. Shen, et al. Medium access control for QoS provisioning in vehicle-to-infrastructure communication networks [J]. Mobile networks and applications, 2013, 18(2): 174\u2013185.","journal-title":"Mobile networks and applications"},{"issue":"4","key":"27_CR3","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1145\/2740070.2626336","volume":"44","author":"S. Kandula","year":"2015","unstructured":"S. Kandula, I. Menache, R. Schwartz, et al. Calendaring for wide area networks [J]. ACM SIGCOMM computer communication review, 2015, 44(4): 515\u2013526.","journal-title":"ACM SIGCOMM computer communication review"},{"issue":"3","key":"27_CR4","first-page":"415","volume":"77","author":"H. Zhang","year":"2016","unstructured":"H. Zhang, K. Chen, W. Bai, et al. Guaranteeing deadlines for inter-data center transfers [J]. IEEE\/ACM transactions on networking, 2016, 77(3): 415\u2013512.","journal-title":"IEEE\/ACM transactions on networking"},{"issue":"11","key":"27_CR5","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/MCOM.2005.1541694","volume":"43","author":"N. S. V. Rao","year":"2005","unstructured":"N. S. V. Rao, W. R. Wing, S. M. Carter, et al. Ultrascience net: network testbed for large-scale science applications [J]. IEEE communications magazine, 2005, 43(11): 12\u201317.","journal-title":"IEEE communications magazine"},{"key":"27_CR6","first-page":"8","volume-title":"Robust routing in wide-area WDM networks","author":"W. F. Liang","year":"2001","unstructured":"W. F. Liang. Robust routing in wide-area WDM networks [C]\/\/IEEE 15th International Proceedings on Parallel and Distributed Processing Symposium, San Francisco, USA, 2001: 8\u201321."},{"key":"27_CR7","first-page":"134","volume-title":"On multipath routing using widest pair of disjoint paths","author":"B. H. Shen","year":"2004","unstructured":"B. H. Shen, B. Hao, A. Sen. On multipath routing using widest pair of disjoint paths [C]\/\/IEEE Workshop on High Performance Switching and Routing, Phoenix, USA, 2004: 134\u2013140."},{"issue":"6","key":"27_CR8","doi-asserted-by":"crossref","first-page":"1227","DOI":"10.1109\/TMM.2007.902852","volume":"9","author":"D. Jurca","year":"2007","unstructured":"D. Jurca, P. Frossard. Media flow rate allocation in multipath networks [J]. IEEE transactions on multimedia, 2007, 9(6): 1227\u20131240.","journal-title":"IEEE transactions on multimedia"},{"issue":"8","key":"27_CR9","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/j.adhoc.2014.02.008","volume":"19","author":"M. Macit","year":"2014","unstructured":"M. Macit, V. C. Gungor, G. Tuna. Comparison of QoS-aware single-path vs. multi-path routing protocols for image transmission in wireless multimedia sensor networks [J]. Ad hoc networks, 2014, 19(8): 132\u2013141.","journal-title":"Ad hoc networks"},{"key":"27_CR10","volume-title":"Flows in Networks [M]","author":"L. R. Ford Jr","year":"2015","unstructured":"Jr L. R. Ford, D. R. Fulkerson. Flows in Networks [M]. Princeton: Princeton university press, 2015."},{"issue":"7","key":"27_CR11","doi-asserted-by":"crossref","first-page":"1952","DOI":"10.1109\/TMM.2014.2342668","volume":"16","author":"C. Y. Chiu","year":"2014","unstructured":"C. Y. Chiu, T. H. Tsai, Y. C. Liou, et al. Near-duplicate subsequence matching between the continuous stream and large video dataset [J]. IEEE transactions on multimedia, 2014, 16(7): 1952\u20131962.","journal-title":"IEEE transactions on multimedia"},{"issue":"7","key":"27_CR12","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1016\/S0140-3664(02)00210-4","volume":"26","author":"G. L. Xue","year":"2003","unstructured":"G. L. Xue. Optimal multichannel data transmission in computer networks [J]. Computer communications, 2003, 26(7): 759\u2013765.","journal-title":"Computer communications"},{"key":"27_CR13","first-page":"539","volume-title":"Maximum multicommodity flows over time without intermediate storage","author":"M. Gro\u00df","year":"2012","unstructured":"M. Gro\u00df, M. Skutella. Maximum multicommodity flows over time without intermediate storage [C]\/\/Springer Berlin Heidelberg European Symposium on Algorithms, Ljubljana, Slovenia, 2012: 539\u2013550."},{"issue":"3","key":"27_CR14","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/j.tcs.2007.02.046","volume":"379","author":"A. Hall","year":"2007","unstructured":"A. Hall, S. Hippler, M. Skutella. Multicommodity flows over time: Efficient algorithms and complexity [J]. Theoretical computer science, 2007, 379(3): 387\u2013404.","journal-title":"Theoretical computer science"},{"issue":"3","key":"27_CR15","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1002\/net.10112","volume":"43","author":"B. Klinz","year":"2004","unstructured":"B. Klinz, G. J. Woeginger. Minimum-cost dynamic flows: the series-parallel case [J]. Networks, 2004, 43(3): 153\u2013162.","journal-title":"Networks"},{"key":"27_CR16","first-page":"68","volume-title":"End-to-end network QoS via scheduling of flexible resource reservation requests","author":"S. Sharma","year":"2011","unstructured":"S. Sharma, D. Katramatos, D. T. Yu. End-to-end network QoS via scheduling of flexible resource reservation requests [C]\/\/ACM International Conference on High Performance Computing, Networking, Storage and Analysis, Seattle, USA, 2011: 68."},{"issue":"10","key":"27_CR17","doi-asserted-by":"crossref","first-page":"1920","DOI":"10.1109\/JSAC.2004.836000","volume":"22","author":"J. C. Chen","year":"2004","unstructured":"J. C. Chen, S. H. G. Chan, V. O. K. Li. Multipath routing for video delivery over bandwidth-limited networks [J]. IEEE journal on selected areas in communications, 2004, 22(10): 1920\u20131932.","journal-title":"IEEE journal on selected areas in communications"},{"issue":"6","key":"27_CR18","doi-asserted-by":"crossref","first-page":"1600","DOI":"10.1137\/S0097539703427215","volume":"36","author":"L. Fleischer","year":"2007","unstructured":"L. Fleischer, M. Skutella. Quickest flows over time [J]. SIAM journal on computing, 2007, 36(6): 1600\u20131630.","journal-title":"SIAM journal on computing"},{"issue":"11","key":"27_CR19","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"J. Y. Yen","year":"1971","unstructured":"J. Y. Yen. Finding the k shortest loopless paths in a network [J]. Management science, 1971, 17(11): 712\u2013716.","journal-title":"Management science"},{"key":"27_CR20","first-page":"1","volume-title":"Reliable adaptive multipath provisioning with bandwidth and differential delay constraints","author":"W. Y. Zhang","year":"2010","unstructured":"W. Y. Zhang, J. Tang, C. G. Wang, et al. Reliable adaptive multipath provisioning with bandwidth and differential delay constraints [C]\/\/IEEE INFOCOM 2010, San Diego, USA, 2010: 1\u20139."},{"key":"27_CR21","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P. Erdds","year":"1959","unstructured":"P. Erdds, A. Rwi. On random graphs I [J]. Publ math Debrecen, 1959, 6: 290\u2013297.","journal-title":"Publ math Debrecen"},{"issue":"2","key":"27_CR22","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1007\/s00453-014-9911-7","volume":"73","author":"Y. Li","year":"2015","unstructured":"Y. Li, D. L. Du, N. H. Xiu, et al. Improved approximation algorithms for the facility location problems with linear\/submodular penalties [J]. Algorithmica, 2015, 73(2): 460\u2013482.","journal-title":"Algorithmica"}],"container-title":["Journal of Communications and Information Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41650-017-0027-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41650-017-0027-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41650-017-0027-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,24]],"date-time":"2024-06-24T22:37:32Z","timestamp":1719268652000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s41650-017-0027-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["27"],"URL":"https:\/\/doi.org\/10.1007\/s41650-017-0027-5","relation":{},"ISSN":["2096-1081","2509-3312"],"issn-type":[{"value":"2096-1081","type":"print"},{"value":"2509-3312","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6]]}}}