An enhanced recursive frequency splitting broadcasting algorithm for near video-on-demand services

DOI10.1016/J.IPL.2004.09.010MaRDI QIDQ834968zbMATH OpenOpenAlexFDO

Authors Yu-Wei Chen

Publication date 27 August 2009

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2004.09.010

zbMATH Keywords

broadcastingcombinatorial problemsnear video on demand

Mathematics Subject Classification ID

Internet topics (68M11)

Recommendations

• scientific article; zbMATH DE number 2172645
• SingBroad: A scheduling scheme for broadcasting continuous multimedia data over a single channel
• Generating asymptotically optimal broadcasting schedules to minimize average waiting time
• Efficient processing of requests with network coding in on-demand data broadcast environments
• scientific article; zbMATH DE number 2087659

Cited in

(3)

• SingBroad: A scheduling scheme for broadcasting continuous multimedia data over a single channel
• The minimum bandwidth required at each time slot of the fast broadcasting scheme
• scientific article; zbMATH DE number 2172645 (Why is no real title available?)

This page was built for publication: An enhanced recursive frequency splitting broadcasting algorithm for near video-on-demand services

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