|
| | | | |
| | | |
| Stat |
Members: 3667
Articles: 2'599'751
Articles rated: 2609
08 February 2025 |
|
| | | | |
|
Article overview
| |
|
|
PPCU: Proportional Per-packet Consistent Updates for Software Defined Networks - A Technical Report | | Radhika Sukapuram
; Gautam Barua
; | | Date: |
1 Sep 2016 | | Abstract: | 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. | | Source: | arXiv, 1609.0126 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
|
| |
|
|
|
REGISTER