Name
Abstract | ||
|---|---|---|
Disaster recovery (DR) is an extremely important solution for all organizations. All DR solutions have a myriad of solution specific tweaks, however, each of them have a set of common underlying routine processes/tasks, namely, i) data backup/archive, ii) secondary/offsite replica generation, iii) data migration across storage pools, iv) metadata expiration and v) tape-reclamation. A complete solution needs to judiciously run the above mentioned tasks in the most effective manner. The problem of architecting a balanced schedule considering the constraints of time and bandwidth along with the relative importance of each process/task is a non-trivial one. Designing of schedules is a labor intensive task and often the schedules are far from optimal. In this work we have proposed a solution which automatically generates the most beneficial schedule based on an optimization problem with resource outage risk minimization as the objective and available time and resource capacities as the constraints. The solution is driven by models of the common underlying processes and their relative importance to keep the service up and running. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/INM.2007.374818 | Integrated Network Management |
Keywords | Field | DocType |
adaptive scheduling,distributed processing,operating systems (computers),security of data,adaptive scheduling,automated management,disaster recovery systems,resource outage risk minimization | Metadata,Replica,Computer science,Scheduling (computing),Schedule,Optimization problem,Backup,Data migration,Disaster recovery,Distributed computing | Conference |
ISBN | Citations | PageRank |
1-4244-0799-0 | 2 | 0.42 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tapan K Nayak | 1 | 21 | 3.93 |
| Upendra Sharma | 2 | 2 | 0.42 |