CCU: Algorithm for Concurrent Consistent Updates for a Software Defined Network

Sukapuram, Radhika; Barua, Gautam

doi:10.1109/ncc.2016.7561139

Cited by 4 publications

(3 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…22: end if 23: end if 24: end while 25: end procedure Algorithm at the control plane: This section first specifies the algorithm for the control plane, at the controller (Algorithm 1) and at each s i ∈ S (Algorithm 2) and later for the data plane, in Algorithm 3. The message exchanges below are the same as in [16] and [18]; the parameters in them and actions upon receiving them have been modified to suit PPCU.…”

Section: Algorithm For Concurrent Consistent Updatesmentioning

confidence: 99%

“…Why the number of switches involved in the update must be less: Algorithms that perform a Rules Update while preserving PPC either 1) need to update all the switches B in the network [7] [16] or 2) identify paths affected by S and update all the switches along those paths [1] [17] or 3) update only S and all the ingresses [18] [19], regardless of the number of elements in S and regardless of the number of rules to be updated.…”

Section: Motivation and Related Workmentioning

confidence: 99%

“…Applications that control the network [27], [28], [29] and VM and virtual network migration [30] will require frequent updates to the network, making large concurrent updates common to SDNs. Existing algorithms that preserve PPC and allow concurrent updates limit the maximum number of concurrent updates [18] [19] [1], with the last one becoming impractical if the number of paths affected by the update is large. 2PU [7] does not support concurrency.…”

Section: Motivation and Related Workmentioning

confidence: 99%

See 2 more Smart Citations

PPCU: Proportional per-packet consistent updates for Software Defined Networks

Sukapuram

Barua

2016

2016 IEEE 24th International Conference on Network Protocols (ICNP)

Self Cite

View full text Add to dashboard Cite

In Software Defined Networks, where the network control plane can be programmed by updating switch rules, consistently updating switches is a challenging problem. In a per-packet consistent update (PPC), a packet either matches the new rules added or the old rules to be deleted, throughout the network, but not a combination of both. PPC must be preserved during an update to prevent packet drops and loops, provide waypoint invariance and to apply policies consistently. No algorithm exists today that confines changes required during an update to only the affected switches, yet preserves PPC and does not restrict applicable scenarios. We propose a general update algorithm called PPCU that preserves PPC, is concurrent and provides an all-or-nothing semantics for an update, irrespective of the execution speeds of switches and links, while confining changes to only the affected switches and affected rules. We use data plane time stamps to identify when the switches must move from the old rules to the new rules. For this, we use the powerful programming features provided to the data plane by the emerging programmable switches, which also guarantee line rate. We prove the algorithm, identify its significant parameters and analyze the parameters with respect to other algorithms in the literature.

show abstract

Section: Algorithm For Concurrent Consistent Updatesmentioning

confidence: 99%