A collaborative caching scheme with network clustering and hash-routing in CCN

Li, Weiyuan; Li, Yang; Wang, Wei; Xin, Yonghui; Xu, Yuelei

doi:10.1109/pimrc.2016.7794975

Cited by 7 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They distribute contents by calculating hash values with a modulo function, which increases the effective cache capacity. In [13], the authors also propose a hash-based distribution, but for mesh networks. They create several groups of cache servers and distribute contents within a group by associating the hash values and server IDs.…”

Section: Cooperative Caching Strategies For Reducing Trafficmentioning

confidence: 99%

“…The hash-based content distribution approaches [11]- [13] could be used by a simple routing scheme based on hash values. When a server receives a request, it calculates the hash value of the request to find locations of desired contents as well as decide whether to store the content in the server.…”

Section: Routing Schemes For Cooperative Cachingmentioning

confidence: 99%

“…We compare the proposed Color Based Routing (CBR) against the Shortest-Path Routing (SPR) presented in Dijkstra's algorithm [19], the Hash-Based Routing (HBR) proposed in [13], and the Nearest Replica Routing (NRR) which routes requests to the nearest server with the cached content [20]. We numbered cache servers from southwest nodes, and the servers store contents when (content id mod N) = (server id mod N) in the HBR strategy, where N is the number of colors.…”

Section: Color Tag Based Routing Schemementioning

confidence: 99%

See 2 more Smart Citations

Color-Based Cooperative Cache and Its Routing Scheme for Telco-CDNs

Nakajima

Yoshimi

et al. 2017

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

Takuma NAKAJIMA†a) , Nonmember, Masato YOSHIMI †b) , Celimuge WU †c) , Members, and Tsutomu YOSHINAGA †d) , Senior Member SUMMARY Cooperative caching is a key technique to reduce rapid growing video-on-demand's traffic by aggregating multiple cache storages. Existing strategies periodically calculate a sub-optimal allocation of the content caches in the network. Although such technique could reduce the generated traffic between servers, it comes with the cost of a large computational overhead. This overhead will be the cause of preventing these caches from following the rapid change in the access pattern. In this paper, we propose a light-weight scheme for cooperative caching by grouping contents and servers with color tags. In our proposal, we associate servers and caches through a color tag, with the aim to increase the effective cache capacity by storing different contents among servers. In addition to the color tags, we propose a novel hybrid caching scheme that divides its storage area into colored LFU (Least Frequently Used) and no-color LRU (Least Recently Used) areas. The colored LFU area stores color-matching contents to increase cache hit rate and no-color LRU area follows rapid changes in access patterns by storing popular contents regardless of their tags. On the top of the proposed architecture, we also present a new routing algorithm that takes benefit of the color tags information to reduce the traffic by fetching cached contents from the nearest server. Evaluation results, using a backbone network topology, showed that our color-tag based caching scheme could achieve a performance close to the sub-optimal one obtained with a genetic algorithm calculation, with only a few seconds of computational overhead. Furthermore, the proposed hybrid caching could limit the degradation of hit rate from 13.9% in conventional non-colored LFU, to only 2.3%, which proves the capability of our scheme to follow rapid insertions of new popular contents. Finally, the color-based routing scheme could reduce the traffic by up to 31.9% when compared with the shortest-path routing.

show abstract

Section: Cooperative Caching Strategies For Reducing Trafficmentioning

confidence: 99%

Section: Routing Schemes For Cooperative Cachingmentioning

confidence: 99%