Answering Multiple-Item Queries in Data Broadcast Systems

A lot of research has been done on answering single-item queries, only a few have looked at answering multiple-item queries in data broadcast systems. The few that did, have proposed approaches that are less responsive to changes in the query queue. It is not immediately clear how single-item scheduling algorithms will perform when used in answering pull-based multiple-item queries. This paper investigates the performance of existing single-item scheduling algorithms in answering multiple-item queries in pull-based data broadcast systems. We observed that Longest Wait First, a near-optimal single-item data scheduling algorithm, has been used in environments where users' data access pattern is skewed. This paper also investigates the performance of Longest Wait First under various user access patterns. We propose $\mathcal{Q}$LWF: an online data broadcast scheduling algorithm for answering multiple-item queries in pull-based data broadcast systems. For the purpose of comparison with $\mathcal{Q}$LWF, we adapted existing pull single-item algorithm, push single-item algorithm, and push multiple-item algorithm to answer multiple-item queries in pull environments. Results from extensive sets of experiments show that $\mathcal{Q}$LWF has a superior performance compared with the adapted algorithms.

[1]  Mostafa H. Ammar,et al.  The Design of Teletext Broadcast Cycles , 1985, Perform. Evaluation.

[2]  Michael J. Franklin,et al.  R × W: a scheduling approach for large-scale on-demand data broadcast , 1999, TNET.

[3]  Arbee L. P. Chen,et al.  A strategy for efficient access of multiple data items in mobile environments , 2002, Proceedings Third International Conference on Mobile Data Management MDM 2002.

[4]  Ye-In Chang,et al.  An efficient scheduling method for query-set-based broadcasting in mobile environments , 2004, 24th International Conference on Distributed Computing Systems Workshops, 2004. Proceedings..

[5]  Kirk Pruhs,et al.  A maiden analysis of longest wait first , 2005, TALG.

[6]  Edward Chan,et al.  Adaptive data broadcast strategy for transactions with multiple data requests in mobile computing environments , 1999, Proceedings Sixth International Conference on Real-Time Computing Systems and Applications. RTCSA'99 (Cat. No.PR00306).

[7]  Johnny W. Wong,et al.  Deadline-based scheduling in support of real-time data delivery , 2008, Comput. Networks.

[8]  Shou-Chih Lo,et al.  Broadcast Data Allocation for Efficient Access of Multiple Data Items in Mobile Environments , 2003, Mob. Networks Appl..

[9]  Vincenzo Liberatore.  Multicast scheduling for list requests , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[10]  Stanley B. Zdonik,et al.  Balancing push and pull for data broadcast , 1997, SIGMOD '97.

[11]  Bala Kalyanasundaram,et al.  Scheduling Broadcasts in Wireless Networks , 2000, ESA.

[12]  Krithi Ramamritham,et al.  Adaptive Dissemination of Data in Time-Critical Asymmetric Communication Environments , 2004, Mob. Networks Appl..

[13]  Leandros Tassiulas,et al.  Broadcast scheduling for information distribution , 1999, Wirel. Networks.

[14]  Mostafa H. Ammar,et al.  Scheduling Algorithms for Videotex Systems Under Broadcast Delivery , 1986, ICC.

[15]  Guang-Ming Wu.  An efficient data placement for query-set-based broadcasting in mobile environments , 2007, Comput. Commun..

[16]  J. Wong,et al.  Broadcast Delivery , 1988, Proc. IEEE.

[17]  Yon Dohn Chung,et al.  Effective Data Placement for Wireless Broadcast , 2001, Distributed and Parallel Databases.

[18]  Vijay Kumar,et al.  Data scheduling for multi-item and transactional requests in on-demand broadcast , 2005, MDM '05.

[19]  Yon Dohn Chung,et al.  QEM: a scheduling method for wireless broadcast data , 1999, Proceedings. 6th International Conference on Advanced Systems for Advanced Applications.

[20]  S. Muthukrishnan,et al.  Minimizing maximum response time in scheduling broadcasts , 2000, SODA '00.