Congestion Control and Fairness in Named Data Networks

Abstract

Named Data Networking (NDN) is the latest topic in the information-centric networking world. There are many open issues in NDN like caching, security, routing, forwarding, congestion etc. The security problem is solved by authenticating packets. Storage problem on each and every router is solved by applying different caching policy and likewise most of the NDN-related problem considered and solved. Currently one of the open research challenges is congestion control in NDN and for that forwarding; the strategy needs to be revised. To reduce congestion condition in an information-centric network like NDN strong scheduling policy is required. In proposed project deficit weighted round robin policy is going to apply. The main goal of this project is to reduce packet drop and delay in NDN network. In existing work weighted round robin algorithm is implemented, but to implement this mean packet size must be known. So better option is to apply deficit round robin in place of simple weighted round robin algorithm.