Online strategies for backups
Journal article, 2002

We consider strategies for backups from the viewpoint of competitive analysis of online problems. We concentrate upon the realistic case that faults are rare, i.e. the cost of work between two faults is typically large compared to the cost of one backup. Instead of the (worst-case) competitive ratio we use a refined and more expressive quality measure, in terms of the average fault frequency. The interesting matter is, roughly speaking, to adapt the backup frequency to the fault frequency, while future faults are unpredictable. We give an asymptotically optimal deterministic strategy and propose a randomized strategy whose expected cost beats the deterministic bound.

nonstandard competitive analysis

online problems

backup costs

randomized strategy


Peter Damaschke

Chalmers, Department of Computing Science, Algorithms

Theoretical Computer Science

0304-3975 (ISSN)

Vol. 285 1 43-53

Subject Categories

Computer and Information Science



More information