Abstract
We study the online page replication problem. We present a new randomized algorithm for rings which is 2.37297-competitive, improving the best previous result of 3.16396. We also show that no randomized algorithm is better than 1.75037-competitive on the ring; previously, only a 1.58198 bound for a single edge was known. We extend the problem in several new directions: continuous metrics, variable size requests, and replication before service. Finally, we give simplified roofs of several known results.
Cite
CITATION STYLE
Fleischer, R., & Seiden, S. (2000). New results for online page replication. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1913, pp. 144–154). Springer Verlag. https://doi.org/10.1007/3-540-44436-x_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
