{'fraction_non_alphanumeric': 0.023169601482854494, 'fraction_numerical': 0.0, 'mean_word_length': 5.428571428571429, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
BGCC: a Bloom Filter-based Grouped-Chunk Caching Approach for Information-Centric Networking

Packet-level caching is difficult to implement in the traditional caching system. The emergence of Information-centric networking (ICN) has alleviated this problem. However, the chunklevel caching is still facing severe scalability issues. In this paper, we analyze the issues which limit the implementation of chunk-level caching and propose a chunk-level caching optimization approach called BGCC. In BGCC, we reduce the consumption of fast memory by creating the index with group prefixes instead of the chunk prefixes, while the group-level popularity is also used to optimize caching decision. We evaluate the performance of our scheme through extensive simulation experiments regarding a wide range of performance metrics. The experimental results indicate BGCC can reduce the fast memory usage and achieve significant improvement in terms of server load reduction ratio, average hop reduction ratio and average cache hit ratio, compared with current chunk-level caching schemes.