DRR-MDPF: A Queue Management Strategy Based on Dynamic Resource Allocation and Markov Decision Process in Named Data Networking (NDN)
Fatemeh Roshanzadeh, Hamid Barati, Ali Barati

TL;DR
This paper presents DRR-MDPF, a novel queue management strategy for Named Data Networking that combines Markov Decision Processes with fair bandwidth allocation to improve performance under dynamic, high-traffic conditions.
Contribution
It introduces a hybrid approach integrating MDPF and DRR, enabling routers to predict optimal forwarding and allocate resources adaptively in NDN environments.
Findings
Significantly outperforms existing strategies in throughput and satisfaction rate.
Maintains robustness under limited cache sizes and heavy traffic.
Offers lower computational complexity with single-path routing.
Abstract
Named Data Networking (NDN) represents a transformative shift in network architecture, prioritizing content names over host addresses to enhance data dissemination. Efficient queue and resource management are critical to NDN performance, especially under dynamic and high-traffic conditions. This paper introduces DRR-MDPF, a novel hybrid strategy that integrates the Markov Decision Process Forwarding (MDPF) model with the Deficit Round Robin (DRR) algorithm. MDPF enables routers to intelligently predict optimal forwarding decisions based on key metrics such as bandwidth, delay, and the number of unsatisfied Interests, while DRR ensures fair and adaptive bandwidth allocation among competing data flows. The proposed method models each router as a learning agent capable of adjusting its strategies through continuous feedback and probabilistic updates. Simulation results using ndnSIM…
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.
