Optimal policies for a database system with two backup schemes
RAIRO - Operations Research - Recherche Opérationnelle, Tome 36 (2002) no. 3, pp. 227-235.

This paper considers two backup schemes for a database system: a database is updated at a nonhomogeneous Poisson process and an amount of updated files accumulates additively. To ensure the safety of data, full backups are performed at time $NT$ or when the total updated files have exceeded a threshold level $K$, and between them, cumulative backups as one of incremental backups are made at periodic times $iT$ $\left(i=1,2,\cdots ,N-1$). Using the theory of cumulative processes, the expected cost is obtained, and an optimal number ${N}^{*}$ of cumulative backup and an optimal level ${K}^{*}$ of updated files which minimize it are analytically discussed. It is shown as examples that optimal number and level are numerically computed when two costs of backup schemes are given.

DOI : https://doi.org/10.1051/ro:2003004
Mots clés : database, full backup, cumulative backup, cumulative process, expected cost
@article{RO_2002__36_3_227_0,
author = {Qian, Cunhua and Pan, Yu and Nakagawa, Toshio},
title = {Optimal policies for a database system with two backup schemes},
journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
pages = {227--235},
publisher = {EDP-Sciences},
volume = {36},
number = {3},
year = {2002},
doi = {10.1051/ro:2003004},
zbl = {1062.90020},
mrnumber = {1988278},
language = {en},
url = {http://www.numdam.org/articles/10.1051/ro:2003004/}
}
TY  - JOUR
AU  - Qian, Cunhua
AU  - Pan, Yu
AU  - Nakagawa, Toshio
TI  - Optimal policies for a database system with two backup schemes
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 2002
DA  - 2002///
SP  - 227
EP  - 235
VL  - 36
IS  - 3
PB  - EDP-Sciences
UR  - http://www.numdam.org/articles/10.1051/ro:2003004/
UR  - https://zbmath.org/?q=an%3A1062.90020
UR  - https://www.ams.org/mathscinet-getitem?mr=1988278
UR  - https://doi.org/10.1051/ro:2003004
DO  - 10.1051/ro:2003004
LA  - en
ID  - RO_2002__36_3_227_0
ER  - 
Qian, Cunhua; Pan, Yu; Nakagawa, Toshio. Optimal policies for a database system with two backup schemes. RAIRO - Operations Research - Recherche Opérationnelle, Tome 36 (2002) no. 3, pp. 227-235. doi : 10.1051/ro:2003004. http://www.numdam.org/articles/10.1051/ro:2003004/

[1] R.E. Barlow and F. Proschan, Mathematical Theory of Reliability. John Wiley & Sons, New York (1965). | MR 195566 | Zbl 0132.39302

[2] D.R. Cox, Renewal Theory. Methuen, London (1962). | MR 153061 | Zbl 0103.11504

[3] J.D. Esary, A.W. Marshall and F. Proschan, Shock models and wear processes. Ann. Probab. 1 (1973) 627-649. | MR 350893 | Zbl 0262.60067

[4] R.M. Feldman, Optimal replacement with semi-Markov shock models. J. Appl. Probab. 13 (1976) 108-117. | MR 395794 | Zbl 0338.60062

[5] S. Fukumoto, N. Kaio and S. Osaki, A study of checkpoint generations for a database recovery mechanism. Comput. Math. Appl. 1/2 (1992) 63-68. | Zbl 0782.68036

[6] T. Nakagawa, On a replacement problem of a cumulative damage model. Oper. Res. Quarterly 27 (1976) 895-900. | MR 421648 | Zbl 0345.90015

[7] T. Nakagawa, A summary of discrete replacement policies. Eur. J. Oper. Res. 17 (1984) 382-392. | MR 763572 | Zbl 0541.90046

[8] T. Nakagawa and M. Kijima, Replacement policies for a cumulative damage model with minimal repair at failure. IEEE Trans. Reliability 13 (1989) 581-584. | Zbl 0695.90050

[9] C.H. Qian, S. Nakamura and T. Nakagawa, Cumulative damage model with two kinds of shocks and its application to the backup policy. J. Oper. Res. Soc. Japan 42 (1999) 501-511. | MR 1733246 | Zbl 0998.90510

[10] T. Satow, K. Yasui and T. Nakagawa, Optimal garbage collection policies for a database in a computer system. RAIRO: Oper. Res. 4 (1996) 359-372. | Numdam | Zbl 0859.68018

[11] K. Suzuki and K. Nakajima, Storage management software. Fujitsu 46 (1995) 389-397.

[12] H.M. Taylor, Optimal replacement under additive damage and other failure models. Naval Res. Logist. Quarterly 22 (1975) 1-18. | MR 436984 | Zbl 0315.90026

Cité par Sources :