{"title":"Periodic and random incremental backup policies in reliability theory","authors":"Xufeng Zhao, Yilei Bu, Wendi Pang, Jiajia Cai","doi":"10.1007/s11219-024-09685-1","DOIUrl":null,"url":null,"abstract":"<p>For a 24/7 database system, backups should be implemented right after a large volume of data has been updated, putting their backup windows in non-busy states with user’s convenience.From this viewpoint, this paper studies periodic and random incremental backup policies, in which, incremental backup is implemented right after data update and full backup is performed at periodic times <span>\\(\\varvec{KT}\\)</span>, or at a number <span>\\(\\varvec{N}\\)</span> of data updates, respectively. We firstly describe the stochastic processes of data update and database failure, and then model the expected cost rates for data backup and data restoration.Respective <span>\\(\\varvec{K^*, N^*, K_f^*}\\)</span>, and <span>\\(\\varvec{N_f^*}\\)</span> are obtained to minimize their expected cost rates in analytical ways, respectively. Finally, numerical examples are given to illustrate the optimum policies.</p>","PeriodicalId":21827,"journal":{"name":"Software Quality Journal","volume":"85 1","pages":""},"PeriodicalIF":1.7000,"publicationDate":"2024-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Software Quality Journal","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s11219-024-09685-1","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0
Abstract
For a 24/7 database system, backups should be implemented right after a large volume of data has been updated, putting their backup windows in non-busy states with user’s convenience.From this viewpoint, this paper studies periodic and random incremental backup policies, in which, incremental backup is implemented right after data update and full backup is performed at periodic times \(\varvec{KT}\), or at a number \(\varvec{N}\) of data updates, respectively. We firstly describe the stochastic processes of data update and database failure, and then model the expected cost rates for data backup and data restoration.Respective \(\varvec{K^*, N^*, K_f^*}\), and \(\varvec{N_f^*}\) are obtained to minimize their expected cost rates in analytical ways, respectively. Finally, numerical examples are given to illustrate the optimum policies.
期刊介绍:
The aims of the Software Quality Journal are:
(1) To promote awareness of the crucial role of quality management in the effective construction of the software systems developed, used, and/or maintained by organizations in pursuit of their business objectives.
(2) To provide a forum of the exchange of experiences and information on software quality management and the methods, tools and products used to measure and achieve it.
(3) To provide a vehicle for the publication of academic papers related to all aspects of software quality.
The Journal addresses all aspects of software quality from both a practical and an academic viewpoint. It invites contributions from practitioners and academics, as well as national and international policy and standard making bodies, and sets out to be the definitive international reference source for such information.
The Journal will accept research, technique, case study, survey and tutorial submissions that address quality-related issues including, but not limited to: internal and external quality standards, management of quality within organizations, technical aspects of quality, quality aspects for product vendors, software measurement and metrics, software testing and other quality assurance techniques, total quality management and cultural aspects. Other technical issues with regard to software quality, including: data management, formal methods, safety critical applications, and CASE.