Balancing push and pull for data broadcast
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
R × W: a scheduling approach for large-scale on-demand data broadcast
IEEE/ACM Transactions on Networking (TON)
Minimizing maximum response time in scheduling broadcasts
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Effective Data Placement for Wireless Broadcast
Distributed and Parallel Databases
QEM: A Scheduling Method for Wireless Broadcast Data
DASFAA '99 Proceedings of the Sixth International Conference on Database Systems for Advanced Applications
Scheduling Broadcasts in Wireless Networks
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
A Strategy for Efficient Access of Multiple Data Items in Mobile Environments
MDM '02 Proceedings of the Third International Conference on Mobile Data Management
RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
Broadcast Scheduling for Information Distribution
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Broadcast data allocation for efficient access of multiple data items in mobile environments
Mobile Networks and Applications
An Efficient Scheduling Method for Query-Set-Based Broadcasting in Mobile Environments
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Adaptive dissemination of data in time-critical asymmetric communication environments
Mobile Networks and Applications
Data scheduling for multi-item and transactional requests in on-demand broadcast
Proceedings of the 6th international conference on Mobile data management
A maiden analysis of longest wait first
ACM Transactions on Algorithms (TALG)
An efficient data placement for query-set-based broadcasting in mobile environments
Computer Communications
Deadline-based scheduling in support of real-time data delivery
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
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.