Real time alpha-fairness based traffic engineering

McCormick, Bill; Kelly, F. P.; Plante, Patrice; Gunning, P.; Ashwood-Smith, Peter

doi:10.1145/2620728.2620762

Cited by 11 publications

(17 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The problem of Network Utility Maximization (NUM) was also addressed with standard decomposition methods that could give efficient and very simple algorithms based on gradient ascent schemes performing their update rules in parallel. In this context, Voice [38], then McCormick et al [25], tackle the α-fair resource allocation problem with a gradient descent applied to the dual of the problem.…”

Section: Related Workmentioning

confidence: 99%

“…Hence, domain m transmits in total ∑ n≠m P n ∩ P m floats to the set of its peers. As a comparison, in a distributed implementation of the standard dual algorithm given in [25], each domain m would transmit in total ∑ n≠m {j ∈ J m , ∃p ∈ P n s.t. j ∈ J p } floats to the set of its peers, which is bounded by (M − 1) J m as P grows.…”

Section: Update Rulesmentioning

confidence: 99%

“…Auto-Bandwidth successfully tackles goals ii) and iii), but not i), as it neither ensures fairness nor optimizes resources globally. Also, classic primal-dual algorithms have been proposed to solve the α-fair resource allocation problem in distributed SDN scenarios, as in [25]. However, primal-dual algorithms are known to fail at providing feasible solutions at any iteration step, thus they fail at achieving goal ii).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Multi-Path Alpha-Fair Resource Allocation at Scale in Distributed Software-Defined Networks

Allybokus

Avrachenkov

Leguay

et al. 2018

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

The performance of computer networks relies on how bandwidth is shared among different flows. Fair resource allocation is a challenging problem particularly when the flows evolve over time. To address this issue, bandwidth sharing techniques that quickly react to the traffic fluctuations are of interest, especially in large scale settings with hundreds of nodes and thousands of flows. In this context, we propose a distributed algorithm based on the Alternating Direction Method of Multipliers (ADMM) that tackles the multi-path fair resource allocation problem in a distributed SDN control architecture. Our ADMM-based algorithm continuously generates a sequence of resource allocation solutions converging to the fair allocation while always remaining feasible, a property that standard primal-dual decomposition methods often lack. Thanks to the distribution of all computer intensive operations, we demonstrate that we can handle large instances at scale.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Update Rulesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Multi-Path Alpha-Fair Resource Allocation at Scale in Distributed Software-Defined Networks

Allybokus

Avrachenkov

Leguay

et al. 2018

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

show abstract

“…For an alternative approach based on multipath dual rather than primal congestion control algorithms see [17].…”

Section: Simulation Of Fluid Modelsmentioning

confidence: 99%

Capacity bounds and robustness in multipath networks

Bejan¹,

Gibbens²,

Hancock³

et al. 2016

Proceedings of the 9th EAI International Conference on Performance Evaluation Methodologies and Tools

View full text Add to dashboard Cite

The recent developments of multipath data transport protocols such as Multipath TCP allow end-systems to explore and share available resources within networks. Through dynamic load balancing over subflows these protocols ensure high levels of robustness to network failures and traffic overloads. In this paper we use fluid models to study the benefits that accrue when load is shared across subflows. We combine insights gained from the fluid models with a precise description of the capacity region for the network and show that our models of multipath protocols approach the boundary of the capacity region as the intensity of the offered traffic approaches a critical value. We quantify the extent to which multipath protocols will make a network robust to unforeseen traffic mismatches and link failures and illustrate our results with parameterised models for random fluctuations in the offered traffic.

show abstract

“…SDN has been recently used by McCormick et al [210] to provide real-time alpha-fairness based traffic engineering. The proposed algorithm executes in the range of milliseconds and can be used as an online tool.…”

Section: ) Multipathing In Information-centric Networkmentioning

confidence: 99%

Exploiting the Power of Multiplicity: A Holistic Survey of Network-Layer Multipath

Qadir

Ali

Yau

et al. 2015

IEEE Commun. Surv. Tutorials

View full text Add to dashboard Cite

Abstract-The Internet is inherently a multipath network-for an underlying network with only a single path connecting various nodes would have been debilitatingly fragile. Unfortunately, traditional Internet technologies have been designed around the restrictive assumption of a single working path between a source and a destination. The lack of native multipath support constrains network performance even as the underlying network is richly connected and has redundant multiple paths. Computer networks can exploit the power of multiplicity-through which a diverse collection of paths is resource pooled as a single resource-to unlock the inherent redundancy of the Internet. This opens up a new vista of opportunities promising increased throughput (through concurrent usage of multiple paths) and increased reliability and fault-tolerance (through the use of multiple paths in backup/ redundant arrangements). There are many emerging trends in networking that signify that the Internet's future will be unmistakably multipath, including the use of multipath technology in datacenter computing; multi-interface, multi-channel, and multi-antenna trends in wireless; ubiquity of mobile devices that are multi-homed with heterogeneous access networks; and the development and standardization of multipath transport protocols such as MP-TCP.The aim of this paper is to provide a comprehensive survey of the literature on network-layer multipath solutions. We will present a detailed investigation of two important design issues, namely the control plane problem of how to compute and select the routes, and the data plane problem of how to split the flow on the computed paths. The main contribution of this paper is a systematic articulation of the main design issues in network-layer multipath routing along with a broad-ranging survey of the vast literature on network-layer multipathing. We also highlight open issues and identify directions for future work.

show abstract

Real time alpha-fairness based traffic engineering

Cited by 11 publications

References 2 publications

Multi-Path Alpha-Fair Resource Allocation at Scale in Distributed Software-Defined Networks

Multi-Path Alpha-Fair Resource Allocation at Scale in Distributed Software-Defined Networks

Capacity bounds and robustness in multipath networks

Exploiting the Power of Multiplicity: A Holistic Survey of Network-Layer Multipath

Contact Info

Product

Resources

About