Abstract
In order to transfer large files and provide high-quality services in the IoV (Internet of Vehicles), intelligent routing and scheduling are indispensable for fast transfers and efficient network utilization, particularly when multi-path routing is allowed in the wired-transfer. Thus, a network administrator must select a set of feasible paths over which the transfer can be conducted. We consider a TBTS (Time-constrained Big-file Transfer Scheduling) problem in this paper. We prove that TBTS problem is NP-hard and that the TBTS problem can be solved by addressing a corresponding maximum ow over time problem with multi-path routing technique. We then propose both a heuristic algorithm (TBTS-H) and an exact algorithm (TBTS-A) to solve the TBTS problem. Although both of the proposed approaches can solve the TBTS problem, the heuristic runs more efficiently by trading accuracy for delay, while the exact algorithm can achieve high accuracy for delay, at the cost of increased running-time. The corresponding simulation results illustrate this trade-off. Additionally, we conduct some comparisons between our proposed approaches and a traditional single-path routing scheme.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
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–3628.
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–185.
S. Kandula, I. Menache, R. Schwartz, et al. Calendaring for wide area networks [J]. ACM SIGCOMM computer communication review, 2015, 44(4): 515–526.
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–512.
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–17.
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–21.
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–140.
D. Jurca, P. Frossard. Media flow rate allocation in multipath networks [J]. IEEE transactions on multimedia, 2007, 9(6): 1227–1240.
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–141.
Jr L. R. Ford, D. R. Fulkerson. Flows in Networks [M]. Princeton: Princeton university press, 2015.
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–1962.
G. L. Xue. Optimal multichannel data transmission in computer networks [J]. Computer communications, 2003, 26(7): 759–765.
M. Groß, M. Skutella. Maximum multicommodity flows over time without intermediate storage [C]//Springer Berlin Heidelberg European Symposium on Algorithms, Ljubljana, Slovenia, 2012: 539–550.
A. Hall, S. Hippler, M. Skutella. Multicommodity flows over time: Efficient algorithms and complexity [J]. Theoretical computer science, 2007, 379(3): 387–404.
B. Klinz, G. J. Woeginger. Minimum-cost dynamic flows: the series-parallel case [J]. Networks, 2004, 43(3): 153–162.
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.
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–1932.
L. Fleischer, M. Skutella. Quickest flows over time [J]. SIAM journal on computing, 2007, 36(6): 1600–1630.
J. Y. Yen. Finding the k shortest loopless paths in a network [J]. Management science, 1971, 17(11): 712–716.
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–9.
P. Erdds, A. Rwi. On random graphs I [J]. Publ math Debrecen, 1959, 6: 290–297.
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–482.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work is supported by the National Natural Science Foundation of China (Nos. 61671142, 61101121, 61373159).
Chuan Lin Ph.D. candidate at the School of Computer Science and Engineering, Northeastern University, Shenyang, China. He received a B.S. degree in computer science and technology from Liaoning University, Shenyang, China in 2011 and an M.S. degree in computer science and technology from Northeastern University, Shenyang, China in 2013. His research interests include network performance analysis, software defined networking, and network modeling.
Yuanguo Bi [corresponding author] associate professor at the School of Computer Science and Engineering, North-eastern University, Shenyang, China. He was a visiting Ph.D. student with the Department of Electrical and Computer Engineering, University of Waterloo, ON, Canada between 2007 and 2009. His current research focuses on medium access control, QoS routing, multihop broadcasting, and transmission control in vehicular networks.
Hai Zhao Professor at the School of Computer Science and Engineering, Northeastern University, Shenyang, China. He received a B.Sc. degree in electrical engineering from the DaLian Maritime University, Dalian, China, in 1982, the M.Sc. and Ph.D. degrees from Northeastern University, Shenyang, China, in 1987 and 1995, respectively, both in computer science. He serves as the director of the Liaoning Provincial Key Laboratory of Embedded Technology. His current research focuses on embedded Internet technology, wireless sensor networks, pervasive computing, operating systems, data and information fusion, computer simulation, and virtual reality. He has led programs such as the National Natural Science Foundation of China, the National High Technology Research and Development Program of China, and the Nation Class Lighted Torch Plan. He has published more than 300 academic papers, four books, and international standards. He has successfully applied for 10 patents and received six awards for science and technology from the Liaoning Province and Ministry of China. He received recognition from the State Council due to his special contributions to the development of education.
Zeshen Wang Master’s degree candidate at the School of Business Administration, Northeastern University, Shenyang, China. She received a B.S. degree from the School of Business Administration, Northeastern University, Shenyang, China in 2015. Her research interests include traffic engineering, network performance analysis, software defined networking and network modeling.
Jinfa Wang Ph.D. candidate at the School of Computer Science and Engineering, Northeastern University, Shenyang, China. He received a B.S. degree in information and electrical engineering from LuDong University, Yantai, China in 2011 and an M.S. degree in information science and engineering from Northeastern University, Shenyang, China in 2014. His research interests are complex networks, Internet measurement, Internet topology analysis, and data science.
Rights and permissions
About this article
Cite this article
Lin, C., Bi, Y., Zhao, H. et al. Scheduling algorithms for time-constrained big-file transfers in the Internet of Vehicles. J. Commun. Inf. Netw. 2, 126–135 (2017). https://doi.org/10.1007/s41650-017-0027-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s41650-017-0027-5