Scipediacontent: Scipediacontent moved page Draft Content 470702990 to Tassiulas et al 2017a

2021-02-03T20:01:47Z

Scipediacontent moved page Draft Content 470702990 to Tassiulas et al 2017a

Scipediacontent: Created page with " == Abstract == © 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including..."

2021-02-03T20:01:44Z

New page

== Abstract ==

© 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. Nowadays, there is a fast-paced shift from legacy telecommunication systems to novel Software Defined Network (SDN) architectures that can support on-the-fly network reconfiguration, therefore, empowering advanced traffic engineering mechanisms. Despite this momentum, migration to SDN cannot be realized at once especially in high-end cost networks of Internet Service Providers (ISPs). It is expected that ISPs will gradually upgrade their networks to SDN over a period that spans several years. In this paper, we study the SDN upgrading problem in an ISP network: which nodes to upgrade and when. We consider a general model that captures different migration costs and network topologies, and two plausible ISP objectives; first, the maximization of the traffic that traverses at least one SDN node, and second, the maximization of the number of dynamically selectable routing paths enabled by SDN nodes. We leverage the theory of submodular and supermodular functions to devise algorithms with provable approximation ratios for each objective. Using real-world network topologies and traffic matrices, we evaluate the performance of our algorithms and show up to 54% gains over state-of-the-art methods. Moreover, we describe the interplay between the two objectives; maximizing one may cause a factor of 2 loss to the other. EC/H2020/679158/EU/Resolving the Tussle in the Internet: Mapping, Architecture, and Policy Making/ResolutioNe

== Original document ==

The different versions of the original document can be found in:

* [http://dx.doi.org/10.1109/infocom.2017.8057136 http://dx.doi.org/10.1109/infocom.2017.8057136]

* [https://depositonce.tu-berlin.de/bitstream/11303/10416/4/poularakis_etal_2017.pdf https://depositonce.tu-berlin.de/bitstream/11303/10416/4/poularakis_etal_2017.pdf]

* [http://xplorestaging.ieee.org/ielx7/8049192/8056940/08057136.pdf?arnumber=8057136 http://xplorestaging.ieee.org/ielx7/8049192/8056940/08057136.pdf?arnumber=8057136],
: [http://dx.doi.org/10.1109/infocom.2017.8057136 http://dx.doi.org/10.1109/infocom.2017.8057136]

* [https://dblp.uni-trier.de/db/conf/infocom/infocom2017.html#PoularakisIST17 https://dblp.uni-trier.de/db/conf/infocom/infocom2017.html#PoularakisIST17],
: [https://depositonce.tu-berlin.de/bitstream/11303/10416/4/poularakis_etal_2017.pdf https://depositonce.tu-berlin.de/bitstream/11303/10416/4/poularakis_etal_2017.pdf],
: [https://ieeexplore.ieee.org/document/8057136 https://ieeexplore.ieee.org/document/8057136],
: [https://depositonce.tu-berlin.de/handle/11303/10416 https://depositonce.tu-berlin.de/handle/11303/10416],
: [https://academic.microsoft.com/#/detail/2761021290 https://academic.microsoft.com/#/detail/2761021290]

* [https://depositonce.tu-berlin.de/handle/11303/10416 https://depositonce.tu-berlin.de/handle/11303/10416],
: [http://dx.doi.org/10.14279/depositonce-9368 http://dx.doi.org/10.14279/depositonce-9368]

DOIS: 10.1109/infocom.2017.8057136 10.14279/depositonce-9368

← Older revision	Revision as of 20:01, 3 February 2021
(No difference)

Tassiulas et al 2017a - Revision history

Scipediacontent: Scipediacontent moved page Draft Content 470702990 to Tassiulas et al 2017a

Scipediacontent: Created page with " == Abstract == © 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including..."