Name Weighted Round Robin (NWRR) Algorithm for Named Data Networking

Named Data Networking (NDN) is an emerging communication paradigm to resolve a traffic explosion problem due to repeated and duplicated delivery of large multimedia content. To make NDN being useful more widely, however, it should support various types of traffic and their Quality of Service (QoS) requirements. In this paper, we propose a queue scheduling algorithm named Name Weighted Round Robin (NWRR) that can work on top of the diffserv model in NDN. The proposed algorithm performs combined scheduling of Interest packets and Data packets and modifies the weight of each queue according to the average packet length of different queues. Results in ndnSIM simulator demonstrate that NWRR can provide different levels of service for different priority applications as well as can cope with the issue of lack of fairness caused by different average packet length in each queue.