TY - GEN
T1 - Bandwidth scheduling with multiple fixed node-disjoint paths in high-performance networks
AU - Hou, Aiqin
AU - Wu, Chase Q.
AU - Fang, Dingyi
AU - Wang, Yongqiang
AU - Wang, Meng
N1 - Publisher Copyright:
© ICST Institute forComputer Sciences, Social Informatics andTelecommunicationsEngineering 2017.
PY - 2017
Y1 - 2017
N2 - Many large-scale applications generate large volumes of data that must be transferred over high-performance networks for various storage or analysis purposes. Such requirements call for a fast bandwidth scheduling solution to discover feasible and efficient reservation options in a time-varying network environment. We investigate a bandwidth scheduling problem with two node-disjoint paths, referred to as BS-2NDP, to support big data transfer. In BS-2NDP, we further consider two different types of paths: (i) two fixed paths of fixed bandwidth (2FPFB), and (ii) two fixed paths of variable bandwidth (2FPVB). We show that both 2FPFB and 2FPVB are NP-complete, and then design heuristic approach-based solutions, which are implemented and tested in both simulated and real-life networks. Extensive results illustrate that the proposed heuristics achieve a close-to-optimal performance in small-scale networks, and significantly outperform other heuristic approaches in large-scale networks.
AB - Many large-scale applications generate large volumes of data that must be transferred over high-performance networks for various storage or analysis purposes. Such requirements call for a fast bandwidth scheduling solution to discover feasible and efficient reservation options in a time-varying network environment. We investigate a bandwidth scheduling problem with two node-disjoint paths, referred to as BS-2NDP, to support big data transfer. In BS-2NDP, we further consider two different types of paths: (i) two fixed paths of fixed bandwidth (2FPFB), and (ii) two fixed paths of variable bandwidth (2FPVB). We show that both 2FPFB and 2FPVB are NP-complete, and then design heuristic approach-based solutions, which are implemented and tested in both simulated and real-life networks. Extensive results illustrate that the proposed heuristics achieve a close-to-optimal performance in small-scale networks, and significantly outperform other heuristic approaches in large-scale networks.
KW - Bandwidth scheduling
KW - High-performance networks
KW - Node-disjoint paths
UR - http://www.scopus.com/inward/record.url?scp=85028373521&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85028373521&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-60717-7_9
DO - 10.1007/978-3-319-60717-7_9
M3 - Conference contribution
AN - SCOPUS:85028373521
SN - 9783319607160
T3 - Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST
SP - 86
EP - 96
BT - Quality, Reliability, Security and Robustness in Heterogeneous Networks - 12th International Conference, QShine 2016, Proceedings
A2 - Pack, Sangheon
A2 - Lee, Jong-Hyouk
PB - Springer Verlag
T2 - 12th EAI International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QShine 2016
Y2 - 7 July 2016 through 8 July 2016
ER -