Content Routing and Lookup Schemes Using Global Bloom Filter for Content-Delivery-as-a-Service
Leveraging cloud computing technology, the authors have proposed Content-Delivery-as-a-Service (CoDaaS) to distribute User Generated Content (UGC) in an efficient and economical fashion. However, due to the exponential increases of Internet traffic, traditional hashing-based content routing and lookup scheme suffers from high delay. This paper introduces a global Compressed Counting Bloom Filter (CCBF) into CoDaaS to address this issue. The global CCBF adds their system with the capability to early check the existence of any specific content among all the peering surrogates, before any local checking on each cache node. Using this global CCBF, they propose two content routing and lookup mechanisms (parallel and cut-through schemes) to reduce the delay for better user experience.