A Replica Placement Algorithm reducing Time Complexity 


Vol. 11,  No. 3, pp. 345-352, Jun.  2004
10.3745/KIPSTC.2004.11.3.345


PDF
  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
  Cite this article

[IEEE Style]

S. H. Kim, M. Y. Yoon, Y. T. Shin, "A Replica Placement Algorithm reducing Time Complexity," The KIPS Transactions:PartC, 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. The KIPS Transactions:PartC, 11, 3, (2004), 345-352. DOI: 10.3745/KIPSTC.2004.11.3.345.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals