Heat and Dump: competitive distributed paging
Baruch Awerbuch, Y. Bartal, Amos Fiat · 2002
This paper gives a randomized competitive distributed paging algorithm called Heat and Dump, The competitive ratio is logarithmic in the total storage capacity of the network, this is optimal to within a constant factor. This is in contrast to the linear optimal deterministic competitive ratio.>