Vip

Abstract

Emerging information-centric networking architectures seek to optimally utilize both bandwidth and storage for e cient content distribution. This highlights the need for joint design of tra c engineering and caching strategies, in order to optimize network performance in view of both current tra c loads and future tra c demands. We present a systematic framework for joint dynamic interest request forwarding and dynamic cache placement and eviction, within the context of the Named Data Networking (NDN) architecture. The framework employs a virtual control plane which operates on the user demand rate for data objects in the network, and an actual plane which handles Interest Packets and Data Packets. We develop distributed algorithms within the virtual plane to achieve network load balancing through dynamic forwarding and caching, thereby maximizing the user demand rate that the NDN network can satisfy. Numerical experiments within a number of network settings demonstrate the superior performance of the resulting algorithms for the actual plane in terms of low user delay and high rate of cache hits.

Enhanced VIP Algorithms for Forwarding, Caching, and Congestion Control in Named Data Networks

“…Consequently, a request for a data object can be fulfilled not only by the content source but also by any node with a copy of that object in its cache. Please see [1], [3], [4] for details.…”

“…NDN seeks to optimally utilize both bandwidth and storage for efficient content distribution, which highlights the need for joint design of traffic engineering and caching strategies, in order to optimize network performance. To address this fundamental problem, in our previous work [3], we propose the VIP framework for the design of high performing NDN networks. Within this VIP framework, we develop joint dynamic forwarding, caching and congestion control algorithms operating on virtual interest packets (VIPs) to maximize network utility subject to network stability in the virtual plane, using Lyapunov drift techniques [3], [4].…”

“…To address this fundamental problem, in our previous work [3], we propose the VIP framework for the design of high performing NDN networks. Within this VIP framework, we develop joint dynamic forwarding, caching and congestion control algorithms operating on virtual interest packets (VIPs) to maximize network utility subject to network stability in the virtual plane, using Lyapunov drift techniques [3], [4]. Then, using the resulting flow rates and queue lengths of the VIPs in the virtual plane, we develop the corresponding joint dynamic algorithms in the actual plane, which have been shown to achieve superior performance in terms of network throughput, user utility, user delay, and cache hit rates, relative to several baseline policies.…”

“…While the VIP algorithms in [3], [4] exhibit excellent performance, they are primarily focused on maximizing network throughput and do not explicitly consider user delay. In this paper, we aim to further improve the delay performance of the existing VIP algorithms in [3], [4] by leveraging VIP information beyond one hop. There are several potential challenges in pursuing this.…”

“…Generalizing Lyapunov drift techniques, we demonstrate the throughput optimality and characterize the utilitydelay tradeoff of the enhanced VIP algorithms. These enhanced VIP algorithms generalize the VIP algorithms in [3], [4] in the sense that they maintain network stability and maximize network utility while improving delay performance. In addition, these enhanced VIP algorithms (designed for NDN networks) extend the enhanced dynamic backpressure algorithms in [5] (designed for traditional source-destination networks) in the sense that they incorporate caching into the joint design of dynamic forwarding (routing) and congestion control.…”