Memory Efficient and High Lookup PIT-Named Data Networking

Authors

  • A. Shanmuga Priya  Department of Computer Science, Pondicherry University, Puducherry, India
  • Anurudh Kumar  Department of Computer Science, Pondicherry University, Puducherry, India
  • W. J. Kalesha  Department of Computer Science, Pondicherry University, Puducherry, India
  • Dr. K. Suresh Joseph  Department of Computer Science, Pondicherry University, Puducherry, India

Keywords:

Named Data Networking, Content Centric Networking,IP address,PIT

Abstract

With an increase in growth of internet users, content plays the vital role and the IP address has less importance.Today's Internet architecture deals with IP address which leads to increases in addresses day-by-day which occupies more space.Server dependency is more at present with the current internet architecture.The issue of current internet architecture are memory requirement and server dependency which are overcome by Named Data Networking( Content-Centric Networking ) using content name.NDN replaces the Host Centric Networking by Content-Centric Networking.This proposed framework deals with reducing memory and increasing lookup by clustering and encoding the component of a prefix in Pending Interest Table(PIT).

References

  1. Quan,W.,Xu,C.,Guan,J.,Zhang,H.,& Grieco,L. A. 2014. Scalable Name Lookup with Adaptive Prefix Bloom Filter for Named Data Networking,18(1),102–105.
  2. Luo,J.,Wu,C.,Jiang,Y.,& Tong,J. 2014. Name Label Switching Paradigm in Named Data Networking,7798(c),1–4. https://doi.org/10.1109/LCOMM.2014.2387344
  3. Saxena,D.,& Raychoudhury,V.2016. Radient : Scalable ,memory efficient name lookup algorithm for named data networking,Journal of Network and Computer Applications,1–13. https://doi.org/10.1016/j.jnca.2015.12.009
  4. Li,Z.,Liu,K.,Zhao,Y.,& Ma,Y. 2014. MaPIT: An enhanced pending interest table for ndn with mapping bloom filter. IEEE Communications Letters,18(11),1915–1918. https://doi.org/10.1109/LCOMM.2014.2359191
  5. Saxena,D.,Raychoudhury,V.,Suri,N.,& Becker,C. 2016. ScienceDirect Named Data Networking : A survey,ScienceDirect ,19,15–55.
  6. Wang,Y.,He,K.,Dai,H.,Meng,W.,Jiang,J.,Liu,B.,& Chen,Y. 2012. Scalable name lookup in NDN using effective name component encoding. Proceedings - International Conference on Distributed Computing Systems,(20100002110051),688–697. https://doi.org/10.1109/ICDCS.2012.35
  7. Dannewitz,C.,D’Ambrosio,& Vercellone,V. 2013. Hierarchical DHT-based name resolution for information-centric networks,Computer Communications,36(7),736–749. https://doi.org/10.1016/j.comcom.2013.01.014
  8. Afanasyev,A.,Yi,C.,Wang,L.,Zhang,B.,& Zhang,L. 2015. SNAMP: Secure namespace mapping to scale NDN forwarding. Proceedings - IEEE INFOCOM,281–286. https://doi.org/10.1109/INFCOMW.2015.7179398
  9. Bouk,S. H.,Ahmed,S. H.,Yaqub,M. A.,Kim,D.,& Gerla,M. 2016. DPEL: Dynamic PIT entry lifetime in Vehicular named data networks.IEEE CommunicationsLetters,20(2),336–339. https://doi.org/10.1109/LCOMM.2015.2508798
  10. Alzahrani,B. A.,Reed,M. J.,Riihijärvi,J.,& Vassilakis,V. G. 2015. Scalability of information centric networking using mediated topology management. Journal of Network and Computer Applications,50,126–133. https://doi.org/10.1016/j.jnca.2014.07.002.
  11. https://named-data.net/project/archoverview/
  12. https://wiki2.org/en/Trie

Downloads

Published

2018-04-30

Issue

Section

Research Articles

How to Cite

[1]
A. Shanmuga Priya, Anurudh Kumar, W. J. Kalesha, Dr. K. Suresh Joseph, " Memory Efficient and High Lookup PIT-Named Data Networking, IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 3, Issue 3, pp.1260-1264, March-April-2018.