A Replica Placement Algorithm reducing Time Complexity


KIPS Transactions on Computer and Communication Systems, Vol. 11, No. 3, pp. 345-352, Mar. 2004
10.3745/KIPSTC.2004.11.3.345, Full Text:

Abstract

Recently, contents distribution technologies have been used to cope with the explosive demand for Web services. In this paper, we addressed the issue of the optimal placement of replicas in the environment where Web contents are replicated. We placed replicas so that clients can have access to replicas with the proper delay and bandwidth. We attempted to solve the problem via dynamic programming considering cost of delay and traffic. We have come up with O((n-dh)?chv) time complexity that is less than O(n2). We defined the threshold and proved that our algorithm guarantees the reliable services.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. H. Kim, M. Y. Yoon and Y. T. Shin, "A Replica Placement Algorithm reducing Time Complexity," KIPS Journal C (2001 ~ 2012) , vol. 11, no. 3, pp. 345-352, 2004. DOI: 10.3745/KIPSTC.2004.11.3.345.

[ACM Style]
Seon Ho Kim, Mi Youn Yoon, and Yong Tae Shin. 2004. A Replica Placement Algorithm reducing Time Complexity. KIPS Journal C (2001 ~ 2012) , 11, 3, (2004), 345-352. DOI: 10.3745/KIPSTC.2004.11.3.345.