期刊文献+

命名数据网络中的一种主动拥塞控制策略 被引量:3

Active congestion control strategy in named data networking
下载PDF
导出
摘要 为解决命名数据网络(Named Data Networking,NDN)中的拥塞控制问题,在加权公平排队(Weighted Fair Queuing,WFQ)算法的基础上,提出了基于即时调整兴趣包发送速率的名字加权公平排队(Name Weighted Fair Queuing,NWFQ)算法。当网络拥塞时,利用基于令牌桶算法的速率限制机制对超速流进行降速惩罚,同时更新兴趣包中的拥塞信息域并将其逐跳反馈给下游路由器;利用数据包将拥塞信息反馈给请求端,请求端据此调整兴趣包的发送速率,从而解决网络拥塞。基于ndn SIM的仿真结果表明,该算法能有效提升瓶颈链路利用率并接近95%,同时保证较低的丢包率和平均流完成时间。 This paper proposes a Name Weighted Fair Queuing(NWFQ)algorithm on the basis of the Weighted Fair Queuing(WFQ)algorithm,NWFQ timely changing the sending rate of interest packets to solve the congestion control problem in Named Data Networking(NDN).Firstly,when congestion occurs,the speed limit mechanism based on token bucket algorithm is used to reduce the forwarding rate of the overspeed flow.At the same time,the congestion information field in the interest package is updated and then hop by hop sended to the downstream router;finally,data packets encapsulate the congestion information and return to the consumer,by this way,consumer can adjust the interest sending rate and the data rate accordingly to mitigate network congestion.Simulation results based on ndnSIM show that:NWFQ can effectively improve the bottleneck link utilization and close to 95%,while maintaining a low packet loss rate and average flow completion time.
作者 王文静 雒江涛 WANG Wenjing;LUO Jiangtao(Electronic Information and Network Engineering Research Institute,Chongqing University of Posts and Telecommunications,Chongqing 400065,China;School of Communication and Information Engineering,Chongqing University of Posts and Telecommunications,Chongqing 400065,China)
出处 《计算机工程与应用》 CSCD 北大核心 2018年第10期115-120,共6页 Computer Engineering and Applications
基金 重庆市基础科学与前沿技术研究重点项目(No.cstc2015jcyj BX0009)
关键词 命名数据网络 拥塞控制 名字加权公平排队算法 惩罚函数 显式反馈 named data networking congestion control name weighted fair queuing algorithm penalty function explicit feedback
  • 相关文献

参考文献3

二级参考文献25

  • 1Jacobson V, Smetters D K, Thornton J D, et al. Networking Named Content [C]//Proceedings of the 5th International Conference on Emerging Networking Experiments and Technologies. New York: ACM, 2009: 1-12.
  • 2Ahlgren B, Dannewitz C, Imbrenda C, et al. A Survey of Information-centric Networking [J]. IEEE Communications Magazine, 2012, 50(7) : 26-36.
  • 3Podlipnig S, B6sz6rmenyi L. A Survey of Web Cache Replacement Strategies[J]. ACM Computing Surveys, 2003, 35 (4) : 374-398.
  • 4Chai W K, He D, Psaras I, et al. Cache "Less for More" in Inforrnation-centric Networks (Extended Version) [J]. Computer Communications, 2013, 36(7): 758-770.
  • 5Cho K, Lee M, Park K, et al. WAVE: Popularity-based and Collaborative In-network Caching for Content-oriented Networks [C]//Conference on Computer Communications Workshops. Piscataway: IEEE, 2012: 316-321.
  • 6Psaras I, Chai W K, Pavlou G. Probabilistic In-network Caching for Information-centric Networks [C]//Proceedings of the Second Edition of the ICN Workshop on Information-centric Networking. New York: ACM, 2012: 55-60.
  • 7Zhang G, Li Y, Lin T. Caching in Information Centric Networking: a Survey [J]. Computer Networks, 2013, 57(16) : 3128-3141.
  • 8Li J, Liu B, Wu H. Energy-efficient In-network Caching for Content-centric Networking [J]. IEEE Communications Letters, 2013, 17(4): 797-800.
  • 9Carofiglio G, Gallo M, Muscariello L. On the Performance of Bandwidth and Storage Sharing in Information-centric Networks[J]. Computer Networks, 2013, 57(17): 3743-3758.
  • 10Wang J M, Zhang J, Bensaou B. Intra-AS Cooperative Caching for Content-centric Networks [C]//Proceedings o:f the 3rd ACM SIGCOMM Workshop on Information-centric Networking. New York: ACM, 2013: 61-66.

共引文献87

同被引文献40

引证文献3

二级引证文献21

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部