TY - GEN
T1 - Bandwidth scheduling with flexible multi-paths in high-performance networks
AU - Zhang, Xiaoyang
AU - Wu, Chase Q.
AU - Zuo, Liudong
AU - Hou, Aiqin
AU - Wang, Yongqiang
N1 - Funding Information:
This research is sponsored by National Science Foundation under Grant No. CNS-1560698 with New Jersey Institute of Technology, and by National Key Research and Development Plan of China under Grant No. 2017YFB1400301 and National Nature Science Foundation of China under Grant No. 61472320 and U1609202 with Northwest University, China.
PY - 2018/7/13
Y1 - 2018/7/13
N2 - Modern data-intensive applications require the transfer of big data over high-performance networks (HPNs) through bandwidth reservation for various purposes such as data storage and analysis. The key performance metrics for bandwidth scheduling include the utilization of network resources and the satisfaction of user requests. In this paper, for a given batch of Deadline-Constrained Bandwidth Reservation Requests (DCBRRs), we attempt to maximize the number of satisfied requests with flexible scheduling options over link-disjoint paths in an HPN while achieving the best average Earliest Completion Time (ECT) or Shortest Duration (SD) of scheduled requests. We further consider this problem from two bandwidth-oriented principles: (i) Minimum Bandwidth Principle (MINBP), and (ii) Maximum Bandwidth Principle (MAXBP). We show that both of these problem variants are NP-complete, and propose two heuristic algorithms with polynomial-time complexity for each. We conduct bandwidth scheduling experiments on both small-and large-scale DCBRRs in a real-life HPN topology for performance comparison. Extensive results show the superiority of the proposed algorithms over existing ones in comparison.
AB - Modern data-intensive applications require the transfer of big data over high-performance networks (HPNs) through bandwidth reservation for various purposes such as data storage and analysis. The key performance metrics for bandwidth scheduling include the utilization of network resources and the satisfaction of user requests. In this paper, for a given batch of Deadline-Constrained Bandwidth Reservation Requests (DCBRRs), we attempt to maximize the number of satisfied requests with flexible scheduling options over link-disjoint paths in an HPN while achieving the best average Earliest Completion Time (ECT) or Shortest Duration (SD) of scheduled requests. We further consider this problem from two bandwidth-oriented principles: (i) Minimum Bandwidth Principle (MINBP), and (ii) Maximum Bandwidth Principle (MAXBP). We show that both of these problem variants are NP-complete, and propose two heuristic algorithms with polynomial-time complexity for each. We conduct bandwidth scheduling experiments on both small-and large-scale DCBRRs in a real-life HPN topology for performance comparison. Extensive results show the superiority of the proposed algorithms over existing ones in comparison.
KW - Bandwidth scheduling
KW - High-performance networks
KW - Multiple paths
UR - http://www.scopus.com/inward/record.url?scp=85050975772&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85050975772&partnerID=8YFLogxK
U2 - 10.1109/CCGRID.2018.00-69
DO - 10.1109/CCGRID.2018.00-69
M3 - Conference contribution
AN - SCOPUS:85050975772
T3 - Proceedings - 18th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing, CCGRID 2018
SP - 11
EP - 20
BT - Proceedings - 18th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing, CCGRID 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 18th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing, CCGRID 2018
Y2 - 1 May 2018 through 4 May 2018
ER -