Abstract
HARMONIC is a randomized k -server algorithm that chooses the servers with probabilities proportional to the inverses of distances to the request point. We present a simple proof that HARMONIC is 3-competitive for k=2 .
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
