Earticle

초록

영어

In-network caching is an important feature of Information Centric Networking (ICN). All routers in ICN will maintain caching ability, and, for each request, contents are cached at routers along the delivery path. This kind of on-path caching can reduce overall retrieval time. However, the same contents may end up to be cached all over the network causing wastes of caching space and decrease content diversity. Coordinated caching policy decides which contents to be stored at which routers cooperatively for better utilizing cache space. Nevertheless, with limited storage, most of coordinated caching policies use all the caching capacity to store popular contents. It may raise a fairness issue in which unpopular contents can not access caching space and thus lower overall performance. In this paper we propose a hybrid coordinated caching algorithm. By splitting cache space into two parts running different mechanisms respectively, it provides accessibility for both popular and unpopular contents. The evaluation results show that fairness is uplifted while maintaining high hit ratio and minimized latency.

목차

Abstract
 1. Introduction
 2. Related Works
  2.1. Non-coordinated Caching Policy
  2.2. Coordinated Caching Policy
  2.3. Observation
 3. System Model and methodology
  3.1 System Model
  3.2 Methodology
 4. Simulation Results
  4.1 Environment
  4.2 Simulation Results
 5. Conclusion
 References

키워드

저자

• Chih Yen Chang [ Graduate Institute of Communication Engineering, National Taiwan University, Taiwan. ]
• Ming Sang Chang [ Department of Information Management, Central Police University, Taiwan. ] Corresponding author

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Future Generation Communication and Networking

• 간기

  격월간

• pISSN

  2233-7857

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605