Achieving high utilization with software-driven WAN

Hong, Chuang‐Ye; Kandula, Srikanth; Mahajan, Ratul; Zhang, Ming; Gill, Vijay; Nanduri, Mohan; Wattenhofer, Roger

doi:10.1145/2486001.2486012

Cited by 791 publications

(551 citation statements)

References 27 publications

Supporting

Mentioning

547

Contrasting

Unclassified

Order By: Relevance

“…Large service providers, including Microsoft [1] and Google [2], have deployed SDN in production environments, thus increasing the efficiency of their network. However, the frequency of reconfigurations that these organisations perform is as low as once every 5 minutes [1], and not all data flows are rerouted during these optimisations because doing so could severely hurt the performance.…”

Section: Introductionmentioning

confidence: 99%

Evaluating the impact of SDN-induced frequent route changes on TCP flows

Carpa

Assunção

Glück

et al. 2017

2017 13th International Conference on Network and Service Management (CNSM)

View full text Add to dashboard Cite

Abstract-Traffic engineering technologies such as MPLS have been proposed to adjust the paths of data flows according to network availability. Although the time interval between traffic optimisations is often on the scale of hours or minutes, modern SDN techniques enable reconfiguring the network more frequently. It is argued, however, that changing the paths of TCP flows too often could severely impact their performance by incurring packet loss and reordering. This work analyses and evaluates the impact of frequent route changes on the performance of TCP flows. Experiments carried out on a network testbed show that rerouting a flow can affect its throughput when reassigning it a path either longer or shorter than the original path. Packet reordering has a negligible impact when compared to the increase of RTT. Moreover, constant rerouting influences the performance of the congestion control algorithm. Designed to assess the limits on SDN-induced reconfiguration, a scenario where the traffic is rerouted every 0.1s demonstrates that the throughput can be as low as 35% of that achieved without rerouting.

show abstract

Section: Introductionmentioning

confidence: 99%

Evaluating the impact of SDN-induced frequent route changes on TCP flows

Carpa

Assunção

Glück

et al. 2017

2017 13th International Conference on Network and Service Management (CNSM)

View full text Add to dashboard Cite

show abstract

“…by modifying sets of forwarding rules installed on switches. SDN programs can implement a wide range of advanced network functionality including fine-grained access control [8], network virtualization [22], traffic engineering [15,16], and many others.…”

Section: Introductionmentioning

confidence: 99%

Event-driven network programming

et al. 2016

View full text Add to dashboard Cite

Software-defined networking (SDN) programs must simultaneously describe static forwarding behavior and dynamic updates in response to events. Event-driven updates are critical to get right, but difficult to implement correctly due to the high degree of concurrency in networks. Existing SDN platforms offer weak guarantees that can break application invariants, leading to problems such as dropped packets, degraded performance, security violations, etc. This paper introduces event-driven consistent updates that are guaranteed to preserve well-defined behaviors when transitioning between configurations in response to events. We propose network event structures (NESs) to model constraints on updates, such as which events can be enabled simultaneously and causal dependencies between events. We define an extension of the NetKAT language with mutable state, give semantics to stateful programs using NESs, and discuss provably-correct strategies for implementing NESs in SDNs. Finally, we evaluate our approach empirically, demonstrating that it gives well-defined consistency guarantees while avoiding expensive synchronization and packet buffering.

show abstract

“…The emerging software-defined net working (SDN) technique has recently been used for inter-DC traffic management [1], [3], to conquer the above mentioned inefficiencies of traditional approaches. Fig.…”

Section: Introductionmentioning

confidence: 99%

“…1) involve multiple distributed switches and need to be done in a consistent and congestion-free manner. This challenging problem has been well studied in [3]- [6] and feasible solutions have been proposed therein. Thus, what remains to achieve in this area to bring such SDN based solution to fruition is to design fast and accurate approximations that enable the deployment of periodic traffic engineering in inter-DC networks.…”

Section: Introductionmentioning

confidence: 99%

“…To this end, we use utility functions with different weights to reflect priorities of traffic classes in allocating bandwidth. This differs from SWAN [3] where bandwidth allocation is done step-by-step in a strict priority order, i.e., allocating bandwidth to traffic class with the highest priority first. Furthermore, to enable intra class fairness, the concave log utility function in MCTEQ enforces the proportional fairness principle among applications within the same traffic class.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

SDN-based multi-class QoS-guaranteed inter-data center traffic management

Wang

Dai

et al. 2014

2014 IEEE 3rd International Conference on Cloud Networking (CloudNet)

View full text Add to dashboard Cite

When allocating network bandwidth to multiple classes of applications in inter-data center communication, coordi nation always yields a better utilization of the backbone network. Yet, it often comes at a prohibitively heavy computational and communication cost, making it thus far not a practically viable approach. SDN helped in bridging the communication cost gap by enabling centralized control, and SDN has been recently applied in such inter-DC traffic management. However, the computational cost is still an issue as the efficient and fast response of the centralized traffic engineering algorithm has become crucial to the practicality of such SDN-based approach. In this paper, we present MCTEQ, a utility-optimization-based joint-bandwidth al location for inter-DC communication with multiple traffic classes, that handles priorities between traffic classes in a soft manner and explicitly considers the delay requirement of Interactive flows.MCTEQ being NP-hard, we apply approximation techniques to lean on the mature and efficient LP solver and obtain fast and accurate approximations. We demonstrate via experiments with Google's inter-DC backbone topology that MCTEQ achieves about 160 Gbps higher network utilization than the existing SWAN solution, yet runs 2.5 times faster. In particular, MCTEQ guarantees that the allocated bandwidth for Interactive flows strictly meets their end-to-end delay requirements.

show abstract

Achieving high utilization with software-driven WAN

Cited by 791 publications

References 27 publications

Evaluating the impact of SDN-induced frequent route changes on TCP flows

Evaluating the impact of SDN-induced frequent route changes on TCP flows

Event-driven network programming

SDN-based multi-class QoS-guaranteed inter-data center traffic management

Contact Info

Product

Resources

About