Resource Minimization Method Satisfying Delay Constraint for Replicating Large Contents

Sho SHIMIZU  Hiroyuki ISHIKAWA  Yutaka ARAKAWA  Naoaki YAMANAKA  Kosuke SHIBA  

Publication
IEICE TRANSACTIONS on Communications   Vol.E92-B   No.10   pp.3102-3110
Publication Date: 2009/10/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E92.B.3102
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Fundamental Theories for Communications
Keyword: 
content delivery network,  replica placement,  dynamically reconfigurable processor,  exhaustive search,  

Full Text: PDF(490.7KB)
>>Buy this Article


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