This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Scheduling Algorithms for the Broadcast Delivery of Digital Products
September/October 2001 (vol. 13 no. 5)
pp. 721-741

Abstract—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.

[1] R. Thakur and A. Choudhary, "All-to-All Communication on Meshes with Wormhole Routing," Proc. Eighth Int'l Parallel Processing Symp., pp. 561-565, Apr. 1994.
[2] C.C. Aggarwal, J.L. Wolf, and P.S. Yu, The Maximum Factor Queue Length Batching Scheme for Video-on-Demand Systems IEEE Trans. Computers, vol. 50, no. 2, pp. 97-110, Feb. 2001.
[3] R. Ahuja, T. Magnanti, and J. Orlin, Network Flows. Prentice Hall, 1993.
[4] D. Aksoy and M. Franklin, “RxW: A Scheduling Approach for Large-Scale On-Demand Data Broadcast,” ACM/IEEE Trans. Networking, Dec. 1999, (Preliminary version in IEEE Infocom Conf., March 1998.)
[5] M.H. Ammar and J.W. Wong, “The Design of Teletext Broadcast Cycles,” Performance Evaluation, vol. 5, no. 4, pp. 235-242, 1985.
[6] M.H. Ammar and J.W. Wong, “On the Optimality of Cyclic Transmission on Teletext Systems,” IEEE Trans. Comm., vol. 35, no. 1, pp. 68-73, 1987.
[7] D.P. Anderson,"Metascheduling for Continuous Media," ACM Trans. Computer Systems, vol. 11, no. 3, Aug. 1993, pp. 226-252.
[8] S. Anily, C.A. Glass, and R. Hassin, “The Scheduling of Maintenance Service,” Discrete Applied Mathematics, pp. 27-42, 1998.
[9] A. Bar-Noy, R. Bhatia, J. Naor, and B. Schieber, “Minimizing Service and Operation Costs of Periodic Scheduling,” Proc. Ninth ACM-SIAM Symp. Discrete Algorithms (SODA '98), pp. 11-20, 1998.
[10] J. Blazewicz, K. Ecker, G. Schmidt, and J. Weglarz, Scheduling in Computer and Manufacturing Systems. Springer-Verlag, 1993.
[11] A. Dan, D. Sitaram, and P. Shahabuddin, Scheduling Policies for an On-Demand Video Server with Batching Proc. Second ACM Int'l Conf. Multimedia, pp. 15-23, 1994.
[12] H.D. Dykeman, M.H. Ammar, and J.W. Wong, “Scheduling Algorithms for Videotex System Under Broadcast Delivery,” Proc. ICC '86, pp. 1847-1851, 1986.
[13] M. Garey and D. Johnson, Computers and Intractability. W.H. Freeman, 1979.
[14] J. Gecsei, The Architecture of Videotex Systems. Englewood Cliffs, N.J.: Prentice-Hall, 1983.
[15] A. Gelman and S. Halfin, “Analysis of Resource Sharing in Information Providing Services,” IEEE Global Telecommunications Conf. and Exhibition, vol. 1, 1990.
[16] L. Hall, D. Shmoys, and J. Wein, “Scheduling to Minimize Average Completion Time: Off-line and On-line Algorithms,” Sixth ACM-SIAM Symp. Discrete Algorithms, 1996.
[17] D. Hochbaum, Approximation Algorithms for NP-Hard Problems. PWS Publishing, 1997.
[18] O. Ibarra and C. Kim, “Approximation Algorithms for Certain Scheduling Problems,” Math. of Operations Research, vol. 3, no. 3, pp. 197-204, 1978.
[19] A. Iyengar, M. Squillante, and L. Zhang, “Analysis and Characterization of Large-Scale Web Server Access Patterns and Performance,” World Wide Web, vol. 2, pp. 85-100, 1999.
[20] C. Kenyon and N. Schabanel, “The Data Broadcast Problem with Nonuniform Transmission Times,” Proc. 10th ACM-SIAM Symp. Discrete Algorithms (SODA '99), pp. 547-556, 1999.
[21] C. Kenyon, N. Schabanel, and N. Young, “A Polynomial-Time Approximation Scheme for Data Broadcast,” Proc. 32nd ACM Symp. Theory of Computing (STOC 2000), pp. 659-666, 2000.
[22] M. Pinedo, Scheduling: Theory, Algorithms and Systems. Prentice-Hall, 1995.
[23] W. Press, B. Flannery, S. Teukolsky, and W. Vetterling, Numerical Recipes. Cambridge Univ. Press, 1986.
[24] K. Ramamritham and V. Vinay, “Scheduling Algorithms for the Broadcast Delivery of Multimedia Products,” Second Int'l Workshop Advanced Issues of E-Commerce and Web-Based Information Systems, 2000.
[25] H. Shachnai and P. Yu, “Exploring Wait Tolerance in Effective Batching for Video-on-Demand Scheduling,” ACM Multimedia Systems, vol. 6, no. 6, pp. 382-394, 1998.
[26] Sony Corp., http://www.world.sony.com/News/Press/199903 99-03A, 1999.
[27] M. Squillante, D. Yao, and L. Zhang, “Web Traffic Modeling and Web Server Performance Analysis,” IEEE Conf. Decision and Control, 1999.
[28] The Standard, http://www.thestandard.com/article/article_print 0,1153,3963,00.html, 2000.
[29] C-J. Su, L. Tassiulas, and V.J. Tsotras, “Broadcast Scheduling for Information Distribution,” ACM/Baltzer J. Wireless Networks, vol. 5, no. 2, pp. 137-147, 1999.
[30] K.S. Trivedi, Probability and Statistics with Reliability, Queuing, and Computer Science Applications. Prentice Hall, 1982.
[31] N. Vaidya and S. Hameed, “Efficient Algorithms for Scheduling Single and Multiple Channel Broadcast,” Technical Report #97-002, Texas A&M Univ., Feb. 1997.
[32] N. Vaidya and S. Hameed, “Log Time Algorithms for Scheduling Single and Multiple Channel Data Broadcast,” Proc. Fourth Ann. ACM/IEEE Int'l Conf. Mobile Computing and Networking (Mobicom '97), 1997.
[33] WETA, http:/www.hdtv.org, 2001.
[34] J.L. Wolf, P.S. Yu, and H. Shachnai, Disk Load Balancing for Video-on-Demand Systems ACM Multimedia Systems J., vol. 5, no. 6, pp. 358-370, 1997.
[35] J.W. Wong, “Broadcast Delivery,” Proc. IEEE, vol. 76, no. 12, pp. 1566-1577, 1988.
[36] G. Zipf, Human Behavior and the Principle of Least Effort. Addison-Wesley, 1949.

Index Terms:
E-commerce, electronic delivery service, television broadcasting, scheduling algorithms.
Citation:
Joel L. Wolf, Mark S. Squillante, John J. Turek, Philip S. Yu, Jay Sethuraman, "Scheduling Algorithms for the Broadcast Delivery of Digital Products," IEEE Transactions on Knowledge and Data Engineering, vol. 13, no. 5, pp. 721-741, Sept.-Oct. 2001, doi:10.1109/69.956097
Usage of this product signifies your acceptance of the Terms of Use.