Incremental Digital Content Object Delivering in Distributed Systems

Lung-Pin CHEN  I-Chen WU  William CHU  Jhen-You HONG  Meng-Yuan HO  

IEICE TRANSACTIONS on Information and Systems   Vol.E93-D   No.6   pp.1512-1520
Publication Date: 2010/06/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.E93.D.1512
Print ISSN: 0916-8532
Type of Manuscript: PAPER
Category: Data Engineering, Web Information Systems
content delivery network,  incremental algorithm,  maximum flow,  

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

Deploying and managing content objects efficiently is critical for building a scalable and transparent content delivery system. This paper investigates the advanced incremental deploying problem of which the objects are delivered in a successive manner. Recently, the researchers show that the minimum-cost content deployment can be obtained by reducing the problem to the well-known network flow problem. In this paper, the maximum flow algorithm for a single graph is extended to the incremental growing graph. Based on this extension, an efficient incremental content deployment algorithm is developed in this work.