To refer to this page use:
|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.|
|Citation:||Jin, Xin, Hongqiang Harry Liu, Rohan Gandhi, Srikanth Kandula, Ratul Mahajan, Ming Zhang, Jennifer Rexford, and Roger Wattenhofer. "Dynamic scheduling of network updates." In Proceedings of the 2014 ACM conference on SIGCOMM (2014): pp. 539-550. doi:10.1145/2619239.2626307|
|Pages:||539 - 550|
|Type of Material:||Conference Article|
|Journal/Proceeding Title:||Proceedings of the 2014 ACM conference on SIGCOMM|
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.