一种基于公平动态内容存储的命名数据网络拥塞控制策略

IF 3.2 Q2 AUTOMATION & CONTROL SYSTEMS
Yan-Hong Liu, Fengling Huang, Hua Yang
{"title":"一种基于公平动态内容存储的命名数据网络拥塞控制策略","authors":"Yan-Hong Liu, Fengling Huang, Hua Yang","doi":"10.1080/21642583.2022.2031335","DOIUrl":null,"url":null,"abstract":"In this paper, the congestion control for named data networking (NDN) is studied. A novel dynamic content store-based congestion control strategy is proposed on account of the characteristic of in-network cache in NDN. A queuing network model is constructed to judge whether congestion occurs. If the network has the tendency of congestion or the congestion happened, the buffer of the output queue is dynamically expanded by borrowing NDN content store (CS), and the forwarding rates of data packets and corresponding interest packets are reduced so as to prevent or alleviate network congestion. In order to reflect fairness, the CS to be borrowed by the data output queue in the port is calculated in terms of the data output queue length and its weight. The simulation results based on ndnSIM show that the given scheme improves the bottleneck link utilization and maintains a low packet loss rate and average flow completion time.","PeriodicalId":46282,"journal":{"name":"Systems Science & Control Engineering","volume":null,"pages":null},"PeriodicalIF":3.2000,"publicationDate":"2022-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A fair dynamic content store-based congestion control strategy for named data networking\",\"authors\":\"Yan-Hong Liu, Fengling Huang, Hua Yang\",\"doi\":\"10.1080/21642583.2022.2031335\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, the congestion control for named data networking (NDN) is studied. A novel dynamic content store-based congestion control strategy is proposed on account of the characteristic of in-network cache in NDN. A queuing network model is constructed to judge whether congestion occurs. If the network has the tendency of congestion or the congestion happened, the buffer of the output queue is dynamically expanded by borrowing NDN content store (CS), and the forwarding rates of data packets and corresponding interest packets are reduced so as to prevent or alleviate network congestion. In order to reflect fairness, the CS to be borrowed by the data output queue in the port is calculated in terms of the data output queue length and its weight. The simulation results based on ndnSIM show that the given scheme improves the bottleneck link utilization and maintains a low packet loss rate and average flow completion time.\",\"PeriodicalId\":46282,\"journal\":{\"name\":\"Systems Science & Control Engineering\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":3.2000,\"publicationDate\":\"2022-02-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Systems Science & Control Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/21642583.2022.2031335\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Systems Science & Control Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/21642583.2022.2031335","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 5

摘要

本文研究了命名数据网络(NDN)的拥塞控制问题。针对NDN网络中网内缓存的特点,提出了一种基于动态内容存储的拥塞控制策略。构造了一个排队网络模型来判断是否发生拥塞。当网络有拥塞趋势或拥塞发生时,通过借用NDN内容存储(content store, CS)动态扩展输出队列的缓冲区,降低数据包和相应兴趣包的转发速率,从而防止或缓解网络拥塞。为了体现公平性,根据数据输出队列的长度及其权重计算端口内数据输出队列所要借用的CS。基于nnsim的仿真结果表明,该方案提高了瓶颈链路利用率,保持了较低的丢包率和平均流完成时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A fair dynamic content store-based congestion control strategy for named data networking
In this paper, the congestion control for named data networking (NDN) is studied. A novel dynamic content store-based congestion control strategy is proposed on account of the characteristic of in-network cache in NDN. A queuing network model is constructed to judge whether congestion occurs. If the network has the tendency of congestion or the congestion happened, the buffer of the output queue is dynamically expanded by borrowing NDN content store (CS), and the forwarding rates of data packets and corresponding interest packets are reduced so as to prevent or alleviate network congestion. In order to reflect fairness, the CS to be borrowed by the data output queue in the port is calculated in terms of the data output queue length and its weight. The simulation results based on ndnSIM show that the given scheme improves the bottleneck link utilization and maintains a low packet loss rate and average flow completion time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Systems Science & Control Engineering
Systems Science & Control Engineering AUTOMATION & CONTROL SYSTEMS-
CiteScore
9.50
自引率
2.40%
发文量
70
审稿时长
29 weeks
期刊介绍: Systems Science & Control Engineering is a world-leading fully open access journal covering all areas of theoretical and applied systems science and control engineering. The journal encourages the submission of original articles, reviews and short communications in areas including, but not limited to: · artificial intelligence · complex systems · complex networks · control theory · control applications · cybernetics · dynamical systems theory · operations research · systems biology · systems dynamics · systems ecology · systems engineering · systems psychology · systems theory
×
引用
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学术官方微信