For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Logarithmic Characteristic of Replica Placement Algorithms
Ming TANG Bu-Sung LEE
IEICE TRANSACTIONS on Communications
Publication Date: 2003/07/01
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Network Management/Operation
replica placement, logarithmic, linear regression,
Full Text: PDF>>
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.