Loading...

A Randomized Cache Policy for Network of Caches

Farhadi, Pegah | 2020

362 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: English
  3. Document No: 53196 (52)
  4. University: Sharif University of Technology, International Campus, Kish Island
  5. Department: Science and Engineering
  6. Advisor(s): Sarbazi-Azad, Hamid; Seyed Rezaza Dalali, Mostafa
  7. Abstract:
  8. In a network of caches, the precious cache space must be efficiently managed. A wasteful cache management algorithm might make redundant copies of the same content at several caches. Therefore, there must be an algorithm (a.k.a admission policy) to find a proper location in the network for every content to be cached. One way to locate different content at different caches is based on content popularity. Thus, popular content is closer to requesters. However, measuring content popularity at every router is not practical due to the high overhead the algorithm imposes on the routers. A more practical approach is to distribute different parts of the content to several caches along the path from the requester to the content provider. Accordingly, CCndn (Content Caching for Named Data Networking) admission policy breaks content into multiple segments to distribute them along the path. In this way, core routers are engaged more in the caching process by serving requesters with some part of the popular content. On the other hand, some admission policies that increase data redundancy, like Leave Copy Down (LCD), show exceptional performance when the cache size is large. However, LCD shows poor performance when the cache size is small due to wasting the insufficient resources with high data redundancy. To get benefits of both CCndn and LCD for small and large cache sizes, in this thesis, we introduce R-CCndn (Randomized-CCndn) that uses a specific algorithm to randomly locate redundant copies of content in some other caches. Like CCndn, R-CCndn specifies a router in the path for every segment of a content to be cached there. However, other routers in the path, based on some rules, have a chance to randomly cache the segment to increase data redundancy.The experiments show that the R-CCndn is a superior algorithm compared to the other rival cache admission policies. The improvement depends on the available cache size and the traffic passing by the routers ranging from 2x to 14x
  9. Keywords:
  10. Performance Evaluation ; Cache Memory ; Admission Policy ; Cache Network ; Randomized Algorithm ; Data Storage

 Digital Object List