Dynamic Naming Scheme and Lookup Method Based on Trie for Vehicular Named Data Network

Algorithm 3

Remove content.

Input:  Desired interest for delete

Output:   Delete interest from content table

1 if then

2  return 0; // not matched with hash table

3 Nothing change;

4 if Exact match then

5  ;

6  − −Node Merge;

7 else

8  return 0; failed to remove contents