Abstract:

A related contents gathering based cache policy called cache gathering (CG) was proposed to solve the routing scalability problem brought by existing cache policies in content centric network. By the mutual attraction between the contents with same feature, called related contents, the related contents gathered on nodes, which facilitated the cache contents feature abstraction, so the routing advertisement was decreased and the routing scalability was improved. Meanwhile, with the strategy of lifetime-increasement between contents with main feature, CG was able to reduce the update frequency of cache content, so the routing reliability was improved. On this basis, the general CG algorithm was proposed. The simulation proved the reasonableness and efficiency of the schemes in this thesis.

Key words: content centric network, cache policy, related contents gathering, routing scalability