Transiently Secure Network Updates

Transiently Secure Network Updates

Abstract

Computer networks have become a critical infrastructure. Especially in shared environments such as datacenters it is important that a correct, consistent and secure network operation is guaranteed at any time, even during routing policy updates. In particular, at no point in time should it be possible for packets to bypass security critical waypoints (such as a firewall or IDS) or to be forwarded along loops. This paper studies the problem of how to change routing policies in a transiently consistent manner. Transiently consistent network updates have been proposed as a fast and resource efficient alternative to per-packet consistent updates. Our main result is a negative one: we show that there are settings where the two basic properties waypoint enforcement and loop-freedom cannot be satisfied simultaneously. Even worse, we rigorously prove that deciding whether a waypoint enforcing, loop-free network update schedule exists is NP-hard. These results hold for both kinds of loopfreedom used in the literature: strong and relaxed loopfreedom. This paper also presents optimized, exact mixed integer programs to compute optimal update schedules. We report on extensive simulation results and initiate the discussion of scenarios where multiple waypoints need to be ensured (also known as service chains).

Grafik Top
Authors
  • Ludwig, Arne
  • Dudycz, Szymon
  • Rost, Matthias
  • Schmid, Stefan
Grafik Top
Supplemental Material
Shortfacts
Category
Paper in Conference Proceedings or in Workshop Proceedings (Paper)
Event Title
42nd ACM SIGMETRICS
Divisions
Communication Technologies
Subjects
Informatik Allgemeines
Event Location
Antibes Juan-les-Pins, France
Event Type
Conference
Event Dates
June 2016
Date
2016
Export
Grafik Top