Optimal algorithms for page migration in dynamic networks

DOI10.1016/J.JDA.2008.07.006MaRDI QIDQ1044046zbMATH OpenOpenAlexFDO

Authors Marcin Bienkowski, Jaroslaw Byrka, Miroslaw Korzeniowski, Friedhelm Meyer auf der Heide

Publication date 10 December 2009

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/j.jda.2008.07.006

zbMATH Keywords

data managementdynamic networksonline algorithmspage migrationrandomized algorithms

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27)

Recommendations

• STACS 2005
• A \(3 + \Omega (1)\) lower bound for page migration
• Asymptotically optimal online page migration on three points
• scientific article; zbMATH DE number 5257110
• On page migration and other relaxed task systems

Cites work

• A better lower bound on the competitive ratio of the randomized 2-server problem
• Algorithms – ESA 2005
• Competitive algorithms for distributed data management.
• Competitive distributed file allocation
• Competitive On-Line Algorithms for Distributed Data Management
• Distributed Paging for General Networks
• scientific article; zbMATH DE number 1670537 (Why is no real title available?)
• scientific article; zbMATH DE number 65703 (Why is no real title available?)
• scientific article; zbMATH DE number 193053 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 2086372 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2005
• New On-Line Algorithms for the Page Replication Problem
• New results for online page replication
• On page migration and other relaxed task systems
• Online algorithms for page replication in rings
• Page Migration Algorithms Using Work Functions
• STACS 2005

Cited in

(8)

• Monge strikes again: Optimal placement of web proxies in the internet
• A \(3 + \Omega (1)\) lower bound for page migration
• Asymptotically optimal online page migration on three points
• Page Migration Algorithms Using Work Functions
• scientific article; zbMATH DE number 5257110 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2005
• STACS 2005
• Cost thresholds for dynamic resource location

This page was built for publication: Optimal algorithms for page migration in dynamic networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044046)