Resource minimization method satisfying delay constraint for replicating large contents

Sho Shimizu, Hiroyuki Ishikawa, Yutaka Arakawa, Naoaki Yamanaka, Kosuke Shiba

Research output: Contribution to journalArticle

Abstract

How to minimize the number of mirroring resources under a QoS constraint (resource minimization problem) is an important issue in content delivery networks. This paper proposes a novel approach that takes advantage of the parallelism of dynamically reconfigurable processors (DRPs) to solve the resource minimization problem, which is NP-hard. Our proposal obtains the optimal solution by running an exhaustive search algorithm suitable for DRP. Greedy algorithms, which have been widely studied for tackling the resource minimization problem, cannot always obtain the optimal solution. The proposed method is implemented on an actual DRP and in experiments reduces the execution time by a factor of 40 compared to the conventional exhaustive search algorithm on a Pentium 4 (2.8 GHz).

Original languageEnglish
Pages (from-to)3102-3110
Number of pages9
JournalIEICE Transactions on Communications
VolumeE92-B
Issue number10
DOIs
Publication statusPublished - Jan 1 2009
Externally publishedYes

Fingerprint

Quality of service
Experiments

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Resource minimization method satisfying delay constraint for replicating large contents. / Shimizu, Sho; Ishikawa, Hiroyuki; Arakawa, Yutaka; Yamanaka, Naoaki; Shiba, Kosuke.

In: IEICE Transactions on Communications, Vol. E92-B, No. 10, 01.01.2009, p. 3102-3110.

Research output: Contribution to journalArticle

Shimizu, Sho ; Ishikawa, Hiroyuki ; Arakawa, Yutaka ; Yamanaka, Naoaki ; Shiba, Kosuke. / Resource minimization method satisfying delay constraint for replicating large contents. In: IEICE Transactions on Communications. 2009 ; Vol. E92-B, No. 10. pp. 3102-3110.
@article{5c87f87d6c6e4f4882b079dc39186ffb,
title = "Resource minimization method satisfying delay constraint for replicating large contents",
abstract = "How to minimize the number of mirroring resources under a QoS constraint (resource minimization problem) is an important issue in content delivery networks. This paper proposes a novel approach that takes advantage of the parallelism of dynamically reconfigurable processors (DRPs) to solve the resource minimization problem, which is NP-hard. Our proposal obtains the optimal solution by running an exhaustive search algorithm suitable for DRP. Greedy algorithms, which have been widely studied for tackling the resource minimization problem, cannot always obtain the optimal solution. The proposed method is implemented on an actual DRP and in experiments reduces the execution time by a factor of 40 compared to the conventional exhaustive search algorithm on a Pentium 4 (2.8 GHz).",
author = "Sho Shimizu and Hiroyuki Ishikawa and Yutaka Arakawa and Naoaki Yamanaka and Kosuke Shiba",
year = "2009",
month = "1",
day = "1",
doi = "10.1587/transcom.E92.B.3102",
language = "English",
volume = "E92-B",
pages = "3102--3110",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "10",

}

TY - JOUR

T1 - Resource minimization method satisfying delay constraint for replicating large contents

AU - Shimizu, Sho

AU - Ishikawa, Hiroyuki

AU - Arakawa, Yutaka

AU - Yamanaka, Naoaki

AU - Shiba, Kosuke

PY - 2009/1/1

Y1 - 2009/1/1

N2 - How to minimize the number of mirroring resources under a QoS constraint (resource minimization problem) is an important issue in content delivery networks. This paper proposes a novel approach that takes advantage of the parallelism of dynamically reconfigurable processors (DRPs) to solve the resource minimization problem, which is NP-hard. Our proposal obtains the optimal solution by running an exhaustive search algorithm suitable for DRP. Greedy algorithms, which have been widely studied for tackling the resource minimization problem, cannot always obtain the optimal solution. The proposed method is implemented on an actual DRP and in experiments reduces the execution time by a factor of 40 compared to the conventional exhaustive search algorithm on a Pentium 4 (2.8 GHz).

AB - How to minimize the number of mirroring resources under a QoS constraint (resource minimization problem) is an important issue in content delivery networks. This paper proposes a novel approach that takes advantage of the parallelism of dynamically reconfigurable processors (DRPs) to solve the resource minimization problem, which is NP-hard. Our proposal obtains the optimal solution by running an exhaustive search algorithm suitable for DRP. Greedy algorithms, which have been widely studied for tackling the resource minimization problem, cannot always obtain the optimal solution. The proposed method is implemented on an actual DRP and in experiments reduces the execution time by a factor of 40 compared to the conventional exhaustive search algorithm on a Pentium 4 (2.8 GHz).

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

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

U2 - 10.1587/transcom.E92.B.3102

DO - 10.1587/transcom.E92.B.3102

M3 - Article

VL - E92-B

SP - 3102

EP - 3110

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 10

ER -