The Community for Technology Leaders
Performance, Computing, and Communications Conference, 2002. 21st IEEE International (2002)
Phoenix, AZ, USA
Apr. 3, 2002 to Apr. 5, 2002
ISBN: 0-7803-7371-5
pp: 103-110
Jianliang Xu , Dept. of Comput. Sci., Hong Kong Univ. of Sci. & Technol., China
ABSTRACT
Data server replication is a promising technique for improving system performance in a large distributed network. Recently, transparent data replication has been gaining increasing attention due to its low management overheads incurred. However, research on replica placement strategies for transparent data replication thus far focused on read operations only. In this paper, we consider examination for read/write applications of two data replica placement problems (i.e., without and with constraint on the number of replicas respectively) for a single object on the deployed transparent replication proxies. The performance objective is to minimize the total data transfer cost for a target server under a given traffic pattern. Optimal solutions for these two problems are proposed, with complexities of O(N) and O(N+N/sub o/P/sub o/M/sup 2/) respectively. Numerical results show that the proposed solutions are very efficient.
INDEX TERMS
CITATION
Jianliang Xu, Bo Li, D.L. Lee, "Optimal replica placement on transparent replication proxies for read/write data", Performance, Computing, and Communications Conference, 2002. 21st IEEE International, vol. 00, no. , pp. 103-110, 2002, doi:10.1109/IPCCC.2002.995141
97 ms
(Ver 3.3 (11022016))