This diploma thesis deals with backup for big volumes of data. Data backup is a overlooked area of information technology and the data can be lost by trivial user error or breakdown on any components. In this thesis is discussed theory of backup - archive bit and his behavior based on various type of backup (full, incremental, differential or combination thereof), duration and frequency of backups or the point of ultimate recovery. In addition there are mentioned rotation schemes Round-Robin, GFS and Tower of Hanoi, where are described their principles and graphic diagram of rotation. In chapter Strategy of backup describes the backup strategy via choosing the right choice, taking into technical and economic parameters. Impact analysis, which is explained also in this chapter, describes the important moments in data recovery. For select the optimal strategy is necessary to consider not only the whole capacity of the backup data, but also the size of the backup window for data storage or storage location. In chapter Media storage you can acquainted with all backup media and their technical parameters that are available on the market and can be used for data backup. In section Guide methodology of large volumes of data backup is designed a backup plan with the necessary inputs for the actual implementation of the backup. The design methodology puts emphasis on regular backups and check their location. On practical demonstration is shown that the rotation scheme Tower of Hanoi are among the smallest need for backup media. A part of this thesis is also design of methodology for backup small amounts of data.
Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:219766 |
Date | January 2012 |
Creators | Bartoňová, Veronika |
Contributors | Vychodil, Petr, Burda, Karel |
Publisher | Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií |
Source Sets | Czech ETDs |
Language | Czech |
Detected Language | English |
Type | info:eu-repo/semantics/masterThesis |
Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.0016 seconds