The Study and Implementation of Incremental Content Object Deploying Algorithms

• Main Authors: Jhen-You Hong, 洪振祐
• Other Authors: Lung-Pin Chen
• Format: Others
• Language: en_US
• Published: 2009
• Online Access: http://ndltd.ncl.edu.tw/handle/48751253884495391416

碩士 === 東海大學 === 資訊工程與科學系 === 97 === Deploying and managing content objects efficiently is critical for building a scalable and transparent content delivery system. This paper investigates the advanced incremental version of the content deployment 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 problem for a single graph is extended to an incremental growing graph. We show that the time complexity of deriving k maximum flow values of incremental graphs N1,N2,..,Nk is no more than that of the single graph Nk.Based on this property, this work develops an efficient algorithm for incrementally deploying content objects over networks.