Author : Anjali Kumari 1
Date of Publication :1st December 2017
Abstract: Named data Networking (NDN) is emerging internet architecture according to today scenario about devices which function in internet of everything environment. NDN-architecture forked from content-centric networking. NDN router works on in path caching although other existing network architecture also having in-path caching mechanism but NDN works with the proper data structure and specialized interest packet handling mechanism which makes unique NDN architecture among several existing network architectures. It stores incoming interest packet address which in form of array of string containing alphanumeric values separated by (‘/’) delimited. While in Flat TCP/IP architecture IP address is used, which is not justifying today internet requirement where data handling is more important than machine and exactly NDN has hit this weakness of TCP/IP module, NDN follow only data address instead of machine address, but string is used for naming which leads to exhaustive memory consumption and extra lookup time for particular interest in table so proposed methodology reduces space complexity and lookup cost (i.e. time complexity). By using the encoding technique which potentially restrict the memory usage. In encoding technique encode the element of a name prefixes with an automatically generated unique number. This paper, based on reduction the lookup up cost and the insertion cost for a request.
Reference :
-
- Divya Saxena, Vaskar Raychoudhury, “Radient: Scalable memory efficient name lookup algorithm for named data networking”, Journal of Network and Computer Applications 63 (2016) 1–13.
- Haowei Yuan & Patrick Crowley, “Reliably Scalable Name Prefix Lookup”, Architectures for Networking and Communications Systems (2015)
- Huawei Yuan and Patrick Crowley, “Scalable Pending Interest Table Design: From Principles to Practice”, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications. (2014)
- Miguel A .Martínez-Prieto, Nieves Brisaboa, Rodrigo Cánovas, Francisco Claude, Gonzalo Navarro, Practical “practical compressed string dictionaries”, Information Systems56(2016)73–108.
- klaus Schneider , Lixia Zhang, “A Practical Congestion Control Scheme for Named Data Networking”, ACM-ICN ’16, September 26–28, 2016, Kyoto, Japan 2016 ACM. DOI: http://dx.doi.org/10.1145/2984356.2984369
- Wei You, Bertrand Mathieu, Patrick Truong, JeanFranc¸ois Peltier, Gwendal Simon, “Realistic Storage of Pending Requests in Content-Centric Network Routers” (2012).
- Xiaojun Nie David J. Wilson Jerome Cornet Gerard Damm Yiqiang Zhao, “IP Address Lookup Using A Dynamic Hash Function”, 0-7803-8886-0/05/2005 IEEE CCECE/CCGEI, Saskatoon, May 2005.
- Butler Lampson, Venkatachary Srinivasan, and George Varghese, “IP Lookups Using Multiway and Multicolumn Search”, IEEE/ACMTR ANSACTIONOSN N ETWORKINVGO, L.I , NO. 3, JUNE 1999.
- Stefanos Kaxiras Georgios Keramidas, “IPStash: a Power-Efficient Memory Architecture for IP-lookup” Proceedings of the 36th International Symposium on Microarchitecture (MICRO-36 2003).
- Matteo Virgilio, Guido Marchetto, Riccardo Sisto, “PIT Overload Analysis in Content Centric Networks”, ICN '13 Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking August 12 - 12, 2013