Email this article UNIVERSAL METHOD OF DATA RESTORATION USING BACKUPS WITH OPTIMIZATION FOR SPEED
- Authors: Kazakov VG1, Fedosin SA1, Kazakov VG1, Fedosin SA1
-
Affiliations:
- Issue: Vol 7, No 4 (2009)
- Pages: 83-89
- Section: Articles
- URL: https://journals.eco-vector.com/2073-3909/article/view/55622
- ID: 55622
Cite item
Full Text
Abstract
In this paper we examine the problem of creating a universal recovery method in backup systems. This document presents mathematical model of
data restoration process. Different factors that influence performance have been analyzed. Various algorithms of the graph theory are investigated and the choice is justified. Recommendations for implementation of the proposed algorithms are presented. Then the paper describes designed universal method of data restoration with optimization for speed.
data restoration process. Different factors that influence performance have been analyzed. Various algorithms of the graph theory are investigated and the choice is justified. Recommendations for implementation of the proposed algorithms are presented. Then the paper describes designed universal method of data restoration with optimization for speed.
References
- Казаков В.Г. Избыточность в алгоритмах резервного копирования // Системы управления и информационные технологии. 2.2(36), 2009. - С. 252-256.
- Kurmas Z., Chervenak A. Evaluating backup algorithms // Proc. of the Eighth Goddard Conference on Mass Storage Systems and Technologies. 2000. URL: www.cis.gvsu.edu/ <http://www.cis.gvsu.edu/>/~kurmasz/papers/kurmas-MSS00.pdf (дата обращения 05.10.2009).
- Казаков В.Г., Федосин С.А. Метод моделирования алгоритмов резервного копирования для получения оценок объема репозитория // ИКТ. Т.6, №3, 2008. - С. 126-132.
- Kazakov V.G., Fedosin S.A. Selecting the Optimal Recovery Path in Backup Systems // Innovations and Advances in Computer Sciences and Engineering. Ed. Sobh, Tarek. Springer, 2009.
- Глушков, В. М. Синтез цифровых автоматов М.: ГИФМЛ, 1962. - 238 с.
- Pascoal M. M. B. Implementations and empirical comparison for K shortest loopless path algorithms // The Ninth DIMACS Implementation Challenge: The Shortest Path Problem. 2006. URL: <http://> www.dis.uniroma1.it/~challenge9/papers/pascoal. pdf (дата обращения 04.10.2009).
- Емеличев В.А., Мельников О. И., Сарванов В. И., Тышкевич Р. И. Лекции по теории графов. М.: Наука, 1990. - 384 с.
- Yen J.Y. Finding the K shortest loopless paths in a network // Management Science. №17, 1971. -Р. 712-716.
Supplementary files
