Abstract
Exploiting software-defined networking techniques, randomly and instantly mutating routes can disguise strategically important infrastructure and protect the integrity of data networks. Route mutation has been to date formulated as NP-complete constraint satisfaction problem where feasible sets of routes need to be generated with exponential computational complexities, limiting algorithmic scalability to large-scale networks. In this paper, we propose a novel node-centric route mutation method which interprets route mutation as a signature matching problem. We formulate the route mutation problem as a three-dimensional earth mover’s distance (EMD) model and solve it by using a binary branch and bound method. Considering the scalability, we further propose that a heuristic method yields significantly lower computational complexities with marginal loss of robustness against eavesdropping. Simulation results show that our proposed methods can effectively disguise key infrastructure by reducing the difference of historically accumulative traffic among different switches. With significantly reduced complexities, our algorithms are of particular interest to safeguard large-scale networks.
Highlights
Mutating route is a promising technique to provide the integrity of large data networks [1]
We propose new node-centric route mutation methods which are able to effectively change routes of flows at substantially reduced complexities
The key idea is that we propose interpreting route mutation as a signature matching problem and developing a three-dimensional earth mover’s distance (EMD) model with network connectivity and QoS constraints to suppress the traffic difference among switches
Summary
Mutating route is a promising technique to provide the integrity of large data networks [1] It can disguise strategically located important network infrastructures and delay or prevent potential reconnaissance attacks [2]. The key idea is that we propose interpreting route mutation as a signature matching problem and developing a three-dimensional earth mover’s distance (EMD) model with network connectivity and QoS constraints to suppress the traffic difference among switches. Another important aspect of our algorithm is that we solve the new node-centric problem as a threedimensional transportation problem and develop suboptimal algorithms with polynomial time-complexities.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
