The 2ACT model-based evaluation for in-network caching mechanism

Ke Xu, Min Zhu, Ning Wang, Song Lin, Haiyang Wang, Tong Li

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Scopus citations

Abstract

With the popularity of information and content items that can be cached within ISP networks, developing high-quality and efficient content distribution approaches has become an important task in future internet architecture design. As one of the main techniques of content distribution, in-network caching mechanism has attracted attention from both academia and industry. However, the general evaluation model of in-network caching is seldom discussed. The trade-off between economic cost and the deployment of in-network caching still remains largely unclear, especially for heterogeneous applications. We take a first yet important step towards the design of a better evaluation model based on the Application Adaptation CapaciTy (2ACT) of the architecture to quantify the trade-off in this paper. Based on our evaluation model, we further clarify the deployment requirements for the in-network caching mechanism. Based on our findings, ISPs and users can make their own choice according to their application scenarios.

Original languageEnglish (US)
Title of host publication2013 IEEE Symposium on Computers and Communications, ISCC 2013
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages636-641
Number of pages6
ISBN (Print)9781479937554
DOIs
StatePublished - 2013
Event18th IEEE Symposium on Computers and Communications, ISCC 2013 - Split, Croatia
Duration: Jul 7 2013Jul 10 2013

Publication series

NameProceedings - IEEE Symposium on Computers and Communications
ISSN (Print)1530-1346

Other

Other18th IEEE Symposium on Computers and Communications, ISCC 2013
Country/TerritoryCroatia
CitySplit
Period7/7/137/10/13

Fingerprint

Dive into the research topics of 'The 2ACT model-based evaluation for in-network caching mechanism'. Together they form a unique fingerprint.

Cite this