Update Algebra: Toward Continuous, Non-Blocking Composition of Network Updates in SDN

Li, Geng; Yang, Yufan; Le, Franck; Lim, Yong Beom; Wang, Junqi

doi:10.1109/infocom.2019.8737618

Cited by 19 publications

(9 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To the best of our knowledge, Li et al [28] firstly studied the continuous update problem. The authors built the theoretical framework for continuous update events based on abstract algebra and executed updates based on the operation projection.…”

Section: Related Workmentioning

confidence: 99%

“…The authors built the theoretical framework for continuous update events based on abstract algebra and executed updates based on the operation projection. Although "Update Algebra" [28] can generate the blackholefree and loop-free update order, it cannot guarantee the congestion-free condition, leading to packet loss and network performance degradation. On this basis, we proposed Coeus, which is the first work to handle the continuous update events with blackhole-free, loop-free, and congestion-free properties guaranteed simultaneously.…”

Section: Related Workmentioning

confidence: 99%

“…Coeus mainly focuses on traffic management applications for the network core (e.g., B4 [1], SWAN [33]). Similar to [20], [27], [28], Coeus assumes that each forwarding rule in the switch matches at most one flow, making Coeus unsuitable for wild-card rules or the longest prefix matching. We make this assumption since a loop-free update order does not exist in networks that use wild-card rules or the longest prefix matching [19].…”

Section: Coeus Overviewmentioning

confidence: 99%

“…Each update event cannot be responded to until the previous update events are completed, leading to prolonged update time and poor network performance. Instead of the single update, the current work, "Update Algebra" [28], explores the solution that can execute the continuously arriving update events in parallel. Specifically, "Update Algebra" models update operations in update events as a set of projections and selects a feasible subset of projections to execute.…”

Section: Introductionmentioning

confidence: 99%

“…In this paper, we initiate the study of the continuous update with consistency guaranteed, i.e., handling the continuously arriving update events in time and ensuring consistency. To achieve this goal, we face three main challenges: (1) The update operations in continuously arriving update events that act on the same flow may be redundant [28], [29]. For example, one update operation requires modifying a flow forwarding rule.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Continuous Network Update With Consistency Guaranteed in Software-Defined Networks

Zheng

Dai

et al. 2022

IEEE/ACM Trans. Networking

Self Cite

View full text Add to dashboard Cite

Network update enables Software-Defined Networks (SDNs) to optimize the data plane performance. The single update focuses on processing one update event at a time, i.e., updating a set of flows from their initial routes to target routes, but it fails to handle continuously arriving update events in time incurred by high-frequency network changes. On the contrary, the continuous update proposed in "Update Algebra" can handle multiple update events concurrently and respond to the network condition changes at all times. However, "Update Algebra" only guarantees the blackhole-free and loop-free update. The congestion-free property cannot be respected. In this paper, we propose Coeus to achieve the continuous update while maintaining consistency, i.e., ensuring the blackhole-free, loop-free, and congestion-free properties simultaneously. Firstly, we establish the continuous update model based on the update operations in update events. With the update model, we dynamically reconstruct the operation dependency graph (ODG) to capture the relationship between update operations and link utilization variations. Then, we develop a composition algorithm to eliminate redundant operations in update events. To further speed up the update procedure, we present a partition algorithm to split the operation nodes of the ODG into a series of suboperation nodes that can be executed independently. The partition algorithm is proven to be optimal. Finally, extensive evaluations show that Coeus can improve the update speed by at least 179% and reduce redundant operations by at least 52% compared with state-of-the-art approaches when the arrival rate of update events equals three times per second.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%