PPCU: Proportional per-packet consistent updates for SDNs using data plane time stamps
| Autor: | Radhika Sukapuram, Gautam Barua |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Computer Networks and Communications
Computer science business.industry Network packet 020206 networking & telecommunications Throughput 02 engineering and technology Set (abstract data type) Path (graph theory) 0202 electrical engineering electronic engineering information engineering Forwarding plane 020201 artificial intelligence & image processing business Software-defined networking Computer network |
| Zdroj: | Computer Networks. 155:72-86 |
| ISSN: | 1389-1286 |
| DOI: | 10.1016/j.comnet.2019.03.009 |
| Popis: | Consistently updating switches is a challenging problem in Software Defined Networks. In a per-packet consistent (PPC) update, a packet either matches the new rules added to the set of switches it traverses, or the old rules which will be deleted, but not a combination of both. PPC must be preserved to prevent packets from getting dropped or misrouted and from traversing in loops, which cause policy violations, flow failures and low throughput. We propose PPCU, the first general and practical PPC-preserving update algorithm that confines the changes required during an update to the affected switches, supports wild-carded rules and unlimited concurrent non-conflicting updates, involves no path computation, and works irrespective of the relative speeds of switches or links. Experiments on a simulated network, with realistic parameters, with PPCU implemented in P4, show that the throughput and the number of flows completed are higher during continuous PPCU updates than those during continuous random updates, and that PPCU causes no policy violations. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect