TY - GEN
T1 - Periodic Scheduling of Profiling-Based Floating-Window Bandwidth Reservations for Scientific Collaboration
AU - Wang, Yongqiang
AU - Wu, Chase Q.
AU - Hou, Aiqin
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/7/2
Y1 - 2017/7/2
N2 - An increasing number of scientific applications carry out big data transfer through dedicated networks for global collaboration, where bandwidth scheduling plays a critical role in improving the utilization of network resources and meeting diverse user requests. In this paper, we formulate a periodic bandwidth scheduling problem to maximize the number of satisfied user requests for profiling-based floating-window bandwidth reservations under deadline constraint on a network path, referred to as PFWR-DC. We prove that PFWR-DC is NP-complete, and propose an integrated bandwidth scheduling algorithm based on the product of floating-window size and dynamic transport throughput, referred to as ProductWT-BS. Extensive simulation results shed light on the performance superiority of ProductWT-BS in terms of scheduling success ratio over five heuristic algorithms designed for performance comparison. The proposed scheduling algorithm has great potential to improve the performance of collaborative scientific applications that require the floating-window bandwidth provisioning service for coordinated network-based operations.
AB - An increasing number of scientific applications carry out big data transfer through dedicated networks for global collaboration, where bandwidth scheduling plays a critical role in improving the utilization of network resources and meeting diverse user requests. In this paper, we formulate a periodic bandwidth scheduling problem to maximize the number of satisfied user requests for profiling-based floating-window bandwidth reservations under deadline constraint on a network path, referred to as PFWR-DC. We prove that PFWR-DC is NP-complete, and propose an integrated bandwidth scheduling algorithm based on the product of floating-window size and dynamic transport throughput, referred to as ProductWT-BS. Extensive simulation results shed light on the performance superiority of ProductWT-BS in terms of scheduling success ratio over five heuristic algorithms designed for performance comparison. The proposed scheduling algorithm has great potential to improve the performance of collaborative scientific applications that require the floating-window bandwidth provisioning service for coordinated network-based operations.
KW - High-performance networks
KW - bandwidth scheduling
KW - data transfer
KW - resource utilization
UR - http://www.scopus.com/inward/record.url?scp=85047501791&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85047501791&partnerID=8YFLogxK
U2 - 10.1109/HPCC-SmartCity-DSS.2017.63
DO - 10.1109/HPCC-SmartCity-DSS.2017.63
M3 - Conference contribution
AN - SCOPUS:85047501791
T3 - Proceedings - 2017 IEEE 19th Intl Conference on High Performance Computing and Communications, HPCC 2017, 2017 IEEE 15th Intl Conference on Smart City, SmartCity 2017 and 2017 IEEE 3rd Intl Conference on Data Science and Systems, DSS 2017
SP - 482
EP - 489
BT - Proceedings - 2017 IEEE 19th Intl Conference on High Performance Computing and Communications, HPCC 2017, 2017 IEEE 15th Intl Conference on Smart City, SmartCity 2017 and 2017 IEEE 3rd Intl Conference on Data Science and Systems, DSS 2017
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 19th IEEE Intl Conference on High Performance Computing and Communications, 15th IEEE Intl Conference on Smart City, and 3rd IEEE Intl Conference on Data Science and Systems, HPCC/SmartCity/DSS 2017
Y2 - 18 December 2017 through 20 December 2017
ER -