Online algorithms for caching multimedia streams

DOI10.1007/3-540-45253-2_7MaRDI QIDQ2753923zbMATH OpenFDO

Authors Kamesh Munagala, Matthew Andrews

Publication date 11 November 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45253-2_7

Mathematics Subject Classification ID

Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Computing methodologies and applications (68U99)

Recommendations

• Competitive on-line stream merging algorithms for media-on-demand
• Efficient Algorithms for Optimal Stream Merging for Media-on-Demand
• Competitive on-line stream merging algorithms for media-on-demand. (Extended abstract)
• On-line algorithm of loose competitive caching
• Optimal server allocations for streaming multimedia applications on the internet
• A novel data caching scheme for multimedia servers

Cited in

(12)

• Caching policy design and cache allocation in active reliable multicast.
• An online algorithm for data caching problem in edge computing
• Periodic scheduling for cache-miss minimisation
• Shared running cache algorithm with supporting video VCR operation
• Cost-Aware Caching Algorithms for Distributed Storage Servers
• scientific article; zbMATH DE number 1953150 (Why is no real title available?)
• Network caching strategies for reservation-based multimedia services on high-speed networks
• Optimized caching in systems with heterogeneous client populations
• scientific article; zbMATH DE number 1871280 (Why is no real title available?)
• An approximate dynamic programming approach for collaborative caching
• A novel server-side proxy caching strategy for large-scale multimedia applications
• Cache-aware timing analysis of streaming applications

This page was built for publication: Online algorithms for caching multimedia streams

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