Load Balanced Model for Bandwidth Calendaring Problem

In this paper, we focus on traffic engineering technologies for the demands of users who are flexible in terms of use time. These technologies are called “bandwidth calendaring and much research has been conducted on them. Most of them are assumed to be applied to bandwidth assignment on WANs connected to data centers. We are interested in balancing the loads on links so as to accommodate as many demands arriving after allocation as possible on a network.For this purpose, we propose a bandwidth calendaring model for balancing link loads. This model is formulated as a dynamic optimization problem with nonlinear link cost functions. We propose a high speed algorithm that uses the network structure of the problem. Numerical experiments will clarify the effectiveness of the proposed model and actual computation in a practical-scale network.