A Practical Congestion Control Scheme for Named Data Networking

A Practical Congestion Control Scheme for Named Data Networking
复制标题

DOI:
10.1145/2984356.2984369
复制
发表时间:
2016-09
期刊:
Proceedings of the 3rd ACM Conference on Information-Centric Networking
影响因子:
--
通讯作者:
K. Schneider;Cheng Yi;Beichuan Zhang;Lixia Zhang
K. Schneider;Cheng Yi;Beichuan Zhang;Lixia Zhang
中科院分区:
其他
文献类型:
--
作者:
K. Schneider;Cheng Yi;Beichuan Zhang;Lixia Zhang

文献摘要

被引文献

相似文献

传统的拥塞控制机制是为端到端连接设计的,不适合命名数据网络(NDN)体系结构,在NDN体系结构中,内容可以从多个来源并通过多条路径检索。为了充分利用NDN体系结构,拥塞控制方案必须考虑网络内缓存、多路径转发和组播数据传输的影响。此外,解决方案不能假设已知的链路带宽或数据包大小,因为这些假设可能不适用于覆盖链路、无线链路或具有不同数据包大小的应用程序。针对上述问题,本文提出了一种实用的拥塞控制方案--PCON。PCON根据Codel AQM(通过测量分组排队时间)检测拥塞,然后通过明确标记某些分组来向消费者发送信号,以便下游路由器可以将流量转移到替代路径,并且消费者可以降低其感兴趣的发送速率。仿真结果表明,在保持相似的RTT公平性的情况下,PCON的转发自适应能力达到了比已有工作更高的总吞吐量。此外,PCON可以适应IP隧道和无线链路容量的变化,这是其他逐跳方案没有考虑的条件。
Traditional congestion control mechanisms are designed for end-to-end connections and do not fit the Named Data Networking (NDN) architecture, in which content can be retrieved from multiple sources and through multiple paths. To fully exploit the NDN architecture, a congestion control scheme must consider the effects of in-network caching, multipath forwarding, and multicast data delivery. Moreover, the solution must not assume known link bandwidths or Data packet sizes, as these assumptions may not hold for overlay links, wireless links, or applications with varying Data packet sizes. In this paper we propose PCON: a practical congestion control scheme to address the above issues. PCON detects congestion based on the CoDel AQM (by measuring packet queuing time), then signals it towards consumers by explicitly marking certain packets, so that downstream routers can divert traffic to alternative paths and consumers can reduce their Interest sending rates. Our simulations show that PCON's forwarding adaptation reaches a higher total throughput than existing work while maintaining similar RTT fairness. Moreover, PCON can adapt to the changing capacity of IP tunnels and wireless links, conditions that other hop-by-hop schemes do not consider.