Abstract
Software-defined network (SDN) architectures raise the question of how to deal with situations where the indirection via the control plane is not fast enough or not possible. In order to provide a high availability, connectivity, and robustness, dependable SDNs must support basic functionality also in the data plane. In particular, SDNs should implement functionality for inband network traversals, e.g., to find failover paths in the presence link failures. This paper shows that robust inband network traversal schemes for dependable SDNs are feasible, and presents three fundamentally different mechanisms: simple stateless mechanisms, efficient mechanisms based on packet tagging, and mechanisms based on dynamic state at the switches. We show how these mechanisms can be implemented in today's SDNs and discuss different applications.
Original language | English |
---|---|
Pages (from-to) | 172-183 |
Number of pages | 12 |
Journal | Computer Communications |
Volume | 116 |
DOIs | |
State | Published - 1 Jan 2018 |
Externally published | Yes |
Keywords
- Algorithms
- Connectivity
- Local Fast Failover
- OpenFlow
- Software-Defined Networking (SDN)
ASJC Scopus subject areas
- Computer Networks and Communications