Automatic Synthesis of Transiently Correct Network Updates via Petri Games

Didriksen, Martin; Jensen, Peter Gjøl; Jonler, Jonathan Fjord; Katona, Andrei-Ioan; Lama, Sangey D. L.; Lottrup, Frederik B.; Shajarat, Shahab; Srba, Jǐŕı

doi:10.1007/978-3-030-76983-3_7

Cited by 7 publications

(1 citation statement)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When there are multiple routes with different policies, it may further be important to minimize the number of interactions with an individual router [10]. Recently, a few papers have focused on the synthesis of update schedules [9,25,39,46,47], however, in this paper, we are interested in the natural and well-studied objective of minimizing the number of rounds. Ludwig et al [13,35] showed that finding a schedule that provides loop freedom in 3 rounds is NP-hard, and there is always a pair of flows that requires Θ(𝑛) rounds.…”

Section: Additional Related Workmentioning

confidence: 99%

The Augmentation-Speed Tradeoff for Consistent Network Updates

Henzinger,

Paz,

Pourdamghani

et al. 2022

Preprint

View full text Add to dashboard Cite

Emerging software-defined networking technologies enable more adaptive communication infrastructures, allowing for quick reactions to changes in networking requirements by exploiting the workload's temporal structure. However, operating networks adaptively is algorithmically challenging, as meeting networks' stringent dependability requirements relies on maintaining basic consistency and performance properties, such as loop freedom and congestion minimization, even during the update process. This paper leverages an augmentation-speed tradeoff to significantly speed up consistent network updates. We show that allowing for a small and short (hence practically tolerable, e.g., using buffering) oversubscription of links allows us to solve many network update instances much faster, as well as to reduce computational complexities (i.e., the running times of the algorithms). We first explore this tradeoff formally, revealing the computational complexity of scheduling updates. We then present and analyze algorithms that maintain logical and performance properties during the update. Using an extensive simulation study, we find that the tradeoff is even more favorable in practice than our analytical bounds suggest. In particular, we find that by allowing just 10% augmentation, update times reduce by more than 32% on average, across a spectrum of real-world networks.

show abstract