Incremental Digital Content Object Delivering in Distributed Systems
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E93-D No.6 pp.1512-1520
- Publication Date
- 2010/06/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.E93.D.1512
- Type of Manuscript
- PAPER
- Category
- Data Engineering, Web Information Systems
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Lung-Pin CHEN, I-Chen WU, William CHU, Jhen-You HONG, Meng-Yuan HO, "Incremental Digital Content Object Delivering in Distributed Systems" in IEICE TRANSACTIONS on Information,
vol. E93-D, no. 6, pp. 1512-1520, June 2010, doi: 10.1587/transinf.E93.D.1512.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E93.D.1512/_p
Copy
@ARTICLE{e93-d_6_1512,
author={Lung-Pin CHEN, I-Chen WU, William CHU, Jhen-You HONG, Meng-Yuan HO, },
journal={IEICE TRANSACTIONS on Information},
title={Incremental Digital Content Object Delivering in Distributed Systems},
year={2010},
volume={E93-D},
number={6},
pages={1512-1520},
abstract={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.},
keywords={},
doi={10.1587/transinf.E93.D.1512},
ISSN={1745-1361},
month={June},}
Copy
TY - JOUR
TI - Incremental Digital Content Object Delivering in Distributed Systems
T2 - IEICE TRANSACTIONS on Information
SP - 1512
EP - 1520
AU - Lung-Pin CHEN
AU - I-Chen WU
AU - William CHU
AU - Jhen-You HONG
AU - Meng-Yuan HO
PY - 2010
DO - 10.1587/transinf.E93.D.1512
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E93-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - June 2010
AB - 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.
ER -
English
