Visible to the public Data forwarding and update propagation in grid network for NDN: A low-overhead approach

TitleData forwarding and update propagation in grid network for NDN: A low-overhead approach
Publication TypeConference Paper
Year of Publication2018
AuthorsChatterjee, Tanusree, Ruj, Sushmita, DasBit, Sipra
Conference Name2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)
Date Publisheddec
Keywordscache storage, communication overheads, Databases, dominating set, forwarding, grid network, Human Behavior, information updates, Internet, IP networks, Link State Data Base, low-overhead approach, low-overhead solution, named data network, Named Data Network Security, NDN, NDN features, NDN router High communication over-heads, NDN routing, Network topology, pubcrawl, Resiliency, Routing, Routing protocols, Scalability, storage overhead, telecommunication network routing, update overheads
AbstractNow-a-days Internet has become mostly content centric. Named Data Network (NDN) has emerged as a promising candidate to cope with the use of today's Internet. Several NDN features such as in-network caching, easier data forwarding, etc. in the routing method bring potential advantages over conventional networks. Despite the advantages, there are many challenges in NDN which are yet to be addressed. In this paper, we address two of such challenges in NDN routing: (1) Huge storage overhead in NDN router (2) High communication over-heads in the network during propagation of routing information updates. We propose changes in existing NDN routing with the aim to provide a low-overhead solution to these problems. Here instead of storing the Link State Data Base (LSDB) in all the routers, it is kept in selected special nodes only. The use of special nodes lowers down the overall storage and update overheads. We also provide supporting algorithms for data forwarding and update for grid network. The performance of the proposed method is evaluated in terms of storage and communication overheads. The results show the overheads are reduced by almost one third as compared to the existing routing method in NDN.
DOI10.1109/ANTS.2018.8710136
Citation Keychatterjee_data_2018