TY - GEN
T1 - Periodic scheduling of deadline-constrained variable slot-bandwidth reservations for scientific collaboration
AU - Wang, Yongqiang
AU - Wu, Chase Q.
AU - Hou, Aiqin
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/9/14
Y1 - 2017/9/14
N2 - With the maturity and proliferation of Software-Defined Networking (SDN), there has been an increasing number of network deployments that provide dedicated connections through on-demand and in- advance scheduling in support of data-intensive applications for global scientific collaboration. In such dedicated network environments, bandwidth scheduling serves as a key technique to improve the utilization of network resources and meet diverse user requests. In this paper, we formulate a periodic bandwidth scheduling problem to maximize the number of satisfied user requests for variable slot-bandwidth reservation under deadline constraint on a network path, referred to as VSBR- DC. We show that VSBR-DC is NP-complete, and propose a bandwidth scheduling algorithm based on optimal scheduling order and allocation strategy, referred to as OSOAS-BS. Extensive simulation results show that OSOAS-BS has a superior performance in terms of scheduling success ratio over three heuristic algorithms designed for performance comparison, and may be used to facilitate scientific collaboration that requires VSBR- based reservation services for coordinated data transfer over high-speed network links.
AB - With the maturity and proliferation of Software-Defined Networking (SDN), there has been an increasing number of network deployments that provide dedicated connections through on-demand and in- advance scheduling in support of data-intensive applications for global scientific collaboration. In such dedicated network environments, bandwidth scheduling serves as a key technique to improve the utilization of network resources and meet diverse user requests. In this paper, we formulate a periodic bandwidth scheduling problem to maximize the number of satisfied user requests for variable slot-bandwidth reservation under deadline constraint on a network path, referred to as VSBR- DC. We show that VSBR-DC is NP-complete, and propose a bandwidth scheduling algorithm based on optimal scheduling order and allocation strategy, referred to as OSOAS-BS. Extensive simulation results show that OSOAS-BS has a superior performance in terms of scheduling success ratio over three heuristic algorithms designed for performance comparison, and may be used to facilitate scientific collaboration that requires VSBR- based reservation services for coordinated data transfer over high-speed network links.
KW - High-performance networks
KW - Periodic bandwidth scheduling
KW - Scientific collaboration
UR - http://www.scopus.com/inward/record.url?scp=85032273285&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85032273285&partnerID=8YFLogxK
U2 - 10.1109/ICCCN.2017.8038437
DO - 10.1109/ICCCN.2017.8038437
M3 - Conference contribution
AN - SCOPUS:85032273285
T3 - 2017 26th International Conference on Computer Communications and Networks, ICCCN 2017
BT - 2017 26th International Conference on Computer Communications and Networks, ICCCN 2017
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 26th International Conference on Computer Communications and Networks, ICCCN 2017
Y2 - 31 July 2017 through 3 August 2017
ER -