Broadcast disks: data management for asymmetric communication environments
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
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
Broadcast scheduling for information distribution
Wireless Networks
Minimizing service and operation costs of periodic scheduling
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
R × W: a scheduling approach for large-scale on-demand data broadcast
IEEE/ACM Transactions on Networking (TON)
Efficient Data Allocation over Multiple Channels at Broadcast Servers
IEEE Transactions on Computers
IWDC '02 Proceedings of the 4th International Workshop on Distributed Computing, Mobile and Wireless Computing
A cost-efficient scheduling algorithm of on-demand broadcasts
Wireless Networks
A Lazy Data Request Approach for On-Demand Data Broadcasting
ICDCSW '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Efficient data access to multi-channel broadcast programs
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
COS: client oriented scheduling for multi-channel on-demand broadcast
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
Data scheduling for multi-item requests in multi-channel on-demand broadcast environments
Proceedings of the Seventh ACM International Workshop on Data Engineering for Wireless and Mobile Access
On-demand broadcast for multiple-item requests in a multiple-channel environment
Information Sciences: an International Journal
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication
| Hi-index | 0.00 |
Broadcast is an efficient and scalable technique for disseminating data over wireless channels to an arbitrary large number of clients. The prime objective of broadcast schedules, both on-line and off-line, is to minimize the average amount of time a client needs to wait before receiving its desired item. In off-line schedules, it is assumed that both the entire set of data items and the demand probability for each data is known in advance. Such schedules are guaranteed to obtain the minimum average waiting time only when a skewed partition of the data among multiple-channels and flat schedules per channel are assumed. On the contrary, the on-line broadcast schedules decide which item to transmit without any a-priori knowledge of either the entire set of data or the data demand probabilities. Although no optimal solutions are known for the latter schedules, the volatility of the set of data items to be transmitted makes on-line schedules much more desirable than its off-line counterparts. In this paper, a new on-line broadcast schedule for broadcast over multiple channels is presented. The strategy partitions the data among the broadcast channels in a balanced way, and adopts a hybrid push-pull broadcast schedule per channel. Simulation experiments point out that the results of our new algorithm outperforms the minimum average waiting time achieved by the optimal off-line schedule (skewed partition of data among channels and flat schedule for channel), and the on-line broadcast schedule based on the square root rule.