Sleepers and workaholics: caching strategies in mobile environments
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Mobile wireless computing: challenges in data management
Communications of the ACM
Broadcast disks: data management for asymmetric communication environments
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Balancing push and pull for data broadcast
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
WSC '96 Proceedings of the 28th conference on Winter simulation
Log-time algorithms for scheduling single and multiple channel data broadcast
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
Scheduling data broadcast in asymmetric communication environments
Wireless Networks
Efficient algorithms for scheduling data broadcast
Wireless Networks
Scheduling data broadcast to “impatient” users
Proceedings of the 1st ACM international workshop on Data engineering for wireless and mobile access
R × W: a scheduling approach for large-scale on-demand data broadcast
IEEE/ACM Transactions on Networking (TON)
Mobile Computing and Databases-A Survey
IEEE Transactions on Knowledge and Data Engineering
Data scheduling for multi-item and transactional requests in on-demand broadcast
Proceedings of the 6th international conference on Mobile data management
| Hi-index | 0.00 |
One of the two main approaches of data broadcasting is pull-based data delivery. In this paper, we focus on the problem of scheduling data items to broadcast in such a pull-based environment. Previous work has shown that the Longest Wait First heuristic has the best performance results compared to all other broadcast scheduling algorithms, however the decision overhead avoids its practical implementation. Observing this fact, we propose an efficient broadcast scheduling algorithm which is based on an approximate version of the Longest Wait First heuristic. We also compare the performance of the proposed algorithm against well-known broadcast scheduling algorithms.