TY - GEN
T1 - Provable data plane connectivity with local fast failover
T2 - 3rd ACM SIGCOMM 2014 Workshop on Hot Topics in Software Defined Networking, HotSDN 2014
AU - Borokhovich, Michael
AU - Schiff, Liron
AU - Schmid, Stefan
PY - 2014/1/1
Y1 - 2014/1/1
N2 - Modern software-defined networks support the implementation of in-network failover mechanisms: mechanisms to quickly re-establish connectivity in the data plane without the interaction of the software controller. Interestingly, however, not much is known today about how to make use of these mechanisms. This paper shows a very strong result: there exist failover implementations for OpenFlow that achieve a maximal robustness, in the sense that connectivity is always ensured as long as the underlying physical network is connected. In particular, we show that the problem of computing failover tables is related to graph search, and present three different algorithms achieving different tradeoffs, in terms of the number of required failover rules, the number of tags, as well as the resulting path lengths. Our work can also be seen as a first attempt to implement classic graph algorithms in OpenFlow.
AB - Modern software-defined networks support the implementation of in-network failover mechanisms: mechanisms to quickly re-establish connectivity in the data plane without the interaction of the software controller. Interestingly, however, not much is known today about how to make use of these mechanisms. This paper shows a very strong result: there exist failover implementations for OpenFlow that achieve a maximal robustness, in the sense that connectivity is always ensured as long as the underlying physical network is connected. In particular, we show that the problem of computing failover tables is related to graph search, and present three different algorithms achieving different tradeoffs, in terms of the number of required failover rules, the number of tags, as well as the resulting path lengths. Our work can also be seen as a first attempt to implement classic graph algorithms in OpenFlow.
KW - graph exploration
KW - software-defined networking
UR - http://www.scopus.com/inward/record.url?scp=84907016216&partnerID=8YFLogxK
U2 - 10.1145/2620728.2620746
DO - 10.1145/2620728.2620746
M3 - Conference contribution
AN - SCOPUS:84907016216
SN - 9781450329897
T3 - HotSDN 2014 - Proceedings of the ACM SIGCOMM 2014 Workshop on Hot Topics in Software Defined Networking
SP - 121
EP - 126
BT - HotSDN 2014 - Proceedings of the ACM SIGCOMM 2014 Workshop on Hot Topics in Software Defined Networking
PB - Association for Computing Machinery
Y2 - 22 August 2014 through 22 August 2014
ER -