Competitive on-line stream merging algorithms for media-on-demand

DOI10.1016/S0196-6774(03)00045-2MaRDI QIDQ4458872zbMATHOpenAlexFDO

Authors Amotz Bar-Noy, Richard E. Ladner

Publication date 14 March 2004

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

Full work available at URL https://doi.org/10.1016/s0196-6774(03)00045-2

zbMATH Keywords

Competitive analysisOn-line algorithmsStream mergingVideo-on-demand

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12)

Recommendations

• Competitive on-line stream merging algorithms for media-on-demand. (Extended abstract)
• On-line stream merging in a general setting.
• Efficient Algorithms for Optimal Stream Merging for Media-on-Demand
• scientific article; zbMATH DE number 1929937
• The Dyadic Stream Merging Algorithm

Cited in

(13)

• A NEAR-OPTIMAL BROADCASTING PROTOCOL FOR MOBILE VIDEO-ON-DEMAND
• scientific article; zbMATH DE number 2011846 (Why is no real title available?)
• Efficient Algorithms for Optimal Stream Merging for Media-on-Demand
• scientific article; zbMATH DE number 1798170 (Why is no real title available?)
• scientific article; zbMATH DE number 1929937 (Why is no real title available?)
• Competitive FIB aggregation for independent prefixes: online ski rental on the trie
• Competitive on-line stream merging algorithms for media-on-demand. (Extended abstract)
• Off-line and on-line guaranteed start-up delay for media-on-demand with stream merging
• On-line stream merging in a general setting.
• On-line stream merging with max span and min coverage
• The Dyadic Stream Merging Algorithm
• Competitive on-line scheduling of continuous-media streams
• scientific article; zbMATH DE number 1670647 (Why is no real title available?)

This page was built for publication: Competitive on-line stream merging algorithms for media-on-demand

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