Minimizing Update Makespan in SDNs Without TCAM Overhead

Dolati, Mahdi; Khonsari, Ahmad; Ghaderi, Majid

doi:10.1109/tnsm.2022.3146971

Cited by 2 publications

(1 citation statement)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The foremost of which is the fact that performing a path hop requires reconfiguring the flow table of every switch along each of the disjoint paths used by a path hopping flow. This need for runtime reconfiguration of switch flow tables has the potential to introduce transient packet losses and inconsistent routing behavior [4]. These drawbacks are particularly limiting given that the security of a path hopping flow is proportional to the frequency with which hopping can take place.…”

Section: Path Hopping Approachesmentioning

confidence: 99%

On Randomization in MTD Systems

Ghaderi

Jero

Nita-Rotaru

2022

Proceedings of the 9th ACM Workshop on Moving Target Defense

View full text Add to dashboard Cite

Randomization is one of the main strategies in providing security in moving-target-defense (MTD) systems. However, randomization has an associated cost and estimating this cost and its impact on the overall system is crucial to ensure adoption of the MTD strategy. In this paper we discuss our experience in attempting to estimate the cost of path randomization in a message transmission system that used randomization of paths in the network. Our conclusions are (i) the cost crucially depends on the underlying network control technology, (ii) one can reduce this cost by better implementation, and (iii) reducing one type of cost may result in increased costs of a different type, for example a higher device cost. These suggest that estimating the cost of randomization is a multivariable optimization problem that requires a full understanding of the system components. CCS CONCEPTS• Security and privacy → Network security.

show abstract

Section: Path Hopping Approachesmentioning

confidence: 99%