Abstract
We study the problem of page replication in ring networks. The goal is to determine a set of nodes which should contain a page of read-only data in their local memories so that the total cost of accessing data is lowest possible. We prove a lower bound on the competitive ratio of any deterministic on-line algorithm in large uniform rings which approaches 2.31023 as the page size and the number of nodes go to infinity. We present a \( (3 + \sqrt 3 )/2 \approx \) 2.36603-competitive deterministic on-line algorithm for the 4-node uniform ring. We also show a matching lower bound for any deterministic on-line algorithm in this topology. Our results disprove the conjecture of Black and Sleator (1989) for the lower bound of 2.5.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Albers, S., Koga H.: New On-line Algorithms for the Page Replication Problem. Journal of Algorithms 27 (1998) 75–96
Bartal, Y., Fiat, A., Rabani, Y.: Competitive Algorithms for Distributed Data Management. In: Proceedings of the 24th ACM Symposium on Theory of Computing (1992) 39–50
Black, D.L., Sleator, D.D.: Competitive Algorithms for Replication and Migration Problems. Technical Report CMU-CS-89-201, Carnegie Mellon University (1989)
Fleischer, R., Seiden, S.: Page Replication-Variations on the Theme (submitted)
Głazek, W.: On-line Algorithms for Page Replication in Rings. Presented at the ALCOM Workshop on Online Algorithms OLA’98, Udine, Italy (1998). Theoretical Computer Science (to appear)
Hutchinson, D.: Local Area Network Architectures. Addison-Wesley, Reading MA (1988)
Karlin, A.R., Manesse, M.S., Rudolph, L., Sleator, D.D.: Competitive Snoopy Caching. Algorithmica 3(1) (1988) 79–119
Koga, H.: Randomized On-line Algorithms for the Page Replication Problem. In: Proceedings of the 4th International Annual Symposium on Algorithms and Computation. Lecture Notes on Computer Science Vol. 762. Springer Verlag, Berlin Heidelberg New York (1993) 436–445
Lund, C, Reingold, N., Westbrook, J., Yan, J.: On-line Distributed Data Management. In: Proceedings of the 2nd Annual European Symposium on Algorithms. Lecture Notes in Computer Science, Vol. 855. Springer Verlag, Berlin Heidelberg New York (1994) 202–214
Raghavan, P.: Lecture Notes on Randomized Algorithms. Technical Report RC 15340 1/9/90, IBM Research Division, T.J. Watson Research Center, New York (1990)
Sleator, D.D., Tarjan, R.E.: Amortized Efficiency of List Update and Paging Rules. Communications of ACM 28 (1985) 202–208
Tel, G.: Introduction to Distributed Algorithms. Cambridge University Press, Cambridge (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Głazek, W. (1999). Lower and Upper Bounds for the Problem of Page Replication in Ring Networks. In: Kutyłowski, M., Pacholski, L., Wierzbicki, T. (eds) Mathematical Foundations of Computer Science 1999. MFCS 1999. Lecture Notes in Computer Science, vol 1672. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48340-3_25
Download citation
DOI: https://doi.org/10.1007/3-540-48340-3_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66408-6
Online ISBN: 978-3-540-48340-3
eBook Packages: Springer Book Archive