Online Bandwidth Calendaring: On-the-fly admission, scheduling, and path computation
Maxime Dufour, Stefano Paris, Jérémie Leguay, Moez Draief · 2017
The centralized control in Software Defined Networks paves the way for new services like Bandwidth Calendaring (BWC), where the possibility to shift temporally future bandwidth requests allows to efficiently use network resources. Assuming perfect knowledge of the calendar for all future bandwidth reservations is unrealistic. In this paper, we study the online version of the BWC problem presented in [1], where for unpredictable incoming demands an admission decision, scheduling and path allocation must be taken instantaneously. We design an algorithm for solving the online version of the BWC problem and proposes two heuristic approaches to exploit the scheduling flexibility of demands. Our numerical results reveal that the proposed solution approach outperforms state-of-the art methods by up to 70% in terms of accepted traffic.