Logarithmic Characteristic of Replica Placement Algorithms

Ming TANG; Bu-Sung LEE

Logarithmic Characteristic of Replica Placement Algorithms

Ming TANG, Bu-Sung LEE

Full Text Views

0

Cite this

Summary :

The technique of replica placement has been extensively employed to improve client perceived performance and disperse server workload. In this paper, we study some well-known algorithms of replica placement on the network and observe the logarithmic relationship between replica number and total access cost. Numerous simulations are done and it is found that some replica algorithms obey the logarithmic relationship with high correlation coefficients. A logrithmic function is proposed about replica number and total access cost. The logarithmic relationship is applied to the minimum facility problem and a function is deduced to get the optimal replica number.

Publication: IEICE TRANSACTIONS on Communications Vol.E86-B No.7 pp.2227-2231

Publication Date: 2003/07/01

Publicized

Online ISSN

DOI

Type of Manuscript: LETTER

Category: Network Management/Operation

Cite this

Copy

Ming TANG, Bu-Sung LEE, "Logarithmic Characteristic of Replica Placement Algorithms" in IEICE TRANSACTIONS on Communications, vol. E86-B, no. 7, pp. 2227-2231, July 2003, doi: .
Abstract: The technique of replica placement has been extensively employed to improve client perceived performance and disperse server workload. In this paper, we study some well-known algorithms of replica placement on the network and observe the logarithmic relationship between replica number and total access cost. Numerous simulations are done and it is found that some replica algorithms obey the logarithmic relationship with high correlation coefficients. A logrithmic function is proposed about replica number and total access cost. The logarithmic relationship is applied to the minimum facility problem and a function is deduced to get the optimal replica number.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e86-b_7_2227/_p

Copy

@ARTICLE{e86-b_7_2227,
author={Ming TANG, Bu-Sung LEE, },
journal={IEICE TRANSACTIONS on Communications},
title={Logarithmic Characteristic of Replica Placement Algorithms},
year={2003},
volume={E86-B},
number={7},
pages={2227-2231},
abstract={The technique of replica placement has been extensively employed to improve client perceived performance and disperse server workload. In this paper, we study some well-known algorithms of replica placement on the network and observe the logarithmic relationship between replica number and total access cost. Numerous simulations are done and it is found that some replica algorithms obey the logarithmic relationship with high correlation coefficients. A logrithmic function is proposed about replica number and total access cost. The logarithmic relationship is applied to the minimum facility problem and a function is deduced to get the optimal replica number.},
keywords={},
doi={},
ISSN={},
month={July},}

Copy

TY - JOUR
TI - Logarithmic Characteristic of Replica Placement Algorithms
T2 - IEICE TRANSACTIONS on Communications
SP - 2227
EP - 2231
AU - Ming TANG
AU - Bu-Sung LEE
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E86-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 2003
AB - The technique of replica placement has been extensively employed to improve client perceived performance and disperse server workload. In this paper, we study some well-known algorithms of replica placement on the network and observe the logarithmic relationship between replica number and total access cost. Numerous simulations are done and it is found that some replica algorithms obey the logarithmic relationship with high correlation coefficients. A logrithmic function is proposed about replica number and total access cost. The logarithmic relationship is applied to the minimum facility problem and a function is deduced to get the optimal replica number.
ER -