Paging with connections: FIFO strikes again

DOI10.1016/j.tcs.2007.02.009zbMath1118.68189OpenAlexW2153533537MaRDI QIDQ884462

Jiří Sgall, Leah Epstein, Rob van Stee, Yanir Kleiman

Publication date: 6 June 2007

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

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

zbMATH Keywords

online algorithmspagingconnection caching

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05)

Related Items (1)

Resource augmented semi-online bounded space bin packing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A strongly competitive randomized paging algorithm
• Competitive snoopy caching
• LRU is better than FIFO
• More on weighted servers or FIFO is better than LRU.
• Competitive analysis of randomized paging algorithms
• Connection caching
• Competitive paging algorithms

This page was built for publication: Paging with connections: FIFO strikes again