Inferring link weights using end-to-end measurements
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
The case for separating routing from routers
Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture
A clean slate 4D approach to network control and management
ACM SIGCOMM Computer Communication Review
Design and implementation of a routing control platform
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Ethane: taking control of the enterprise
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Abstractions for network update
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Lossless migrations of link-state IGPs
IEEE/ACM Transactions on Networking (TON)
Achieving high utilization with software-driven WAN
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
B4: experience with a globally-deployed software defined wan
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
Incremental consistent updates
Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking
Hi-index | 0.00 |
We argue for the development of efficient methods to update the data plane state of an SDN, while maintaining desired consistency properties (e.g., no packet should be dropped). We highlight the inherent trade-off between the strength of the consistency property and dependencies it imposes among rules at different switches; these dependencies fundamentally limit how quickly data plane can be updated. For one basic consistency property---no packet should loop---we develop an update algorithm that has provably minimal dependency structure. We also sketch a general architecture for consistent updates that separates the twin concerns of consistency and efficiency.