Dynamic cache reconfiguration strategies for cluster-based streaming proxy

Yang Guo, Zihui Ge, Bhuvan Urgaonkar, Prashant Shenoy, Don Towsley

Research output: Contribution to journalArticle

19 Citations (Scopus)

Abstract

The high bandwidth and the relatively long-lived characteristics of digital video are key limiting factors in the wide-spread usage of streaming content over the Internet. The problem is further complicated by the fact that video popularity changes over time. In this paper, we study caching issues for a cluster-based streaming proxy in the face of changing video popularity. We show that the cache placement problem for a given video popularity is NP-complete, and propose a series of techniques to address the problem. We first introduce the dynamic first fit (DFF) algorithm that give the results close to the optimal cache placement (OCP). We then propose minimum weight perfect matching (MWPM) and swapping-based techniques that can dynamically reconfigure the cache placement to adapt to changing video popularity with minimum copying overhead. Our simulation results show that MWPM reconfiguration can reduce the copying overhead by a factor of more than two, and that swapping-based reconfiguration can further reduce the copying overhead compared to MWPM, and allow for the tradeoffs between the reconfiguration copying overhead and the proxy bandwidth utilization.

Original languageEnglish (US)
Pages (from-to)1710-1721
Number of pages12
JournalComputer Communications
Volume29
Issue number10
DOIs
StatePublished - Jun 19 2006

Fingerprint

Copying
Bandwidth
Internet

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Cite this

Guo, Yang ; Ge, Zihui ; Urgaonkar, Bhuvan ; Shenoy, Prashant ; Towsley, Don. / Dynamic cache reconfiguration strategies for cluster-based streaming proxy. In: Computer Communications. 2006 ; Vol. 29, No. 10. pp. 1710-1721.
@article{a8cecd009c3e46e2b9e257a4980c318a,
title = "Dynamic cache reconfiguration strategies for cluster-based streaming proxy",
abstract = "The high bandwidth and the relatively long-lived characteristics of digital video are key limiting factors in the wide-spread usage of streaming content over the Internet. The problem is further complicated by the fact that video popularity changes over time. In this paper, we study caching issues for a cluster-based streaming proxy in the face of changing video popularity. We show that the cache placement problem for a given video popularity is NP-complete, and propose a series of techniques to address the problem. We first introduce the dynamic first fit (DFF) algorithm that give the results close to the optimal cache placement (OCP). We then propose minimum weight perfect matching (MWPM) and swapping-based techniques that can dynamically reconfigure the cache placement to adapt to changing video popularity with minimum copying overhead. Our simulation results show that MWPM reconfiguration can reduce the copying overhead by a factor of more than two, and that swapping-based reconfiguration can further reduce the copying overhead compared to MWPM, and allow for the tradeoffs between the reconfiguration copying overhead and the proxy bandwidth utilization.",
author = "Yang Guo and Zihui Ge and Bhuvan Urgaonkar and Prashant Shenoy and Don Towsley",
year = "2006",
month = "6",
day = "19",
doi = "10.1016/j.comcom.2005.09.017",
language = "English (US)",
volume = "29",
pages = "1710--1721",
journal = "Computer Communications",
issn = "0140-3664",
publisher = "Elsevier",
number = "10",

}

Dynamic cache reconfiguration strategies for cluster-based streaming proxy. / Guo, Yang; Ge, Zihui; Urgaonkar, Bhuvan; Shenoy, Prashant; Towsley, Don.

In: Computer Communications, Vol. 29, No. 10, 19.06.2006, p. 1710-1721.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Dynamic cache reconfiguration strategies for cluster-based streaming proxy

AU - Guo, Yang

AU - Ge, Zihui

AU - Urgaonkar, Bhuvan

AU - Shenoy, Prashant

AU - Towsley, Don

PY - 2006/6/19

Y1 - 2006/6/19

N2 - The high bandwidth and the relatively long-lived characteristics of digital video are key limiting factors in the wide-spread usage of streaming content over the Internet. The problem is further complicated by the fact that video popularity changes over time. In this paper, we study caching issues for a cluster-based streaming proxy in the face of changing video popularity. We show that the cache placement problem for a given video popularity is NP-complete, and propose a series of techniques to address the problem. We first introduce the dynamic first fit (DFF) algorithm that give the results close to the optimal cache placement (OCP). We then propose minimum weight perfect matching (MWPM) and swapping-based techniques that can dynamically reconfigure the cache placement to adapt to changing video popularity with minimum copying overhead. Our simulation results show that MWPM reconfiguration can reduce the copying overhead by a factor of more than two, and that swapping-based reconfiguration can further reduce the copying overhead compared to MWPM, and allow for the tradeoffs between the reconfiguration copying overhead and the proxy bandwidth utilization.

AB - The high bandwidth and the relatively long-lived characteristics of digital video are key limiting factors in the wide-spread usage of streaming content over the Internet. The problem is further complicated by the fact that video popularity changes over time. In this paper, we study caching issues for a cluster-based streaming proxy in the face of changing video popularity. We show that the cache placement problem for a given video popularity is NP-complete, and propose a series of techniques to address the problem. We first introduce the dynamic first fit (DFF) algorithm that give the results close to the optimal cache placement (OCP). We then propose minimum weight perfect matching (MWPM) and swapping-based techniques that can dynamically reconfigure the cache placement to adapt to changing video popularity with minimum copying overhead. Our simulation results show that MWPM reconfiguration can reduce the copying overhead by a factor of more than two, and that swapping-based reconfiguration can further reduce the copying overhead compared to MWPM, and allow for the tradeoffs between the reconfiguration copying overhead and the proxy bandwidth utilization.

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

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

U2 - 10.1016/j.comcom.2005.09.017

DO - 10.1016/j.comcom.2005.09.017

M3 - Article

AN - SCOPUS:33745250985

VL - 29

SP - 1710

EP - 1721

JO - Computer Communications

JF - Computer Communications

SN - 0140-3664

IS - 10

ER -