软件定义网络中具有最大最小公平性和路径约束的流量控制

Wei Peng, Dongxing Li, Wenping Deng
{"title":"软件定义网络中具有最大最小公平性和路径约束的流量控制","authors":"Wei Peng, Dongxing Li, Wenping Deng","doi":"10.1109/BlackSeaCom.2018.8433700","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":351647,"journal":{"name":"2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Flow Control with Max-Min Fairness and Path Constraints in Software-Defined Networks\",\"authors\":\"Wei Peng, Dongxing Li, Wenping Deng\",\"doi\":\"10.1109/BlackSeaCom.2018.8433700\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":351647,\"journal\":{\"name\":\"2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BlackSeaCom.2018.8433700\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BlackSeaCom.2018.8433700","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

新兴的软件定义网络(sdn)使集中流量控制成为可能。本文研究了考虑路径约束和用户流需求的流量控制问题。根据路径约束提出了两个问题,即独立路径流控制问题(FC-IDP)和目标根树流控制问题(FC-DRT)。证明了当且仅当每个流都有一个加权瓶颈链路时,流量分配向量是加权最大最小公平的。分析了不考虑公平性约束的FC-IDP问题的最优性条件。提出了一种具有公平性约束和预定流路的加权充水算法。在不考虑公平性约束的情况下,提出了优化流路和流量分配向量的进化策略。在随机网络上对算法进行了测试,结果表明公平性约束对流量控制性能有很大影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Flow Control with Max-Min Fairness and Path Constraints in Software-Defined Networks
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信