The CNN problem and other \(k\)-server variants

DOI10.1016/j.tcs.2004.06.002zbMath1160.68327OpenAlexW2006761101MaRDI QIDQ1887095

Elias Koutsoupias, David Scot Taylor

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.06.002

zbMATH Keywords

Online algorithms\(k\)-Server problemCNN problem

Mathematics Subject Classification ID

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

Related Items (5)

Competitive Algorithms for Generalized k -Server in Uniform Metrics ⋮ Improving LTL truck load utilization on line ⋮ Online chasing problems for regular polygons ⋮ A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem ⋮ Memoryless algorithms for the generalized k-server problem on uniform metrics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Shortest paths without a map
• Competitive snoopy caching
• Competitive \(k\)-server algorithms
• Competitive algorithms for the weighted server problem
• On the k-server conjecture
• An Optimal On-Line Algorithm for K Servers on Trees
• New Ressults on Server Problems
• Competitive algorithms for server problems
• A New Approach to the Server Problem
• Balanced Allocations
• An optimal on-line algorithm for metrical task system
• The harmonic k -server algorithm is competitive

This page was built for publication: The CNN problem and other \(k\)-server variants