Adaptive telecommunication network operation with a limited number of reconfigurations

Please always quote using this URN: urn:nbn:de:0297-zib-55547
  • Rising traffic in telecommunication networks lead to rising energy costs for the network operators. Meanwhile, increased flexibility of the networking hardware may help to realize load-adaptive operation of the networks to cut operation costs. To meet network operators’ concerns over stability, we propose to switch network configurations only a limited number of times per day. We present a method for the integrated computation of optimal switching times and network configurations that alternatingly solves mixed-integer programs and constrained shortest cycle problems in a certain graph. Similarly to the Branch & Bound Algorithm, it uses lower and upper bounds on the optimum value and allows for pivoting strategies to guide the computation and avoid the solution of irrelevant subproblems. The algorithm can act as a framework to be adapted and applied to suitable problems of different origin.

Download full text files

Export metadata

Author:Frank Pfeuffer, Axel Werner
Document Type:ZIB-Report
Tag:Branch and Bound; Dynamic Traffic; Network Design; Telecommunication
MSC-Classification:68-XX COMPUTER SCIENCE (For papers involving machine computations and programs in a specific mathematical area, see Section -04 in that area)
Date of first Publication:2015/07/10
Series (Serial Number):ZIB-Report (15-36)