TY - JOUR
T1 - Bandwidth scheduling for big data transfer with two variable node-disjoint paths
AU - Hou, Aiqin
AU - Zuo, Liudong
AU - Zhang, Xiaoyang
AU - Wang, Tao
AU - Fang, Dingyi
AU - Wu, Chase Qishi
N1 - Funding Information:
Manuscript received July 17, 2018; Revised April 20, 2019; approved for publication by Vangelis Angelakis, Division III, February 17, 2020. This research is sponsored by National Nature Science Foundation of China under Grant No. U1609202, Key Research and Development Plan of Shaanxi Province, China under Grant No. 2018GY-011, and Xián Science and Technology Plan under Grant No. GXYD18.2 with Northwest University, China. A. Hou, X. Zhang, T. Wang, and D. Fang are with the School of Information Science and Technology, Northwest University, China, email: {houaiqin, dyf}@nwu.edu.cn,{shinezxy, wangt}@stumail.nwu.edu.cn. C. Q. Wu is with New Jersey Institute of Technology, email: chase.wu@njit.edu. L. Zuo is with California State University, Dominguez Hills, email: lzuo@csudh.edu. C. Q. Wu is the corresponding author. Digital Object Identifier: 10.1109/JCN.2020.000004
Publisher Copyright:
© 2020 KICS.
PY - 2020/4
Y1 - 2020/4
N2 - Many large-scale applications in broad science, engineering, and business domains are generating big data, which must be transferred to remote sites for various storage and analysis purposes. Bandwidth reservation services that discover feasible routing options over dedicated paths in high-performance networks have proved to be effective for such big data transfer. In this paper, we formulate a generic problem of bandwidth scheduling with two variable node-disjoint paths (BS-2VNDP) by exploring the flexibility and capacity of multiple data transfer paths. We further consider two variable paths of either fixed or variable bandwidth with negligible or non-negligible path switching delay, referred to as 2VPFB-0/1 and 2VPVB-0/1, respectively. We prove that all of these four scheduling problems are NP-complete, and then propose a heuristic algorithm for each. For performance comparison, we also design several other heuristic algorithms based on a greedy strategy. These scheduling algorithms are implemented and tested in both simulated and real-life networks, and extensive results show that the proposed heuristic algorithms significantly outperform other algorithms in comparison.
AB - Many large-scale applications in broad science, engineering, and business domains are generating big data, which must be transferred to remote sites for various storage and analysis purposes. Bandwidth reservation services that discover feasible routing options over dedicated paths in high-performance networks have proved to be effective for such big data transfer. In this paper, we formulate a generic problem of bandwidth scheduling with two variable node-disjoint paths (BS-2VNDP) by exploring the flexibility and capacity of multiple data transfer paths. We further consider two variable paths of either fixed or variable bandwidth with negligible or non-negligible path switching delay, referred to as 2VPFB-0/1 and 2VPVB-0/1, respectively. We prove that all of these four scheduling problems are NP-complete, and then propose a heuristic algorithm for each. For performance comparison, we also design several other heuristic algorithms based on a greedy strategy. These scheduling algorithms are implemented and tested in both simulated and real-life networks, and extensive results show that the proposed heuristic algorithms significantly outperform other algorithms in comparison.
KW - Bandwidth scheduling
KW - high-performance networks
KW - node-disjoint paths
KW - switching delay
KW - variable paths
UR - http://www.scopus.com/inward/record.url?scp=85082077754&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85082077754&partnerID=8YFLogxK
U2 - 10.1109/JCN.2020.000004
DO - 10.1109/JCN.2020.000004
M3 - Article
AN - SCOPUS:85082077754
SN - 1229-2370
VL - 22
SP - 130
EP - 144
JO - Journal of Communications and Networks
JF - Journal of Communications and Networks
IS - 2
M1 - 9042892
ER -