TCP dynamic acknowledgment delay (extended abstract): theory and practice
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Online computation and competitive analysis
Online computation and competitive analysis
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
| Hi-index | 0.00 |
We consider strategies for full 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 (worstcase) competitive ratio we use a refined and more expressive quality measure, in terms of the average fault frequency. This is not standard in the online algorithm literature. 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.