VIP: Joint traffic engineering and caching in Named Data Networks

Abstract

Emerging information-centric networking architectures seek to optimally utilize both bandwidth and storage for efficient content distribution. This highlights the need for joint design of traffic engineering and caching strategies. 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 demonstrate the superior performance of the resulting algorithms for the actual plane in terms of low user delay.

Adaptive Caching Networks with Optimality Guarantees

“…Our framework, and adaptive algorithm, leaves many open questions, including jointly optimizing caching and routing decisions; this is even more pertinent in the presence of congestion, as in [38]. The excellent performance of the greedy heuristic in our simulations further attests to the need for establishing its performance formally.…”

Vip

“…This latter link is a "profitable" link for forwarding the Interest Packet at time slot t, from the standpoint of reducing delays and congestion. If either condition (i) or (ii) does not hold, then forward the Interest Packet on the link used by node n to forward the most recent Interest Packet for a chunk of object k. 10 If the head-of-the-queue Interest Packet at node n at time t is an interest for a chunk of data object k which is not the starting chunk, then forward the Interest Packet on the link used by node n to forward the most recent Interest Packet for a chunk of object k.…”

FOCAL: Forwarding and Caching with Latency Awareness in Information-Centric Networking

“…Similarly, in [12], authors suggest to forward Interests to the neighboring node that advertised the highest hit probability for the requested content object. A closer work to ours is [14], where an optimization framework is defined to jointly handle backpressure-based forwarding and LFU-like content placement. The work designs a control plane that feeds the actual chunk-level data plane with flow rates and queue sizes in order to operate optimal content placement and request forwarding.…”