Models for video-on-demand scheduling with costs

DOI10.1007/S13675-015-0059-2zbMATH Open1356.68025OpenAlexW2273888011MaRDI QIDQ286685FDOQ286685

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)

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

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

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)

Cites Work

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

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)