Scheduling Algorithms for the Broadcast Delivery of Digital Products

1. Scheduling Algorithms for the Broadcast Delivery of Digital Products Joel L. Wolf, Fellow, IEEE, Mark S. Squillante, Senior Member, IEEE, John J. Turek, Member, IEEE, Philip S. Yu, Fellow, IEEE, and Jay Sethuraman IEEE Transactions on Knowledge and Data Engineering, vol 13, No. 5, September/October 2001

2. Introduction and Assumptions Introduction Assumptions Bandwidth (NTSC) VBI (vertical blanking interval) Dark time Broadcast Alternatives Non-cyclic transmission Cyclic transmission Cost and revenue Batching Scheduler invocation cost time

3. Non-cyclic scheduler – revenue Hi (t), for product i at time t

4. Tjk , completion time of kth task on channel j Non-cyclic scheduler – channel

5. -Hi (Tjk), the cost of arc ijk (i supply, j channel, k slot) Non-cyclic scheduler – TP slot1 slot2 slot3 task1 channel1 task2 task3 channel2

6. Non-cyclic scheduler – formula

7. hij (t), for product i, subtask j at time t Cyclic scheduler

8. Sli2 cost time Cyclic scheduler – notations time

9. Cyclic scheduler – heuristic 1 For all i, J, m, maximizes cost time

10. Cyclic scheduler – heuristic 2 For all i, J, m, maximizes cost time

11. Cyclic scheduler – heuristic 3 For all i, J, m, maximizes T1 T2 T3 T4 T5 time Sli1 Sli2 Sli3 Sli4 Sli5

12. Experimental Results

13. Experimental Results