Abstract
We present a general framework for the development of on-line algorithms for data management in networks. These algorithms dynamically create and delete copies of shared data objects that can be read or written by the nodes in the network. Our algorithms aim to minimize the congestion (i.e., the maximum communication load over all network resources) while respecting memory capacity constraints, so that none of the links in the network become a communication bottleneck.
This work is conducted as part of the project A2 “Universal Basic Services” of the SFB 376 “Massively Parallel Computing: Algorithms, Design Methods, Applications”.
Supported by DFG-Sonderforschungsbereich 376 “Massively Parallel Computing: Algorithms, Design Methods, Applications“.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
B. Awerbuch, Y. Bartal, and A. Fiat. Competitive distributed file allocation. In Proc. of the 25th ACM Symp. on Theory of Computing (STOC), pages 164–173, 1993.
B. Awerbuch, Y. Bartal, and A. Fiat. Distributed paging for general networks. Journal of Algorithms, 28: 67–104, 1998.
B. Awerbuch and D. Peleg. Sparse partitions. In Proc. of the 31 th IEEE Symp. on Foundations of Computer Science (FOCS), pages 503–513, 1990.
L. A. Belady. A study of replacement algorithms. IBM Systems Journal, 5: 78–101, 1966.
A. Fiat, R. M. Karp., M. Luby, L. A. McGeoch, D. D. Sleator, and N. E. Young. Competitive paging algorithms. Journal of Algorithms, 12 (2): 685–699, 1991.
P. A. Franaszek and T. J. Wagner. Some distribution-free aspects of paging performace. Journal of the ACM, 21: 31–39, 1974.
C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, and M. Westermann. Data management in networks: Experimental evaluation of a provably good strategy. In Proc. of the 11th ACM Symp. on Parallel Algorithms and Architectures (SPAA), 1999.
B. M. Maggs, F. Meyer auf der Heide, B. Vöcking, and M. Westermann. Exploiting locality for networks of limited bandwidth. In Proc. of the 38th IEEE Symp. on Foundations of Computer Science (FOCS), pages 284–293, 1997.
L. A. McGeoch and D. D. Sleator. A strongly competitive randomized paging algorithm. Algorithmica, 6 (6): 816–825, 1991.
F. Meyer auf der Heide, B. Vöcking, and M. Westermann. Caching in networks. Manuscript, 1999.
F. Meyer auf der Heide, B. Vöcking, and M. Westermann. Provably good and practical strategies for non-uniform data management in networks. In Proc. of the 7th European Symposium on Algorithms (ESA), 1999.
P. Raghavan and M. Snir. Memory versus randomization in on-line algorithms. IBM Journal of Research and Development, 38 (6): 683–707, 1994.
D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28 (2): 202–208, 1985.
J. R. Spirn. Program Behavior: Models and Measurements. Elsevier Computer Science Library. Elsevier, Amsterdam, 1977.
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
Westermann, M. (1999). Caching in Networks. In: Beiersdörfer, K., Engels, G., Schäfer, W. (eds) Informatik’99. Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-01069-3_42
Download citation
DOI: https://doi.org/10.1007/978-3-662-01069-3_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66450-5
Online ISBN: 978-3-662-01069-3
eBook Packages: Springer Book Archive