Enhanced VIP Algorithms for Forwarding, Caching, and Congestion Control in Named Data Networks
Enhanced VIP Algorithms for Forwarding, Caching, and Congestion Control in Named Data Networks
复制标题
DOI：
10.1109/glocom.2016.7841814
复制
发表时间：
2013-10
期刊：
影响因子：
--
通讯作者：
Ying Cui;Fan Lai;E. Yeh;Ran Liu
中科院分区：
文献类型：
--
作者：
Ying Cui;Fan Lai;E. Yeh;Ran Liu
新兴的以信息为中心的网络（ICN）架构寻求最佳地利用带宽和存储以通过网络进行高效的内容分发。虚拟兴趣分组（VIP）框架已经被提出以使得能够在命名数据网络（NDN）架构内联合设计转发、缓存和拥塞控制策略。虽然现有的VIP算法表现出良好的性能，他们主要集中在最大化网络吞吐量和效用，并没有明确考虑用户延迟。在本文中，我们开发了一类新的增强算法的联合动态转发，缓存和拥塞控制的VIP框架内。这些增强的VIP算法自适应地稳定了网络，最大化网络效用，同时通过智能地利用一跳之外的VIP信息来改善延迟性能。推广李雅普诺夫漂移技术，我们证明了吞吐量最优性和功能的增强VIP算法的延迟权衡。数值实验表明，在低网络延迟和高网络效用方面，所得到的增强算法在实际平面内处理兴趣分组和数据分组的上级性能。
Emerging Information-Centric Networking (ICN) architectures seek to optimally utilize both bandwidth and storage for efficient content distribution over the network. The Virtual Interest Packet (VIP) framework has been proposed to enable joint design of forwarding, caching, and congestion control strategies within the Named Data Networking (NDN) architecture. While the existing VIP algorithms exhibit good performance, they are primarily focused on maximizing network throughput and utility, and do not explicitly consider user delay. In this paper, we develop a new class of enhanced algorithms for joint dynamic forwarding, caching and congestion control within the VIP framework. These enhanced VIP algorithms adaptively stabilize the network and maximize network utility, while improving the delay performance by intelligently making use of VIP information beyond one hop. Generalizing Lyapunov drift techniques, we prove the throughput optimality and characterize the utility-delay tradeoff of the enhanced VIP algorithms. Numerical experiments demonstrate the superior performance of the resulting enhanced algorithms for handling Interest Packets and Data Packets within the actual plane, in terms of low network delay and high network utility.