This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Time-Critical On-Demand Data Broadcast: Algorithms, Analysis, and Performance Evaluation
January 2006 (vol. 17 no. 1)
pp. 3-14

Abstract—On-demand broadcast is an effective wireless data dissemination technique to enhance system scalability and deal with dynamic user access patterns. With the rapid growth of time-critical information services in emerging applications, there is an increasing need for the system to support timely data dissemination. This paper investigates online scheduling algorithms for time-critical on-demand data broadcast. We propose a novel scheduling algorithm called {\rm{SIN}}{\hbox{-}}\alpha that takes the urgency and number of outstanding requests into consideration. An efficient implementation of {\rm{SIN}}{\hbox{-}}\alpha is presented. We also analyze the theoretical bound of request drop rate when the request arrival rate rises toward infinity. Trace-driven experiments show that {\rm{SIN}}{\hbox{-}}\alpha significantly outperforms existing algorithms over a wide range of workloads and approaches the analytical bound at high request rates.

[1] S. Acharya and S. Muthukrishnan, “Scheduling On-Demand Broadcasts: New Metrics and Algorithms,” Proc. MobiCom '98, pp. 43-54, Oct. 1998.
[2] D. Aksoy and M. Franklin, “R$\times$ W: A Scheduling Approach for Large-Scale On-Demand Data Broadcast,” IEEE/ACM Trans. Networking (ToN), vol. 7, no. 6, pp. 846-860, Dec. 1999.
[3] D. Aksoy, M.J. Franklin, and S. Zdonik, “Data Staging For On-Demand Broadcast,” Proc. Conf. Very Large Data Bases '01, pp. 571-580, Sept. 2001.
[4] M. Arlitt and T. Jin, “A Workload Characterization Study of the 1998 World Cup Web Site,” IEEE Network, vol. 14, no. 3, pp. 30-37, May/June 2000.
[5] Z. Brakerski, A. Nisgav, and B.P. Shamir, “General Perfectly Periodic Scheduling,” Proc. 21st Ann. Symp. Principles of Distributed Computing (PODC '02), pp. 163-172, July 2002.
[6] L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, “Web Caching and Zipf-Like Distributions: Evidence and Implications,” Proc. IEEE INFOCOM '99, pp. 126-134, Mar. 1999.
[7] G. Buttazzo, M. Spuri, and F. Sensini, “Value vs. Deadline Scheduling in Overload Conditions,” Proc. IEEE Real-Time Systems Symp. (RTSS '95), pp. 571-580, Dec. 1995.
[8] M.-S. Chen, K.-L. Wu, and P.S. Yu, “Optimizing Index Allocation for Sequential Data Broadcasting in Wireless Mobile Computing,” IEEE Trans. Knowledge and Data Eng., vol. 15, no. 1, pp. 161-173, Jan./Feb. 2003.
[9] A. Datta, D.E. VanderMeer, A. Celik, and V. Kumar, “Broadcast Protocols to Support Efficient Retrieval from Databases by Mobile Users,” ACM Trans. Database Systems (TODS), vol. 24, no. 1, pp. 1-79, Mar. 1999.
[10] J. Edmonds and K. Pruhs, “Broadcast Scheduling: When Fairness is Fine,” Proc. 13th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA '02), pp. 421-430, Jan. 2002.
[11] J. Blazewicz et al., Scheduling Computer and Manufacturing Processes, second ed. Springer, 2001.
[12] H. Everett, “Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources,” Operations Research, vol. 11, pp. 399-417, 1963.
[13] C.-L. Hu and M.-S. Chen, “Dynamic Data Broadcasting with Traffic Awareness,” Proc. 22nd IEEE Int'l Conf. Distributed Computing and Systems (ICDCS '02), pp. 112-119, July 2002.
[14] S. Jiang and N.H. Vaidya, “Scheduling Data Broadcast to Impatient Users,” Proc. MobiDE '99, pp. 52-59, Aug. 1999.
[15] M. Karlsson and C. Karamanolis, “Choosing Replica Placement Heuristics for Wide-Area Systems,” Proc. 24th IEEE Int'l Conf. Distributed Computing and Systems (ICDCS '04), pp. 350-359, Mar. 2004.
[16] C. Kenyon, N. Schabanel, and N. Young, “Polynomial-Time Approximation Scheme for Data Broadcast,” Proc. 32nd Ann. ACM Symp. Theory of Computing (STOC '00), pp. 659-666, May 2000.
[17] K. Lam and T. Kuo, Real-Time Database Systems: Architecture and Techniques. Kluwer Publisher, 2001.
[18] D.L. Lee, W.-C. Lee, J. Xu, and B. Zheng, “Data Management in Location-Dependent Information Services,” IEEE Pervasive Computing, vol. 1, no. 3, pp. 65-72, July-Sept. 2002.
[19] K.C.K. Lee, H.V. Leong, and A. Si, “Semantic Data Broadcast for a Mobile Environment Based on Dynamic and Adaptive Chunking,” IEEE Trans. Computers, vol. 51, no. 10, pp. 1253-1268, Oct. 2002.
[20] S. Lee, D.P. Carney, and S. Zdonik, “Index Hint for On-Demand Broadcasting,” Proc. IEEE Int'l Conf. Data Eng. '03, pp. 726-728, Mar. 2003.
[21] V.C.S. Lee, J.K. Ng, J.Y.P. Chong, and K.-W. Lam, “Maintaining Temporal Consistency in Broadcast Environments,” Proc. IEEE Int'l Conf. Mobile Data Management (MDM '04), pp. 284-292, Jan. 2004.
[22] V. Liberatore, “Multicast Scheduling for List Requests,” Proc. IEEE INFOCOM '02, pp. 1129-1137, June 2002.
[23] C.L. Liu and J.W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environments,” J. ACM, vol. 20, no. 1, pp. 46-61, 1973.
[24] D.A. Menasce, “Qos Issues in Web Services,” IEEE Internet Computing, vol. 6, no. 6, pp. 72-75, Nov./Dec. 2002.
[25] E. Pitoura and P.K. Chrysanthis, “Multiversion Data Broadcast,” IEEE Trans. Computers, vol. 51, no. 10, pp. 1224-1230, Oct. 2002.
[26] StarBand Comm., http:/www.starband.com/, 2006.
[27] Hughes Network Systems, DIRECWAY Homepage, http:/www.direcway.com/, 2005.
[28] X. Tang and J. Xu, “QoS Aware Replica Placement for Content Distribution,” IEEE Trans. Parallel and Distributed Systems, pp. 921-932, vol. 16, no. 10, Oct. 2005.
[29] J.W. Wong, “Broadcast Delivery,” Proc. IEEE, vol. 76, no. 12, pp. 1566-1577, Dec. 1988.
[30] J. Xu, W.-C. Lee, and X. Tang, “Exponential Index: A Distributed Parameterized Index for Data on Air,” Proc. ACM/USENIX MobiSys '04, pp. 153-164, June 2004.
[31] P. Xuan et al., “Broadcast On Demand: Efficient and Timely Dissemination of Data in Mobile Environments,” Proc. IEEE Real-Time Technology and Applications Symp. (RTAS '97), pp. 38-48, June 1997.
[32] World Cup 98 Web Site Access Logs, http://ita.ee.lbl.gov/html/contribWorldCup.html , 1998.

Index Terms:
Mobile computing, on-demand data broadcast, scheduling, content delivery, time constraint.
Citation:
Jianliang Xu, Xueyan Tang, Wang-Chien Lee, "Time-Critical On-Demand Data Broadcast: Algorithms, Analysis, and Performance Evaluation," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 1, pp. 3-14, Jan. 2006, doi:10.1109/TPDS.2006.14
Usage of this product signifies your acceptance of the Terms of Use.