TY - GEN
T1 - Improving Resiliency of Software-Defined Networks with Network Coding-based Multipath Routing
AU - Ai, Jianjian
AU - Chen, Hongchang
AU - Guo, Zehua
AU - Cheng, Guozhen
AU - Baker, Thar
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/6
Y1 - 2019/6
N2 - Traditional network routing protocol exhibits high statics and singleness, which provide significant advantages for the attacker. There are two kinds of attacks on the network: active attacks and passive attacks. Existing solutions for those attacks are based on replication or detection, which can deal with active attacks; but are helpless to passive attacks. In this paper, we adopt the theory of network coding to fragment the data in the Software-Defined Networks and propose a network coding-based resilient multipath routing scheme. First, we present a new metric named expected eavesdropping ratio to measure the resilience in the presence of passive attacks. Then, we formulate the network coding-based resilient multipath routing problem as an integer-programming optimization problem by using expected eavesdropping ratio. Since the problem is NP-hard, we design a Simulated Annealing-based algorithm to efficiently solve the problem. The simulation results demonstrate that the proposed algorithms improve the defense performance against passive attacks by about 20% when compared with baseline algorithms.
AB - Traditional network routing protocol exhibits high statics and singleness, which provide significant advantages for the attacker. There are two kinds of attacks on the network: active attacks and passive attacks. Existing solutions for those attacks are based on replication or detection, which can deal with active attacks; but are helpless to passive attacks. In this paper, we adopt the theory of network coding to fragment the data in the Software-Defined Networks and propose a network coding-based resilient multipath routing scheme. First, we present a new metric named expected eavesdropping ratio to measure the resilience in the presence of passive attacks. Then, we formulate the network coding-based resilient multipath routing problem as an integer-programming optimization problem by using expected eavesdropping ratio. Since the problem is NP-hard, we design a Simulated Annealing-based algorithm to efficiently solve the problem. The simulation results demonstrate that the proposed algorithms improve the defense performance against passive attacks by about 20% when compared with baseline algorithms.
KW - Routing
KW - Software-Defined Networks
KW - integer-programming optimization
KW - network coding
KW - resiliency
UR - https://www.scopus.com/pages/publications/85078887947
U2 - 10.1109/ISCC47284.2019.8969591
DO - 10.1109/ISCC47284.2019.8969591
M3 - Conference contribution
AN - SCOPUS:85078887947
T3 - Proceedings - IEEE Symposium on Computers and Communications
BT - Proceedings - IEEE Symposium on Computers and Communications
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2019 IEEE Symposium on Computers and Communications, ISCC 2019
Y2 - 29 June 2019 through 3 July 2019
ER -