| Abstract: |
Software Defined Networking paves the way for new services that enable better utilization of network resources. Bandwidth Calendaring (BWC) is a typical such example that exploits knowledge about future traffic, to optimally pack the arising demands over the network. We consider a generic BWC instance, where a network operator has to accommodate at minimum cost demands of predetermined, but time-varying, bandwidth requirements that can be scheduled within a specific time window. By exploiting the structure of the problem, we propose low complexity methods for the decomposition of the original Mixed integer problem into simpler ones. Our numerical results reveal that the proposed solution approach is near-optimal and outperforms standard methods based on linear programming relaxations and randomized rounding by more than 20%. |
| Biography: |
Lazaros Gkatzikis (S’09–M’13) obtained the Ph.D. degree in computer engineering and communications from the University of Thessaly, Volos, Greece. Currently, he is a Research Staff Member at Huawei France Research Center, Paris, France. In the fall of 2011, he was a Research Intern at the Technicolor Paris Research Laboratory. He has been a Postdoctoral Researcher in the team of Prof. L. Tassiulas in Volos, Greece (2013) and at the KTH Royal Institute of Technology, Stockholm, Sweden (2014) working with Associate Prof. C. Fischione. His research interests include network optimization, mechanism design, and network performance analysis. |
