Overhead of Named Data Networking Routing Protocol

Abstract

Named Data Networking (NDN) as the future internet, shall have a good design routing for handling massive node connection with various behavior. Otherwise, the routing protocol will be burdened with an inefficient process that can degrade connection performance. One of inefficiency parameter is routing overhead, which usually a broadcast message. In this paper will be depicted and analyzed how routing overhead could significantly increase due to a number of node and behavior of the network. Routing protocol link state (LS) have a good efficiency for handle intense traffic network. However, LS shows more inefficient due to the network dynamism and a huge amount of NDN node, than geographic based routing (GR). This result will be fundamental for future research for routing efficiency.