On Consistent Migration of Flows in SDNs

On Consistent Migration of Flows in SDNs

Abstract

We study consistent migration of flows, with special focus on software defined networks. Given a current and a desired network flow configuration, we give the first polynomial-time algorithm to decide if a congestion-free migration is possible. However, if all flows must be integer or are unsplittable, this is NP-hard to decide. A similar problem is providing increased bandwidth to an application, while keeping all other flows in the network, but possibly migrating them consistently to other paths. We show that the maximum increase can be approximated arbitrarily well in polynomial time. Current methods as RSVP-TE consider unsplittable flows and remove flows of lesser importance in order to increase bandwidth for an application: We prove that deciding what flows need to be removed is an NP-hard optimization problem with no PTAS possible unless P = NP.

Grafik Top
Authors
  • Brandt, Sebastian
  • Foerster, Klaus-Tycho
  • Wattenhofer, Roger
Grafik Top
Supplemental Material
Shortfacts
Category
Paper in Conference Proceedings or in Workshop Proceedings (Paper)
Event Title
36th IEEE International Conference on Computer Communications (INFOCOM 2016)
Divisions
Communication Technologies
Subjects
Rechnerperipherie, Datenkommunikationshardware
Event Location
San Francisco, USA
Event Type
Conference
Event Dates
10-15 Apr 2016
Date
April 2016
Export
Grafik Top