This thesis examines Automatic Incremental Routing (AIR) algorithm that run on a Named Data Networking (NDN) architecture. To study the performance of the AIR algorithm we simulated multiple nodes in the network simulator NS3. ndnSIM was used to simulate NDN routing between the nodes. We compared the number of hop counts required from an arbitrary source node to an arbitrary destination node using AIR routing with respect to Dijkstra’s shortest path first algorithm. We found that AIR routing rarely takes over one hop count more than the hop counts obtained from Dijkstra’s algorithm. From this empirical result, we conclude that AIR routing provides us with an alternative approach to name-based link-state routing, and gives us the advantages of automatic routing while not severely impacting performance.