...
首页> 外文期刊>Computer communication review >An Improved Hop-by-hop Interest Shaper for Congestion Control in Named Data Networking
【24h】

An Improved Hop-by-hop Interest Shaper for Congestion Control in Named Data Networking

机译:一种改进的逐跳兴趣整形器,用于命名数据​​网络中的拥塞控制

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

Hop-by-hop interest shaping has been proposed as a viable congestion control mechanism in Named Data Networking (NDN). Interest shaping exploits the strict receiver-driven traffic pattern and the symmetric bidirectional forwarding in NDN to control the returning data rate. In this paper, we point out that both interests and contents contribute to congestion and their interdependence must be considered in any interest shaping algorithm. We first analyze this issue mathematically by formulating it as an optimization problem to obtain the optimal shaping rate. Then a practical interest shaping algorithm is proposed to achieve high link utilization without congestive data loss. We further note that flow differentiation in NDN is complicated and design our scheme independently of traffic flows. We demonstrate our hop-by-hop interest shaper in conjunction with simple Additive-Increase-Multiplicative-Decrease (AIMD) clients using the ns3-based NDN simulator (ndnSIM). Our results show that the proposed shaping algorithm can effectively control congestion and achieve near-optimal throughput.
机译:逐跳兴趣整形已被提出作为命名数据网络(NDN)中可行的拥塞控制机制。兴趣整形利用严格的接收器驱动的流量模式和NDN中的对称双向转发来控制返回数据速率。在本文中,我们指出兴趣和内容都会导致拥塞,并且在任何兴趣塑造算法中都必须考虑它们的相互依赖性。首先,我们通过将其公式化为优化问题来获得最佳成形速率,从而对这一问题进行数学分析。然后提出了一种实用的兴趣整形算法,以实现高链路利用率而又不会造成数据丢失。我们进一步注意到,NDN中的流量区分非常复杂,并且独立于流量来设计我们的方案。我们使用基于ns3的NDN模拟器(ndnSIM),结合简单的加减乘减(AIMD)客户端,演示了逐跳兴趣整形器。我们的结果表明,所提出的整形算法可以有效地控制拥塞并实现接近最佳的吞吐量。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号