An efficient scheduling algorithm for information delivery on VoD system

DOI10.1023/B:SUPE.0000014801.65020.53MaRDI QIDQ704720zbMATH OpenOpenAlexFDO

Authors Wen-wei Mai, Sing-Ling Lee, Hann-Jang Ho

Publication date 19 January 2005

Published in The Journal of Supercomputing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:supe.0000014801.65020.53

zbMATH Keywords

delivery schedulinginformation cachingpotential value algorithmVoD

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Nonnumerical algorithms (68W05)

Recommendations

• Scheduling video streams in a large-scale video-on-demand server
• scientific article; zbMATH DE number 2036429
• Efficient algorithms for slot-scheduling and cycle-scheduling of video streams on clustered video servers
• Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ
• Optimally scheduling video-on-demand to minimize delay when sender and receiver bandwidth may differ

Cited in

(5)

• Optimal information delivery
• Models for video-on-demand scheduling with costs
• An efficient retrieval selection algorithm for video servers with random duplicated assignment storage technique.
• A window-assisted video partitioning strategy for partitioning and caching video streams in distributed multimedia systems
• Algorithms and Computation

This page was built for publication: An efficient scheduling algorithm for information delivery on VoD system

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