Competitiveness
For request sequence Ρ = r1,r2,... consider
costΛ(Ρ): the cost on Ρ achieved by the servers of our online algorithm Λ
costopt(Ρ): the cost on Ρ achieved by the server of an optimal offline algorithm
We say that a [randomized] algorithm is C-competitive if for each sequence Ρ we have
E costΛ(Ρ) ≤ C. costopt(Ρ) + λ
where λ depends only on the initial configuration
|