Replacing media caches in streaming proxy servers

Hojung Cha, Jongmin Lee, Jaehak Oh, Byung Joon Park, Rhan Ha

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

This paper presents a cache replacement policy which has specifically been developed for the efficient media caching in streaming media cache servers. For efficient media caching, the proposed policy takes into account the periodic patterns of users' requests in addition to the parameters such as reference count, amount of media contents delivered to the clients, and reference time. These values are collected at run-time for each cached object. In order to adequately and promptly adopt to the changing characteristics of users preferences, the policy introduces, in particular, the concept of weighted-window for replacement with which higher priorities are given to more recently referenced media contents and consequently they are less likely to be replaced. We present and analyze the simulation results showing that the proposed policy has outperformed the conventional replacement policies such as LRU, LFU, and SEG in terms of hit ratio, byte-hit ratio, delayed start, and cache input.

Original languageEnglish
Pages (from-to)25-40
Number of pages16
JournalJournal of Systems Architecture
Volume52
Issue number1
DOIs
Publication statusPublished - 2006 Jan 1

Fingerprint

Media streaming
Servers

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture

Cite this

Cha, Hojung ; Lee, Jongmin ; Oh, Jaehak ; Park, Byung Joon ; Ha, Rhan. / Replacing media caches in streaming proxy servers. In: Journal of Systems Architecture. 2006 ; Vol. 52, No. 1. pp. 25-40.
@article{fca7c425fc5f4caba2f3a33e8db7c076,
title = "Replacing media caches in streaming proxy servers",
abstract = "This paper presents a cache replacement policy which has specifically been developed for the efficient media caching in streaming media cache servers. For efficient media caching, the proposed policy takes into account the periodic patterns of users' requests in addition to the parameters such as reference count, amount of media contents delivered to the clients, and reference time. These values are collected at run-time for each cached object. In order to adequately and promptly adopt to the changing characteristics of users preferences, the policy introduces, in particular, the concept of weighted-window for replacement with which higher priorities are given to more recently referenced media contents and consequently they are less likely to be replaced. We present and analyze the simulation results showing that the proposed policy has outperformed the conventional replacement policies such as LRU, LFU, and SEG in terms of hit ratio, byte-hit ratio, delayed start, and cache input.",
author = "Hojung Cha and Jongmin Lee and Jaehak Oh and Park, {Byung Joon} and Rhan Ha",
year = "2006",
month = "1",
day = "1",
doi = "10.1016/j.sysarc.2005.02.006",
language = "English",
volume = "52",
pages = "25--40",
journal = "Journal of Systems Architecture",
issn = "1383-7621",
publisher = "Elsevier",
number = "1",

}

Replacing media caches in streaming proxy servers. / Cha, Hojung; Lee, Jongmin; Oh, Jaehak; Park, Byung Joon; Ha, Rhan.

In: Journal of Systems Architecture, Vol. 52, No. 1, 01.01.2006, p. 25-40.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Replacing media caches in streaming proxy servers

AU - Cha, Hojung

AU - Lee, Jongmin

AU - Oh, Jaehak

AU - Park, Byung Joon

AU - Ha, Rhan

PY - 2006/1/1

Y1 - 2006/1/1

N2 - This paper presents a cache replacement policy which has specifically been developed for the efficient media caching in streaming media cache servers. For efficient media caching, the proposed policy takes into account the periodic patterns of users' requests in addition to the parameters such as reference count, amount of media contents delivered to the clients, and reference time. These values are collected at run-time for each cached object. In order to adequately and promptly adopt to the changing characteristics of users preferences, the policy introduces, in particular, the concept of weighted-window for replacement with which higher priorities are given to more recently referenced media contents and consequently they are less likely to be replaced. We present and analyze the simulation results showing that the proposed policy has outperformed the conventional replacement policies such as LRU, LFU, and SEG in terms of hit ratio, byte-hit ratio, delayed start, and cache input.

AB - This paper presents a cache replacement policy which has specifically been developed for the efficient media caching in streaming media cache servers. For efficient media caching, the proposed policy takes into account the periodic patterns of users' requests in addition to the parameters such as reference count, amount of media contents delivered to the clients, and reference time. These values are collected at run-time for each cached object. In order to adequately and promptly adopt to the changing characteristics of users preferences, the policy introduces, in particular, the concept of weighted-window for replacement with which higher priorities are given to more recently referenced media contents and consequently they are less likely to be replaced. We present and analyze the simulation results showing that the proposed policy has outperformed the conventional replacement policies such as LRU, LFU, and SEG in terms of hit ratio, byte-hit ratio, delayed start, and cache input.

UR - http://www.scopus.com/inward/record.url?scp=27844528942&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=27844528942&partnerID=8YFLogxK

U2 - 10.1016/j.sysarc.2005.02.006

DO - 10.1016/j.sysarc.2005.02.006

M3 - Article

AN - SCOPUS:27844528942

VL - 52

SP - 25

EP - 40

JO - Journal of Systems Architecture

JF - Journal of Systems Architecture

SN - 1383-7621

IS - 1

ER -