Dynamic scheduling of network updates

126Citations
Citations of this article
145Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present Dionysus, a system for fast, consistent network updates in software-defined networks. Dionysus encodes as a graph the consistency-related dependencies among updates at individual switches, and it then dynamically schedules these updates based on runtime differences in the update speeds of different switches. This dynamic scheduling is the key to its speed; prior update methods are slow because they pre-determine a schedule, which does not adapt to runtime conditions. Testbed experiments and data-driven simulations show that Dionysus improves the median update speed by 53-88% in both wide area and data center networks compared to prior methods.

Cite

CITATION STYLE

APA

Jin, X., Liu, H. H., Gandhi, R., Kandula, S., Mahajan, R., Zhang, M., … Wattenhofer, R. (2015). Dynamic scheduling of network updates. In Computer Communication Review (Vol. 44, pp. 539–550). Association for Computing Machinery. https://doi.org/10.1145/2619239.2626307

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free