Name
Abstract | ||
|---|---|---|
Software Defined Networking enables centralized network control and hence paves the way for new services that use network resources more efficiently. Bandwidth Calendaring (BWC) is a typical such example that exploits the knowledge of future to optimally pack the arising demands over the network. In this paper, we consider a generic BWC instance, where a carrier network operator has to accommodate at minimum cost demands of predetermined, but time-varying, bandwidth requirements. Some of the demands may be flexible, i.e., can be scheduled within a specific time window. We demonstrate that the resulting problem is NP-hard and we propose a scalable problem decomposition based on column generation. Our numerical results reveal that the proposed solution approach is near-optimal and outperforms state-of-the art methods based on relaxation and randomized rounding by more than 20% in terms of network cost. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/ICC.2016.7510888 | 2016 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC) |
Field | DocType | ISSN |
Column generation,Data transmission,Scheduling (computing),Computer science,Computer network,Real-time computing,Bandwidth (signal processing),Dynamic bandwidth allocation,Software-defined networking,Network traffic control,Distributed computing,Scalability | Conference | 1550-3607 |
Citations | PageRank | References |
2 | 0.54 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lazaros Gkatzikis | 1 | 282 | 16.90 |
| Stefano Paris | 2 | 140 | 15.36 |
| Ioannis Steiakogiannakis | 3 | 2 | 0.54 |
| Symeon Chouvardas | 4 | 197 | 13.31 |