Multi-hour Design of Dynamically Reconfigurable MPLS Networks

This paper proposes an algorithm for cost-efficient network design. The two main network components are the routers and the links connecting them. As these network elements have discrete capacity values, their costs are modeled by stepwise functions. In the current interpretation of the network design problem the subproblems of topological design, resource dimensioning, and routing of traffic flows are handled simultaneously. Using new network technologies (e.g., MPLS) the operators have the opportunity to reconfigure their networks dynamically. By using this function the periodic (e.g., daily, weekly) changes of traffic volumes and directions can be taken into consideration during network design resulting in lower deployment costs. The algorithm proposed for multi-hour design is based on an efficient, published method. The efficiency of the new algorithm is demonstrated by simulation on random and real network topologies with the help of two reference algorithms.