On Polynomial-Time Congestion-Free Software-Defined Network Updates

On Polynomial-Time Congestion-Free Software-Defined Network Updates

Abstract

We consider the SDN network update problem in which a controller wants to update the routes of k (unsplittable) flows from their old paths to the new paths, consistently, i.e., without temporary congestion. As updates communicated by the controller take effect asynchronously, the challenge is to perform these updates fast, i.e., using a minimal number of rounds (controller interactions). We present the first fast, i.e., polynomial-time solution for scheduling such congestion-free network updates, for two flows and in the node ordering model. We also show that the problem is already NP-hard for six flows. We complement our formal results with simulations.

Grafik Top
Authors
  • Akhoondian Amiri, Saeed
  • Dudycz, Szymon
  • Parham, Mahmoud
  • Schmid, Stefan
  • Wiederrecht, Sebastian
Grafik Top
Supplemental Material
Shortfacts
Category
Paper in Conference Proceedings or in Workshop Proceedings (Paper)
Event Title
18th IFIP Networking Conference (IFIP Networking)
Divisions
Communication Technologies
Subjects
Informatik Sonstiges
Theoretische Informatik
Rechnerperipherie, Datenkommunikationshardware
Event Location
Warsaw, Poland
Event Type
Conference
Event Dates
20-22 May 2019
Date
May 2019
Export
Grafik Top