A greedy approach for minimizing SDN control overhead

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In the SDN approach, the control and data planes are separated to enable programmability and interoperability, the control plane being logically centralized. Scalability and reliability are key properties for the SDN control plane. In WAN deployments, it is already envisioned as physically distributed to span across the networks and avoid single point of failure. In this paper, we tackle the problem of minimizing the overhead generated by distributed SDN controllers. We first model this problem as a Mixed Integer Program (MIP) and then propose a greedy algorithm. The results on the GEANT topology and on random graphs with up to 100 nodes show that our heuristic approaches to less than 3% the optimal in a manageable time.

Original languageEnglish
Title of host publication1st IEEE Conference on Network Softwarization
Subtitle of host publicationSoftware-Defined Infrastructures for Networks, Clouds, IoT and Services, NETSOFT 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781479978991
DOIs
Publication statusPublished - 1 Jun 2015
Event1st IEEE Conference on Network Softwarization, NETSOFT 2015 - London, United Kingdom
Duration: 13 Apr 201517 Apr 2015

Publication series

Name1st IEEE Conference on Network Softwarization: Software-Defined Infrastructures for Networks, Clouds, IoT and Services, NETSOFT 2015

Conference

Conference1st IEEE Conference on Network Softwarization, NETSOFT 2015
Country/TerritoryUnited Kingdom
CityLondon
Period13/04/1517/04/15

Fingerprint

Dive into the research topics of 'A greedy approach for minimizing SDN control overhead'. Together they form a unique fingerprint.

Cite this