The K-Server Problem with Distinguishable Servers

This report gives a survey of existing results in the eld of on-line k-server algorithms and presents some new ndings. The survey includes optimal on-line algorithms for k servers on a line or a tree, an optimal on-line algorithm for 2 servers in any metric space, and an optimal on-line algorithm for n 1 servers in a metric space with n points