Metascheduling for continuous media
ACM Transactions on Computer Systems (TOCS)
Scheduling policies for an on-demand video server with batching
MULTIMEDIA '94 Proceedings of the second ACM international conference on Multimedia
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Log-time algorithms for scheduling single and multiple channel data broadcast
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
Disk load balancing for video-on-demand systems
Multimedia Systems
The scheduling of maintenance service
Discrete Applied Mathematics
Scheduling on-demand broadcasts: new metrics and algorithms
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Broadcast scheduling for information distribution
Wireless Networks
Scheduling to minimize average completion time: off-line and on-line algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Minimizing service and operation costs of periodic scheduling
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The data broadcast problem with non-uniform transmission times
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
R × W: a scheduling approach for large-scale on-demand data broadcast
IEEE/ACM Transactions on Networking (TON)
Polynomial-time approximation scheme for data broadcast
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Web traffic modeling and Web server performance analysis
ACM SIGMETRICS Performance Evaluation Review
The Maximum Factor Queue Length Batching Scheme for Video-on-Demand Systems
IEEE Transactions on Computers
Scheduling in Computer and Manufacturing Systems
Scheduling in Computer and Manufacturing Systems
The Architecture of Videotex Systems
The Architecture of Videotex Systems
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Scheduling Algorithms for the Broadcast Delivery of Multimedia Products
WECWIS '00 Proceedings of the Second International Workshop on Advance Issues of E-Commerce and Web-Based Information Systems (WECWIS 2000)
Efficient Algorithms for Scheduling Single and Multiple Channel Data Broadcast
Efficient Algorithms for Scheduling Single and Multiple Channel Data Broadcast
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Utility computing SLA management based upon business objectives
IBM Systems Journal
Multicast protocols for scalable on-demand download
Performance Evaluation
Pricing and resource provisioning for delivering E-content on-demand with multiple levels-of-service
QofIS'02/ICQT'02 Proceedings of the 3rd international conference on quality of future internet services and internet charging and QoS technologies 2nd international conference on From QoS provisioning to QoS charging
CIRCUMFLEX: a scheduling optimizer for MapReduce workloads with shared scans
ACM SIGOPS Operating Systems Review
On the optimization of schedules for MapReduce workloads in the presence of shared scans
The VLDB Journal — The International Journal on Very Large Data Bases
Hi-index | 0.00 |
We provide scheduling algorithms that attempt to maximize the profits of a broadcast-based electronic delivery service for digital products purchased, for example, at e-commerce sites on the World Wide Web. Examples of such products include multimedia objects such as CDs and DVDs. Other examples include software and, with increasing popularity, electronic books as well. We consider two separate alternatives, depending in part on the sophistication of the set-top box receiving the product at the customer end. The first, more restrictive option, assumes that the atomic unit of transmission of the product is the entire object, which must be transmitted in order from start to finish. We provide a solution based in part on a transportation problem formulation for this so-called noncyclic scheduling problem. The second alternative, which is less restrictive, assumes that the product may be transmitted cyclically in smaller segments, starting from an arbitrary point in the object. Three heuristics are provided for this difficult cyclic scheduling problem. Both scenarios assume that the broadcasts of the same digital product to multiple customers can be 驴batched.驴 We examine the effectiveness of these algorithms via simulation experiments under varying parametric assumptions. Each of the three cyclic scheduling algorithms perform better than the noncyclic algorithm. Moreover, one of the cyclic scheduling algorithms emerges as the clear winner.