Bandwidth scheduling for big data transfer using multiple fixed node-disjoint paths. (1st May 2017)

• Record Type: Journal Article
• Authors: Hou, Aiqin; Wu, Chase Q.; Fang, Dingyi; Wang, Yongqiang; Wang, Meng
• Is Part Of: Journal of network and computer applications. Volume 85(2017)
• Page Start: 47
• Page End: 55
• Publication Date: 2017-05-01
• Subjects: Big data -- High-performance networks -- Bandwidth scheduling -- Node-disjoint paths; Microcomputers -- Periodicals; Computer networks -- Periodicals; Application software -- Periodicals; Micro-ordinateurs -- Périodiques; Réseaux d'ordinateurs -- Périodiques; Logiciels d'application -- Périodiques; Application software; Computer networks; Microcomputers; Periodicals; 004.05; 004
• DOI: 10.1016/j.jnca.2016.12.011
• Languages: English
• ISSNs: 1084-8045

Abstract

Abstract: Many large-scale applications require the transfer of big data over high-performance networks for remote operations. Such requirements call for a fast bandwidth scheduling solution to discover feasible and efficient reservation options in network environments with time-varying bandwidths. We formulate a generic problem of Bandwidth Scheduling with Two Node-Disjoint Paths (BS-2NDP) to support big data transfer. In BS-2NDP, we further consider two different types of paths: (i) two fixed paths with fixed bandwidth (2FPFB), and (ii) two fixed paths with variable bandwidth (2FPVB). We prove that both 2FPFB and 2FPVB are NP-complete, and design a heuristic approach for each of them. We implement and evaluate these scheduling algorithms in both simulated and real-life networks. Extensive results show that the proposed heuristics achieve a close-to-optimal performance in small-scale networks, and significantly outperform other heuristic approaches in large-scale networks.