On periodic scheduling of fixed-slot bandwidth reservations for big data transfer

The efficiency of bandwidth scheduling in high-performance networks (HPNs) is critical to the utilization of network resources and the satisfaction of user requests. We consider a periodic bandwidth scheduling problem to maximize the number of satisfied fixed-slot bandwidth reservation requests, referred to as multiple fixed-slot bandwidth scheduling (MFSBS), which is shown to be NP-complete. We first design a minimum resource occupation algorithm for a special type of M-FSBS with identical slots, referred to as MinRO-IS, and further propose a generalized version of MinRO for M-FSBS with arbitrary slots. We also design four greedy algorithms for performance comparison. Extensive simulation results illustrate that both MinRO-IS and MinRO have a superior performance over the existing algorithms in the literature and the other four greedy algorithms in comparison. Considering the popularity of the FSBS-based service model and the rapid expansion of HPNs in both speed and scope, the proposed scheduling algorithms have great potential to improve the network performance of big-data applications that require the FSBS service in HPNs.