Resource minimization method satisfying delay constraint for replicating large contents

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

研究成果: Article査読

抄録

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).

本文言語English
ページ(範囲)3102-3110
ページ数9
ジャーナルIEICE Transactions on Communications
E92-B
10
DOI
出版ステータスPublished - 2009 10

ASJC Scopus subject areas

  • ソフトウェア
  • コンピュータ ネットワークおよび通信
  • 電子工学および電気工学

フィンガープリント

「Resource minimization method satisfying delay constraint for replicating large contents」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル