Advertisement

An Improved Method of Pending Interest Table in Named Data Networking

  • Peiyuan Gu
  • Yabin XuEmail author
  • Tian Song
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 1101)

Abstract

In Named Data Networking (NDN), Pending Interest Table (PIT) is proposed to record the forwarding information of interest packets forwarded but not responded. Each incoming interest packet or data packet needs to be queried and processed in PIT, and the overhead would rise as the scale of PIT increases. Therefore, PIT is required to have a very high processing speed. To effectively improve the forwarding efficiency of PIT in NDN, a new architecture of the PIT using a hot table to achieve prefix grading is designed and implemented. The concept of “prefix value” is proposed to determine the value of a prefix carrying the information content of an interest packet, and to store and prioritize the prefix information with a higher value. The results of the comparison experiment show that the architecture of the PIT with a hot table can significantly improve processing speed of the PIT and accelerate forwarding efficiency of the NDN node.

Keywords

Named Data Network Pending Interest Table Prefix value Hot table 

References

  1. 1.
    Zhang, L., et al.: Named data networking (NDN) project. In: Relatório Técnico NDN-0001, pp. 157–158. Xerox Palo Alto Research Center-PARC, Los Angeles (2010)Google Scholar
  2. 2.
    Lei, K.: Information Centric Networking and Named Data Networking. Peking University Press, Beijing (2015). (in Chinese)Google Scholar
  3. 3.
    Zhang, L., et al.: Named data networking. In: Proceedings of ACM SIGCOMM Computer Communication Review, vol. 44, pp. 66–73. ACM, New York (2014)Google Scholar
  4. 4.
    Perino, D., Varvello, M.: A reality check for content centric networking. In: Proceedings of ACM SIGCOMM, pp. 44–49. ACM, New York (2011)Google Scholar
  5. 5.
    Wang, Y., et al.: Scalable name lookup in NDN using effective name component encoding. In: Proceedings of 2012 IEEE 32nd International Conference on Distributed Computing Systems, pp. 688–697. IEEE, Macau (2012)Google Scholar
  6. 6.
    Dai, H., et al.: On pending interest table in named data networking. In: Proceedings of the Eighth ACM/IEEE Symposium on Architectures for Networking and Communications Systems, pp. 211–222. ACM, New York (2012)Google Scholar
  7. 7.
    Huang, H., Wang, Y., Lan, J.: An instant-triggered PIT item aging method. J. Inf. Eng. Univ. 16(02), 152–156 (2015). (in Chinese)Google Scholar
  8. 8.
    Liu, D., Hu, Y., Zhuang, L.: Research on fast forwarding response mechanism in NDN. J. Zhengzhou Univ. 12(2), 68–72 (2015). (in Chinese)Google Scholar
  9. 9.
    Alubady, R., Hassan, S., Habbal, A.: Adaptive interest lifetime in named data networking to support disaster area. J. Telecommun. Electron. Comput. Eng. (JTEC) 10(2–4), 29–34 (2018)Google Scholar
  10. 10.
    Alubady, R., Hassan, S., Habbal, A.: HLLR: highest lifetime least request policy for high performance pending interest table. In: Proceedings of 2016 IEEE Conference on Open Systems (ICOS), pp. 42–47. IEEE, Langkawi (2016)Google Scholar
  11. 11.
    Li, Z., Bi, J., Wang, S., Jiang, X.: Compression of pending interest table with bloom filter in content centric network. In: Proceedings of 2012 ACM 7th International Conference on Future Internet Technologies, pp. 46. Springer, Heidelberg (2012)Google Scholar
  12. 12.
    Li, Z., Liu, K., Zhao, Y., Ma, Y.: MaPIT: an enhanced pending interest table for NDN with mapping bloom filter. IEEE Commun. Lett. 18(11), 1915–1918 (2014)CrossRefGoogle Scholar
  13. 13.
    You, W., et al.: DiPIT: a distributed bloom-filter based pit table for CCN nodes. In: Proceedings of 2012 21st International Conference on Computer Communications and Networks (ICCCN), pp. 1–7. IEEE, Munich (2012)Google Scholar
  14. 14.
    Yuan, H., Crowley, P.: Scalable pending interest table design: from principles to practice. In: Proceedings of 2014 IEEE INFOCOM Conference on Computer Communications, pp. 2049–2051. IEEE, Toronto (2014)Google Scholar
  15. 15.
    Varvello, M., Perino, D., Linguaglossa, L.: On the design and implementation of a wire-speed pending interest table. In: Proceedings of 2013 IEEE Conference on Computer Communications Workshops, pp. 369–374. IEEE, Turin (2013)Google Scholar
  16. 16.
    Xu, Y., et al.: Research on PIT storage structure of named data networking based on improved MBF. J. Chongqing Univ. Posts Telecommun. 30(1), 61–67 (2018). (in Chinese)Google Scholar
  17. 17.
    Li, G.: Service popularity-based smart resources partitioning for fog computing-enabled industrial Internet of Things. IEEE Trans. Ind. Inform. 14(10), 4702–4711 (2018)CrossRefGoogle Scholar
  18. 18.
    Liu, Q., et al.: Popularity-based in-network cache replacement strategy in named data networking. Comput. Eng. Appl. 906(11), 81–85 (2018). (in Chinese)Google Scholar
  19. 19.
    Zhang, X., Cheng, M., Xiao, F.: Using origin to compare data outliers. Exp. Sci. Technol. 10(1), 74–76 (2012). (in Chinese)Google Scholar
  20. 20.
    Afanasyev, A., Moiseenko, I., Zhang, L.: ndnSIM: NDN simulator for NS-3. University of California, Los Angeles (2012)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.Beijing Key Laboratory of Network Culture and Digital CommunicationBeijing Information Science and Technology UniversityBeijingChina
  2. 2.School of ComputerBeijing Information Science and Technology UniversityBeijingChina
  3. 3.School of ComputerBeijing Institute of TechnologyBeijingChina

Personalised recommendations