Enhanced VIP Algorithms for Forwarding, Caching, and Congestion Control in Named Data Networks
Ying Cui, Fan Lai, Edmund Yeh, Ran Liu

TL;DR
This paper introduces enhanced VIP algorithms for Named Data Networks that improve delay performance and network utility by adaptively managing forwarding, caching, and congestion control using extended VIP information.
Contribution
The paper presents novel VIP algorithms that incorporate multi-hop VIP information to optimize delay and utility, extending prior throughput-focused methods.
Findings
Reduced network delay in simulations
Increased network utility performance
Proven throughput optimality of the algorithms
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCaching and Content Delivery · Cooperative Communication and Network Coding · Opportunistic and Delay-Tolerant Networks
