Flow Control with Max-Min Fairness and Path Constraints in Software-Defined Networks

被引：0

作者：

Peng, Wei ^{[1
]}

Li, Dongxing ^{[2
]}

Deng, Wenping ^{[2
]}

机构：

[1] Natl Univ Def Technol, Natl Lab Parallel & Distributed Proc, Changsha 410073, Hunan, Peoples R China

[2] Natl Univ Def Technol, Coll Comp, Changsha 410073, Hunan, Peoples R China

来源：

2018 IEEE INTERNATIONAL BLACK SEA CONFERENCE ON COMMUNICATIONS AND NETWORKING (BLACKSEACOM) | 2018年

基金：

中国国家自然科学基金;

关键词：

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

The emerging software-defined networks (SDNs) have made centralized flow control practical. In this paper, we study the flow control problem with consideration of path constraints and user flow requirements. Two problems are formulated according to path constraints, namely, the flow control with independent paths (FC-IDP) problem and the flow control with destination-rooted trees (FC-DRT) problem. It is shown that a flow rate allocation vector is weighted max-min fair if and only if each flow has a weighted bottleneck link. The optimality conditions are analyzed for the FC-IDP problem without fairness constraints. A weighted water filling algorithm is proposed for flow control with fairness constraints and predetermined flow paths. Without fairness constraints, evolutionary strategy is proposed to optimize the flow paths and flow rate allocation vectors. The algorithms are tested on random networks and it is shown that fairness constraints may have a great impact on flow control performance.

引用

页码：41 / 45

页数：5

共 10 条

[1]

Allalouf M, 2004, LECT NOTES COMPUT SC, V3266, P278

[2] Centralized and Distributed Algorithms for Routing and Weighted Max-Min Fair Bandwidth Allocation [J].

Allalouf, Miriam ;

Shavitt, Yuval .

IEEE-ACM TRANSACTIONS ON NETWORKING, 2008, 16 (05) :1015-1024

[3]

Amaldi Edoardo, 2014, Combinatorial Optimization. Third International Symposium, ISCO 2014. Revised Selected Papers. LNCS: 8596, P1, DOI 10.1007/978-3-319-09174-7_1

[4]

Amaldi E., 2013, Electronic Notes in Discrete Mathematics, V41, P543

[5] Evolution strategies – A comprehensive introduction [J].