Optimal scheduling for parallel CBR video servers
From MaRDI portal
conflict-free schedulingconstant bit rate (CBR)large-scale VoDQuality of Service (QoS)video serversvideo streams
Computing methodologies and applications (68U99) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Network design and communication in computer systems (68M10)
Recommendations
- scientific article; zbMATH DE number 2090672
- Efficient algorithms for slot-scheduling and cycle-scheduling of video streams on clustered video servers
- Scheduling video streams in a large-scale video-on-demand server
- scientific article; zbMATH DE number 1206104
- scientific article; zbMATH DE number 2080126
- Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ
- A simple distributed scheduling policy for parallel interactive continuous media servers
Cited in
(5)- Odyssey: a high-performance clustered video server
- Models for video-on-demand scheduling with costs
- Efficient algorithms for slot-scheduling and cycle-scheduling of video streams on clustered video servers
- scientific article; zbMATH DE number 2090672 (Why is no real title available?)
- CEA: a cyclic expansion algorithm for data migration in parallel video servers
This page was built for publication: Optimal scheduling for parallel CBR video servers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1857263)