Optimal replica placement on transparent replication proxies for read/write data

Jianliang Xu; Bo Li; Dik L. Lee

doi:10.1109/IPCCC.2002.995141

Optimal replica placement on transparent replication proxies for read/write data

Jianliang Xu^*
, Bo Li
, Dik L. Lee

^*Corresponding author for this work

Department of Computer Science

Research output: Chapter in book/report/conference proceeding › Conference proceeding › peer-review

2 Citations (Scopus)

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 examine for read/write applications 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_oP_oM²) respectively. Numerical results show that the proposed solutions are very efficient.

Original language	English
Title of host publication	Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference (Cat. No.02CH37326)
Editors	Mathew A. Diethelm, Abdelsalam (Sumi) Helal, Darrell D. E. Long, Linda F. Wilson, Guoliang Xue
Publisher	IEEE
Pages	103-110
Number of pages	8
ISBN (Print)	0780373715
DOIs	https://doi.org/10.1109/IPCCC.2002.995141
Publication status	Published - 3 Apr 2002
Event	21st IEEE International Performance, Computing, and Communications Conference - Phoenix, AZ, United States Duration: 3 Apr 2002 → 5 Apr 2002

Publication series

Name	Edit IEEE International Performance, Computing, and Communications Conference
Publisher	IEEE
ISSN (Print)	1097-2641

Conference

Conference	21st IEEE International Performance, Computing, and Communications Conference
Country/Territory	United States
City	Phoenix, AZ
Period	3/04/02 → 5/04/02

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 9 Industry, Innovation, and Infrastructure

Access to Document

10.1109/IPCCC.2002.995141

Cite this

Xu, J., Li, B., & Lee, D. L. (2002). Optimal replica placement on transparent replication proxies for read/write data. In M. A. Diethelm, A. Helal, D. D. E. Long, L. F. Wilson, & G. Xue (Eds.), Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference (Cat. No.02CH37326) (pp. 103-110). (Edit IEEE International Performance, Computing, and Communications Conference ). IEEE. https://doi.org/10.1109/IPCCC.2002.995141

Xu, Jianliang ; Li, Bo ; Lee, Dik L. / Optimal replica placement on transparent replication proxies for read/write data. Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference (Cat. No.02CH37326). editor / Mathew A. Diethelm ; Abdelsalam (Sumi) Helal ; Darrell D. E. Long ; Linda F. Wilson ; Guoliang Xue. IEEE, 2002. pp. 103-110 (Edit IEEE International Performance, Computing, and Communications Conference ).

@inproceedings{ad79c2f4ea73469b92b69ddac6249b1e,

title = "Optimal replica placement on transparent replication proxies for read/write data",

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 examine for read/write applications 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 + NoPoM2) respectively. Numerical results show that the proposed solutions are very efficient.",

author = "Jianliang Xu and Bo Li and Lee, \{Dik L.\}",

note = "The work was supported in part by the Research Grant Council, Hong Kong SAR, China under grant numbers HKUST-6154/983, HKUST-6163/00E, and HKUST-6241/00E. Publisher copyright: {\textcopyright} 2002 IEEE; 21st IEEE International Performance, Computing, and Communications Conference ; Conference date: 03-04-2002 Through 05-04-2002",

year = "2002",

month = apr,

day = "3",

doi = "10.1109/IPCCC.2002.995141",

language = "English",

isbn = "0780373715",

series = "Edit IEEE International Performance, Computing, and Communications Conference ",

publisher = "IEEE",

pages = "103--110",

editor = "Diethelm, \{Mathew A.\} and Helal, \{Abdelsalam (Sumi)\} and Long, \{Darrell D. E.\} and Wilson, \{Linda F.\} and Guoliang Xue",

booktitle = "Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference (Cat. No.02CH37326)",

address = "United States",

}

Xu, J, Li, B & Lee, DL 2002, Optimal replica placement on transparent replication proxies for read/write data. in MA Diethelm, A Helal, DDE Long, LF Wilson & G Xue (eds), Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference (Cat. No.02CH37326). Edit IEEE International Performance, Computing, and Communications Conference , IEEE, pp. 103-110, 21st IEEE International Performance, Computing, and Communications Conference, Phoenix, AZ, United States, 3/04/02. https://doi.org/10.1109/IPCCC.2002.995141

Optimal replica placement on transparent replication proxies for read/write data. / Xu, Jianliang; Li, Bo; Lee, Dik L.
Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference (Cat. No.02CH37326). ed. / Mathew A. Diethelm; Abdelsalam (Sumi) Helal; Darrell D. E. Long; Linda F. Wilson; Guoliang Xue. IEEE, 2002. p. 103-110 (Edit IEEE International Performance, Computing, and Communications Conference ).

Research output: Chapter in book/report/conference proceeding › Conference proceeding › peer-review

TY - GEN

T1 - Optimal replica placement on transparent replication proxies for read/write data

AU - Xu, Jianliang

AU - Li, Bo

AU - Lee, Dik L.

PY - 2002/4/3

Y1 - 2002/4/3

N2 - 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 examine for read/write applications 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 + NoPoM2) respectively. Numerical results show that the proposed solutions are very efficient.

AB - 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 examine for read/write applications 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 + NoPoM2) respectively. Numerical results show that the proposed solutions are very efficient.

UR - https://www.scopus.com/pages/publications/0036082345

U2 - 10.1109/IPCCC.2002.995141

DO - 10.1109/IPCCC.2002.995141

M3 - Conference proceeding

AN - SCOPUS:0036082345

SN - 0780373715

T3 - Edit IEEE International Performance, Computing, and Communications Conference

SP - 103

EP - 110

BT - Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference (Cat. No.02CH37326)

A2 - Diethelm, Mathew A.

A2 - Helal, Abdelsalam (Sumi)

A2 - Long, Darrell D. E.

A2 - Wilson, Linda F.

A2 - Xue, Guoliang

PB - IEEE

T2 - 21st IEEE International Performance, Computing, and Communications Conference

Y2 - 3 April 2002 through 5 April 2002

ER -

Xu J, Li B, Lee DL. Optimal replica placement on transparent replication proxies for read/write data. In Diethelm MA, Helal A, Long DDE, Wilson LF, Xue G, editors, Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference (Cat. No.02CH37326). IEEE. 2002. p. 103-110. (Edit IEEE International Performance, Computing, and Communications Conference ). doi: 10.1109/IPCCC.2002.995141

Optimal replica placement on transparent replication proxies for read/write data

Abstract

Publication series

Conference

UN SDGs

Access to Document

Other files and links

Fingerprint

Cite this