Models for video-on-demand scheduling with costs

DOI10.1007/S13675-015-0059-2MaRDI QIDQ286685zbMATH OpenOpenAlexFDO

Authors Angèle. M. Hamel, Jean-Charles Grégoire

Publication date 25 May 2016

Published in EURO Journal on Computational Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1007/s13675-015-0059-2

zbMATH Keywords

online algorithmsschedulingclairvoyantnon-clairvoyantvideo-on-demand

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• An efficient scheduling algorithm for information delivery on VoD system
• Adaptive Video on Demand
• Sharing video on demand
• Optimal scheduling for parallel CBR video servers
• An equitable bandwidth allocation model for video-on-demand networks

Cites work

• scientific article; zbMATH DE number 33204 (Why is no real title available?)
• A new upper bound 2.5545 on 2D Online Bin Packing
• A simple on-line bin-packing algorithm
• Algorithms for on-line bin-packing problems with cardinality constraints
• All-Around Near-Optimal Solutions for the Online Bin Packing Problem
• Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
• Dynamic Bin Packing
• New bounds for multidimensional packing
• Online Bin Packing with Cardinality Constraints
• Online bin packing with delay and holding costs

Cited in

(1)

• Editorial

This page was built for publication: Models for video-on-demand scheduling with costs

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