@misc{BetkerGamrathKosiankowskietal.2014, author = {Betker, Andreas and Gamrath, Inken and Kosiankowski, Dirk and Lange, Christoph and Lehmann, Heiko and Pfeuffer, Frank and Simon, Felix and Werner, Axel}, title = {Comprehensive Topology and Traffic Model of a Nation-wide Telecommunication Network}, issn = {1438-0064}, doi = {10.1364/JOCN.6.001038}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-52670}, year = {2014}, abstract = {As a basis for meaningful simulation and optimization efforts with regard to traffic engineering or energy consumption in telecommunication networks, suitable models are indispensable. This concerns not only realistic network topologies, but also models for the geographical distribution and the temporal dynamics of traffic, as well as the assumptions on network components and technology. This paper derives such a model from the practice of a large national carrier. Applying the network and traffic model, we demonstrate its use by presenting various optimization cases related to energy-efficient telecommunication. Here, we focus on load-adaptivity by employing sleep modes to the network hardware, where several constraints on the reconfigurability of the network over time are considered.}, language = {en} } @misc{PfeufferWerner2015, author = {Pfeuffer, Frank and Werner, Axel}, title = {Adaptive telecommunication network operation with a limited number of reconfigurations}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-55547}, year = {2015}, abstract = {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.}, language = {en} } @article{BetkerGamrathKosiankowskietal.2014, author = {Betker, Andreas and Gamrath, Inken and Kosiankowski, Dirk and Lange, Christoph and Lehmann, Heiko and Pfeuffer, Frank and Simon, Felix and Werner, Axel}, title = {Comprehensive Topology and Traffic Model of a Nationwide Telecommunication Network}, volume = {6}, journal = {Journal of Optical Communications and Networking}, number = {11}, doi = {10.1364/JOCN.6.001038}, pages = {1038 -- 1047}, year = {2014}, abstract = {As a basis for meaningful simulation and optimization efforts with regard to traffic engineering or energy consumption in telecommunication networks, suitable models are indispensable. This concerns not only realistic network topologies but also models for the geographical distribution and the temporal dynamics of traffic, as well as the assumptions on network components and technology. This paper derives such a model from the practice of a large national carrier. Applying the network and traffic model, we demonstrate its use by presenting various optimization cases related to energy-efficient telecommunication. Here, we focus on load adaptivity by employing sleep modes to the network hardware, where several constraints on the reconfigurability of the network over time are considered.}, language = {en} }