Abstract
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.
This research is partially supported by the Natural Science and Engineering Research Council (NSERC) and Alberta’s Informatics Circle of Research Excellence (iCORE).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Acharya, S., Franklin, M., Zdonik, S.: Balancing push and pull for data broadcast. In: Proceedings of the ACM SIGMOD Conference, May 1997, pp. 183–194 (1997)
Aksoy, D., Franklin, M.: RxW: A scheduling approach for large-scale on-demand data broadcast. IEEE/ACM Transactions On Networking 7(6), 846–860 (1999)
Bartal, Y., Muthukrishnan, S.: Minimizing maximum response time in scheduling broadcasts. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, January 2000, pp. 558–559 (2000)
Kalyanasundaram, B., Pruhs, K., Velauthapillai, M.: Scheduling broadcasts in wireless networks. In: Proceedings of the 8th Annual European Symposium on Algorithms, September 2000, pp. 290–301 (2000)
Chang, Y.I., Hsieh, W.H.: An efficient scheduling method for query-set-based broadcasting in mobile environments. In: Proceedings of the 24th International Conference on Distributed Computing Systems Workshops, March 2004, pp. 478–483 (2004)
Chung, Y.D., Kim, M.H.: Effective data placement for wireless broadcast. Distributed and Parallel Databases 9(2), 133–150 (2001)
Lee, G., Lo, S.C.: Broadcast data allocation for efficient access of multiple data items in mobile environments. Mobile Networks and Applications 8(4), 365–375 (2003)
Prabhu, N., Kumar, V.: Data scheduling for multi-item and transactional requests in on-demand broadcast. In: Proceedings of the 6th International Conference on Mobile Data Management, May 2005, pp. 48–56 (2005)
Wu, G.M.: An efficient data placement for query-set-based broadcasting in mobile environments. Computer Communications 30(5), 1075–1081 (2007)
Yuen, J.C.H., Chan, E., yiu Lam, K.: Adaptive data broadcast strategy for transactions with multiple data requests in mobile computing environments. In: Proceedings of the 6th International Conference on Real-Time Computing Systems and Applications, December 1999, pp. 37–44 (1999)
Edmonds, J., Pruhs, K.: A maiden analysis of longest wait first. ACM Transactions on Algorithms 1(1), 14–32 (2005)
Dykeman, H., Ammar, M., Wong, J.: Scheduling algorithms for videotex systems under broadcast delivery. In: Proceedings of the IEEE International Conference on Communications, June 1986, vol. 3, pp. 1847–1851 (1986)
Fernandez, J., Ramamritham, K.: Adaptive dissemination of data in time-critical asymmetric communication environments. Mobile Networks and Applications 9(5), 491–505 (2004)
Liu, Y., Wong, J.: Deadline-based scheduling in support of real-time data delivery. Computer Networks (accepted for publication, 2007)
Wong, J.: Broadcast delivery. Proceedings of IEEE 76(12), 1566–1577 (1988)
Chung, Y.D., Kim, M.H.: QEM: A scheduling method for wireless broadcast data. In: Proceedings of the 6th International Conference on Database Systems for Advanced Applications, April 1999, pp. 135–142 (1999)
Liberatore, V.: Multicast scheduling for list requests. In: Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 2, pp. 1129–1137 (2002)
Lee, G., Yeh, M., Lo, S., Chen, A.L.: A strategy for efficient access of multiple data items in mobile environments. In: Proceedings of the 3rd International Conference on Mobile Data Management, January 2002, pp. 71–78 (2002)
Ammar, M.H., Wong, J.W.: The design of teletext broadcast cycles. Performormance Evaluation 5(4), 235–242 (1985)
Su, C., Tassiulas, L.: Broadcast scheduling for information distribution. In: Proceedings of IEEE INFOCOM, vol. 1, pp. 109–117 (1997)
Vaidya, N.H., Hameed, S.: Data broadcast in asymmetric wireless environments. In: Proceedings of the 1st International Workshop on Satellite-based Information Services (November 1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Omotayo, A., Barker, K., Hammad, M., Higham, L., Kawash, J. (2009). Answering Multiple-Item Queries in Data Broadcast Systems. In: Sexton, A.P. (eds) Dataspace: The Final Frontier. BNCOD 2009. Lecture Notes in Computer Science, vol 5588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02843-4_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-02843-4_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02842-7
Online ISBN: 978-3-642-02843-4
eBook Packages: Computer ScienceComputer Science (R0)