Periodic Scheduling of Deadline-Constrained Bandwidth Reservations for Scientific Collaboration
Yong‐Qiang Wang, Chase Qishi Wu, Aiqin Hou · 2016
As Software-Defined Networking (SDN) continues to mature and proliferate, many large computing and storage facilities are now connected by high-speed links to support global scientific collaboration. In such dedicated network environments, bandwidth scheduling plays a critical role in improving the utilization of network resources and meeting diverse user requests. In this paper, we formulate a periodic bandwidth scheduling problem to maximize the number of satisfied user requests for fixed-bandwidth floating-slot reservation under deadline constraint on a network path, referred to as FBFS-DC. We prove that FBFS-DC is NP-complete, and propose a bandwidth scheduling algorithm based on product of bandwidth and slot, referred to as Product-BS. Extensive simulation-based scheduling experiments show that Product-BS has a superior performance in terms of scheduling success ratio over three heuristic algorithms designed for performance comparison. The proposed scheduling algorithm has great potential to improve the performance of collaborative scientific applications that require the FBFS service for coordinated network-based operations.