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

DOI10.1016/S0196-6774(03)00045-2zbMATH Open1073.68507OpenAlexW4249689141MaRDI QIDQ4458872FDOQ4458872

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

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

zbMATH Keywords

Competitive analysisOn-line algorithmsStream mergingVideo-on-demand

Mathematics Subject Classification ID

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

Cited In (13)

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

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)