An Improved Method of Pending Interest Table in Named Data Networking

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.