Fast lossless traffic migration for SDN updates

Luo, Long; Yu, Hongfang; Luo, Shouxi; Zhang, Mingui

doi:10.1109/icc.2015.7249247

Cited by 17 publications

(18 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this case, each link is assumed to have the capacity of 10 Mbps and delay of 200 ms. We consider the case of WAN optimization, where ingress switches split the traffic to a destination among its 4-shortest paths to pursue load balancing. Because of lacking real traffic matrices, we assume that all the possible paths of a sourcedestination share the equal weight initially, and use gravity model [4] to synthesize the current traffic demands, which make the maximum link load be 99% in the old configuration. Then, the update scenario is to reconfigure traffic split weights to the new one that reduces the maximum link load to the minimized value, 78%.…”

Section: Cup Flexibilitymentioning

confidence: 99%

“…Furthermore, the intermediate configurations they introduce will greatly complicate the update process, and might even disturb user's QoS-e.g., an intermediate path might have a larger latency than both the initial and target ones. In contrast, Dionysus [3] and ATOMIP [4] address the challenges by scheduling updates in thoughtful orders without bringing in additional stages. For instance, by executing the update illustrated in Fig.…”

Section: Introductionmentioning

confidence: 98%

“…First of all, the planner must be able to find feasible congestion-free solutions for any given task. On one hand, in some update scenarios, there does not exist a congestion-free sequence [3,4]. For instance, in the case of Fig.…”

Section: Introductionmentioning

confidence: 99%

“…It is difficult to synchronize the changes to flows from different ingress switches. Therefore, when migrating a group of flows to their new paths, even if the network is safe both before and after the reconfiguration, some "hot" links could be overloaded during the update process in case new flows move in before those old ones move out [2]- [4].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Arrange your network updates as you wish

Luo

et al. 2016

2016 IFIP Networking Conference (IFIP Networking) and Workshops

Self Cite

View full text Add to dashboard Cite

Updating network configurations responding to dynamic changes is still a tricky task in SDN. During the update process, in-flight packets might misuse different versions of rules, and "hot" links could be overloaded due to the unplanned update order. As for the problem of misusing rule, recently proposed suggestions like two-phase mechanism and Customizable Consistency Generator (CCG) have provided generic and customizable solutions. Yet, there does not exist an approach that is flexible to avoid the transient congestion on hot links respecting to diverse user requirements like guaranteeing update deadline, managing transient throughput loss, etc.; controllers urgently need one.In this paper, we propose CUP, Customizable Update Planner, to seek the solution. Different from prior approaches that adopt fixed designs for a single purpose like optimizing the update speed (e.g., Dionysus) or avoiding congestions (e.g., zUpdate, SWAN), CUP introduces generic linear programming models to formulate user-specified requirements and the update planning problem. By solving these customized models, CUP is able to plan network updates according to a large fraction of user requirements, such as guaranteeing deadlines, prioritizing operation orders, managing throughput loss, etc., while avoiding transient congestion. We prototype CUP on Ryu and employ it to arrange updates for networks built upon Mininet. Results confirm the flexibility of CUP while indicating that it always obtains the "best" update plans following the user's wish.

show abstract

Section: Cup Flexibilitymentioning

confidence: 99%

Section: Introductionmentioning

confidence: 98%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Arrange your network updates as you wish

Luo

et al. 2016

2016 IFIP Networking Conference (IFIP Networking) and Workshops

Self Cite

View full text Add to dashboard Cite

show abstract

“…Several works have been inspired by the 2-Phase technique presented in [52]. One first line of research focuses on providing additional guarantees, e.g., congestion-freedom (from [53] to [54], [55], [56], [57], [58], [59], [60]). In a second line of research, several algorithms [32], [61], [62], [63], [64] to compute a set of ordered rule replacements have been proposed to deal with specific SDN update cases (e.g., where only forwarding consistency is needed), avoiding the need for additional rules and hence enabling more resource-efficient approaches (e.g., TCAM memory slots are expensive and precious).…”

Section: Sdn Controllermentioning

confidence: 99%

Survey of Consistent Software-Defined Network Updates

Foerster

Schmid

Vissicchio

2019

IEEE Commun. Surv. Tutorials

117

View full text Add to dashboard Cite

Computer networks have become a critical infrastructure. In fact, networks should not only meet strict requirements in terms of correctness, availability, and performance, but they should also be very flexible and support fast updates, e.g., due to policy changes, increasing traffic, or failures. This paper presents a structured survey of mechanism and protocols to update computer networks in a fast and consistent manner. In particular, we identify and discuss the different desirable consistency properties that should be provided throughout a network update, the algorithmic techniques which are needed to meet these consistency properties, and the implications on the speed and costs at which updates can be performed. We also explain the relationship between consistent network update problems and classic algorithmic optimization ones. While our survey is mainly motivated by the advent of Software-Defined Networks (SDNs) and their primary need for correct and efficient update techniques, the fundamental underlying problems are not new, and we provide a historical perspective of the subject as well.

show abstract

Simplifying Flow Updates in Software-Defined Networks Using Atoman

Luo

Wang

et al. 2019

IEEE Access

Self Cite

View full text Add to dashboard Cite

Flow updates are common in today's networks, and software-defined networking (SDN) enables network operators to reconfigure switches for updating flows easily. However, the implementation of flow updates requires to meet many different expectations regarding consistency, resource constraints, and performance. To carry updates out as intended, network operators often need to spend significant effort in update management, developing complex network optimizations and customized heuristics on a case-bycase basis. In this paper, we strive to simplify the flow updates in SDN networks. To this end, we present Atoman, a framework that uses high-level abstractions to capture various update intents and formulates flow updates problems as segment-based update scheduling optimizations to obtain satisfied update solutions. The captured update intents are translated into constraints and objectives of update scheduling optimizations. By extracting critical updating flows and employing decomposition techniques, Atoman can efficiently reduce the scale of problems in each solving and generate near-optimal update solutions. We conduct extensive simulations to evaluate Atoman and the simulation results show that Atoman significantly saves operator efforts in managing flow updates and provides comparable or better efficiency than prior customized solutions. INDEX TERMS Software-defined Networks, flow updates, intents.

show abstract

Fast lossless traffic migration for SDN updates

Cited by 17 publications

References 11 publications

Arrange your network updates as you wish

Arrange your network updates as you wish

Survey of Consistent Software-Defined Network Updates

Simplifying Flow Updates in Software-Defined Networks Using Atoman

Contact Info

Product

Resources

About