CAVE: Hybrid Approach for In-Network Content Caching

被引：0

作者：

Bakhit, Khaled ^{[1
]}

Taleb, Sirine ^{[1
]}

Kayssi, Ayman ^{[1
]}

Elhajj, Imad ^{[1
]}

Chehab, Ali ^{[1
]}

机构：

[1] Amer Univ Beirut, Dept Elect & Comp Engn, Beirut 11072020, Lebanon

来源：

2014 IEEE 11TH INTL CONF ON UBIQUITOUS INTELLIGENCE AND COMPUTING AND 2014 IEEE 11TH INTL CONF ON AUTONOMIC AND TRUSTED COMPUTING AND 2014 IEEE 14TH INTL CONF ON SCALABLE COMPUTING AND COMMUNICATIONS AND ITS ASSOCIATED WORKSHOPS | 2014年

关键词：

Content chunk caching; content-oriented networks; caching strategy; popoularity based;

D O I：

10.1109/UIC-ATC-ScalCom.2014.54

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We present CAVE, a novel hybrid algorithm for caching in content-oriented networks (CON). It relies on popularity-based caching and content chunk indexing. CAVE is a combination of two existing caching algorithms: WAVE which is a popularity-based scheme, and CONIC which is an index-based scheme. In CAVE, routers run WAVE and CONIC, with WAVE having priority over CONIC, while clients use a modified Least Recently Used (LRU) caching scheme to store content when instructed by downstream routers and apply WAVE cache suggestion flags for upstream routers before serving content. We conducted several experiments to compare CAVE against several proposed caching schemes including WAVE and CONIC. Our results showed that CAVE outperforms other algorithms scoring the highest cache hit ratio.

引用

页码：649 / 654

页数：6