Quality, Reliability, Security and Robustness in Heterogeneous Networks. 12th International Conference, QShine 2016, Seoul, Korea, July 7–8, 2016, Proceedings

Research Article

Bandwidth Scheduling with Multiple Fixed Node-Disjoint Paths in High-Performance Networks

Download
208 downloads
  • @INPROCEEDINGS{10.1007/978-3-319-60717-7_9,
        author={Aiqin Hou and Chase Wu and Dingyi Fang and Yongqiang Wang and Meng Wang},
        title={Bandwidth Scheduling with Multiple Fixed Node-Disjoint Paths in High-Performance Networks},
        proceedings={Quality, Reliability, Security and Robustness in Heterogeneous Networks. 12th International Conference, QShine 2016, Seoul, Korea, July 7--8, 2016, Proceedings},
        proceedings_a={QSHINE},
        year={2017},
        month={8},
        keywords={High-performance networks Bandwidth scheduling Node-disjoint paths},
        doi={10.1007/978-3-319-60717-7_9}
    }
    
  • Aiqin Hou
    Chase Wu
    Dingyi Fang
    Yongqiang Wang
    Meng Wang
    Year: 2017
    Bandwidth Scheduling with Multiple Fixed Node-Disjoint Paths in High-Performance Networks
    QSHINE
    Springer
    DOI: 10.1007/978-3-319-60717-7_9
Aiqin Hou1,*, Chase Wu,*, Dingyi Fang1,*, Yongqiang Wang1,*, Meng Wang1,*
  • 1: Northwest University
*Contact email: houaiqin@nwu.edu.cn, chase.wu@njit.edu, dyf@nwu.edu.cn, yqwang@nwu.edu.cn, xidawm@stumail.nwu.edu.cn

Abstract

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.