通过增强拓扑的神经进化生成TCP拥塞控制

Kay Luis Wallaschek, Robin Klose, Lars Almon, M. Hollick
{"title":"通过增强拓扑的神经进化生成TCP拥塞控制","authors":"Kay Luis Wallaschek, Robin Klose, Lars Almon, M. Hollick","doi":"10.1109/ICCWorkshops49005.2020.9145446","DOIUrl":null,"url":null,"abstract":"We present NEAT-TCP, a novel technique to automatically generate congestion control algorithms in a data-driven fashion while optimizing towards a specified global system utility. NEAT-TCP employs an artificial neural network (ANN) in each node and generates a population of ANNs by means of an evolutionary algorithm called NEAT. The ANNs run independently from each other at the communication endpoints and take only features as inputs that are locally available at these nodes. We define the system utility as a combined maximization of overall throughput and throughput fairness between flows according to Jain's fairness index. The nodes are deployed in a grid topology in ns-3 simulations, which makes it particularly difficult to maximize the utility due to different interference levels for the data flows. In our experiments, NEAT-TCP achieves 69% more fairness, 66% less mean end-to-end delay and 71% less packet loss in relation to TCP New Reno at the cost of 19% less overall throughput, which meets our multi-criteria objective.","PeriodicalId":254869,"journal":{"name":"2020 IEEE International Conference on Communications Workshops (ICC Workshops)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"NEAT-TCP: Generation of TCP Congestion Control through Neuroevolution of Augmenting Topologies\",\"authors\":\"Kay Luis Wallaschek, Robin Klose, Lars Almon, M. Hollick\",\"doi\":\"10.1109/ICCWorkshops49005.2020.9145446\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present NEAT-TCP, a novel technique to automatically generate congestion control algorithms in a data-driven fashion while optimizing towards a specified global system utility. NEAT-TCP employs an artificial neural network (ANN) in each node and generates a population of ANNs by means of an evolutionary algorithm called NEAT. The ANNs run independently from each other at the communication endpoints and take only features as inputs that are locally available at these nodes. We define the system utility as a combined maximization of overall throughput and throughput fairness between flows according to Jain's fairness index. The nodes are deployed in a grid topology in ns-3 simulations, which makes it particularly difficult to maximize the utility due to different interference levels for the data flows. In our experiments, NEAT-TCP achieves 69% more fairness, 66% less mean end-to-end delay and 71% less packet loss in relation to TCP New Reno at the cost of 19% less overall throughput, which meets our multi-criteria objective.\",\"PeriodicalId\":254869,\"journal\":{\"name\":\"2020 IEEE International Conference on Communications Workshops (ICC Workshops)\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE International Conference on Communications Workshops (ICC Workshops)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCWorkshops49005.2020.9145446\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE International Conference on Communications Workshops (ICC Workshops)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCWorkshops49005.2020.9145446","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

我们提出了NEAT-TCP,一种以数据驱动的方式自动生成拥塞控制算法的新技术,同时优化到指定的全局系统实用程序。net - tcp在每个节点上使用一个人工神经网络(ANN),并通过一种称为NEAT的进化算法生成一群人工神经网络。人工神经网络在通信端点上彼此独立运行,并且仅将这些节点上本地可用的特征作为输入。根据Jain公平性指数,我们将系统效用定义为流量之间的总吞吐量和吞吐量公平性的组合最大化。在ns-3模拟中,节点部署在网格拓扑结构中,由于数据流的不同干扰水平,使得最大化效用变得特别困难。在我们的实验中,与TCP New Reno相比,NEAT-TCP实现了69%的公平性,66%的平均端到端延迟和71%的数据包丢失,而总体吞吐量降低了19%,满足了我们的多标准目标。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
NEAT-TCP: Generation of TCP Congestion Control through Neuroevolution of Augmenting Topologies
We present NEAT-TCP, a novel technique to automatically generate congestion control algorithms in a data-driven fashion while optimizing towards a specified global system utility. NEAT-TCP employs an artificial neural network (ANN) in each node and generates a population of ANNs by means of an evolutionary algorithm called NEAT. The ANNs run independently from each other at the communication endpoints and take only features as inputs that are locally available at these nodes. We define the system utility as a combined maximization of overall throughput and throughput fairness between flows according to Jain's fairness index. The nodes are deployed in a grid topology in ns-3 simulations, which makes it particularly difficult to maximize the utility due to different interference levels for the data flows. In our experiments, NEAT-TCP achieves 69% more fairness, 66% less mean end-to-end delay and 71% less packet loss in relation to TCP New Reno at the cost of 19% less overall throughput, which meets our multi-criteria objective.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信