Earticle

초록

영어

As a representative network architecture of future network, CCN has attracted more and more attention from academia and industry. Among many components of CCN, caching policy is the key feature, which directly influences CCN’s performance. In this paper, an interesting topic is explored, i.e. whether the network performance will be promoted if popular and non-popular contents are cached respectively. A cache partition policy based on content popularity is proposed with the theoretical expression derived and the Matlab calculation results provided to verify its performance. The numerical results have shown that, the proposed policy is always superior to the commonly used LCE/LRU policy due to the increased characteristic time.

목차

Abstract
 1. Introduction
 2. CCN Description
 3. PCP Description and Analysis
  (1) First Level
  (2) Network of Caches
 4. Numerical Analysis Results
 5. Conclusions
 Acknowledgments
 References

키워드

저자

• Pu Gong [ School of Computer Science and Communication Engineering, Jiangsu University, China ]
• HuanYu Wu [ School of Computer Science and Communication Engineering, Jiangsu University, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Advanced Science and Technology

• 간기

  월간

• pISSN

  2005-4238

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605