On consistent migration of flows in SDNs

Brandt, Sebastian; Förster, Klaus-Tycho; Wattenhofer, Roger

doi:10.1109/infocom.2016.7524332

Cited by 85 publications

(47 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Flow migration (FM) in SDN has recently received some attention [9], [10], [5], [11]. In [9], each packet or flow is stamped with a version number to refer to old or new forwarding rules, and a packet/flow is solely routed with regard to one set of rules.…”

Section: B Related Workmentioning

confidence: 99%

“…To address this, certain flows are assumed rate-limited to enable a conflict-free FM. Brandt et al show that given a network flow configuration, there is a polynomial-time algorithm to decide if a congestion-free migration is possible for the case of splittable flows [11]. However, they mention that the decision problem is NP-hard if all flows must be integer or are unsplittable.…”

Section: B Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Dynamic Flow Migration for Delay Constrained Traffic in Software-Defined Networks

Danielis

Dan

Gross

et al. 2017

GLOBECOM 2017 - 2017 IEEE Global Communications Conference

View full text Add to dashboard Cite

Abstract-Various industrial control applications have stringent end-to-end latency requirements in the order of a few milliseconds. Software-defined networking (SDN) is a promising solution in order to meet these stringent requirements under varying traffic patterns, as it enables the flexible management of flows across the network. Thus, SDN allows to ensure that traffic flows use congestion-free paths, reducing the delay to forwarding and processing delays at the SDN nodes. However, accommodating new flows at runtime is under such a setting challenging as it may require the migration of existing flows, without interrupting ongoing traffic. In this paper, we consider the problem of dynamic flow migration and propose a polynomial time algorithm that can find a solution if direct flow migration is feasible. We furthermore propose an algorithm for computing both direct and indirect flow migration and prove its correctness. Numerical results obtained on a FatTree network topology show that flow migration is typically necessary for networks with a moderate number of flows, while direct flow migration is feasible in around 60% of the cases.

show abstract

Section: B Related Workmentioning

confidence: 99%

Section: B Related Workmentioning

confidence: 99%

Dynamic Flow Migration for Delay Constrained Traffic in Software-Defined Networks

Danielis

Dan

Gross

et al. 2017

GLOBECOM 2017 - 2017 IEEE Global Communications Conference

View full text Add to dashboard Cite

show abstract

“…Dudycz et al [3] show that simultaneously computing two network updates while requiring a minimal number of switch updates ("touches") is NP-hard. Brandt et al [2] give a polynomial algorithm to decide if congestion-free update is possible when flows are "splittable" and/or not restricted to be integer.…”

Section: Related Workmentioning

confidence: 99%

Optimal Consistent Network Updates in Polynomial Time

Černý

Foster

Jagnik

et al. 2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Software-defined networking (SDN) allows operators to control the behavior of a network by programatically managing the forwarding rules installed on switches. However, as is common in distributed systems, it can be difficult to ensure that certain consistency properties are preserved during periods of reconfiguration. The widely-accepted notion of per-packet consistency requires every packet to be forwarded using the new configuration or the old configuration, but not a mixture of the two. If switches can be updated in some (partial) order which guarantees that per-packet consistency is preserved, we call this order a consistent order update. In particular, switches that are incomparable in this order can be updated in parallel. We call a consistent order update optimal if it allows maximal parallelism. This paper presents a polynomial-time algorithm for finding an optimal consistent order update. This contrasts with other recent results in the literature, which show that for other classes of properties (e.g., loop-freedom and waypoint enforcement), the optimal update problem is NP-complete.

show abstract

“…On the other hand, migrating multiple flows at the same time in a provably congestion-free manner without making any assumptions about the timing of these updates at switches is a challenging problem and has been thoroughly investigated. It was shown in [36] that instead of performing forwarding rule update in a single step there often exists a sequence of consistent network updates (i.e., congestion-free and without temporary demand reduction [29]) that deploys the desired flows in the network. A polynomialtime algorithm was introduced in [36] to decide whether a consistent sequence of forwarding rule updates (i.e., migration plan) exists or not.…”

Section: A Alert-based Reconfiguration Of Network Connectivitymentioning

confidence: 99%

“…It was shown in [36] that instead of performing forwarding rule update in a single step there often exists a sequence of consistent network updates (i.e., congestion-free and without temporary demand reduction [29]) that deploys the desired flows in the network. A polynomialtime algorithm was introduced in [36] to decide whether a consistent sequence of forwarding rule updates (i.e., migration plan) exists or not. However, if the flows are not allowed to be split -flows have to be switched at once or in integer parts from the current to their desired paths -then it is NP-hard to decide whether such a migration plan exists or not.…”

Section: A Alert-based Reconfiguration Of Network Connectivitymentioning

confidence: 99%

A survey on network resiliency methodologies against weather-based disruptions

Tornatore

André

Babarczi

et al. 2016

2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM)

View full text Add to dashboard Cite

Abstract-Due to the increasing dependence on network services of our society, research has recently been concentrating on enhancing traditional protection strategies to withstand largescale failures, as in case of disaster events. The recently-formed EU-funded RECODIS project aims at coordinating and fostering research collaboration in Europe on disaster resiliency in communication networks. In particular, the Working Group (WG) 2 of the RECODIS project focuses on developing new networkresiliency strategies to survive weather-based disruptions. As a first step, WG2 members have conducted a comprehensive literature survey on existing studies on this topic. This paper classifies and summarizes the most relevant studies collected by WG2 members in this first phase of the project. While the majority of studies regarding weather-based disruptions deals with wireless network (as wireless channel is directly affected by weather conditions), in this survey we cover also disasterresiliency approaches designed for wired network if they leverage network reconfiguration based on disaster "alerts", considering that many weather-based disruptions grant an "alert" thanks to weather forecast.

show abstract

On consistent migration of flows in SDNs

Cited by 85 publications

References 24 publications

Dynamic Flow Migration for Delay Constrained Traffic in Software-Defined Networks

Dynamic Flow Migration for Delay Constrained Traffic in Software-Defined Networks

Optimal Consistent Network Updates in Polynomial Time

A survey on network resiliency methodologies against weather-based disruptions

Contact Info

Product

Resources

About