New results for online page replication

DOI10.1016/j.tcs.2004.05.017zbMath1072.68020OpenAlexW1965928044MaRDI QIDQ1887086

Rudolf Fleischer, Włodzimierz Głazek, Steve Seiden

Publication date: 23 November 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.05.017

zbMATH Keywords

Competitive analysisCachingRing networksContinuous page replication

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Related Items (1)

Optimal algorithms for page migration in dynamic networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On-line Steiner trees in the Euclidean plane
• Competitive algorithms for distributed data management.
• Online algorithms. The state of the art
• Competitive snoopy caching
• Two results on the list update problem
• Unfair problems and randomized algorithms for metrical task systems
• On-line learning and the metrical task system problem
• Dynamic Steiner Tree Problem
• New On-Line Algorithms for the Page Replication Problem
• Competitive On-Line Algorithms for Distributed Data Management
• Page Migration Algorithms Using Work Functions
• Competitive distributed file allocation
• Online algorithms for page replication in rings

This page was built for publication: New results for online page replication