Scheduling real-time requests in on-demand broadcast environments

Authors:
Kwok-Wa Lam;Sheung-Lun Hung
Affiliations:
Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong;Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong
Venue:
NBiS'07 Proceedings of the 1st international conference on Network-based information systems
Year:
2007

Citing 8
Cited 1

Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
Scheduling on-demand broadcasts: new metrics and algorithms

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Scheduling data broadcast in asymmetric communication environments

Wireless Networks
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
R × W: a scheduling approach for large-scale on-demand data broadcast

IEEE/ACM Transactions on Networking (TON)
Broadcast on Demand: Efficient and Timely Dissemination of Data in Mobile Environments

RTAS '97 Proceedings of the 3rd IEEE Real-Time Technology and Applications Symposium (RTAS '97)
Wireless real-time on-demand data broadcast scheduling with dual deadlines

Journal of Parallel and Distributed Computing
A Preemptive Scheduling Algorithm for Wireless Real-Time On-Demand Data Broadcast

RTCSA '05 Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

On-demand broadcast is an effective approach to disseminating real-time data to mobile clients in mobile environments. Recent studies mostly assume that clients request only a single data item. This assumption may not sufficiently support the increasingly sophisticated real-time applications in mobile environments. In this paper, we present three on-demand broadcast algorithms to cater for multi-item requests with timing constraints. We argue for the case of aggregation of data requests to minimize the broadcast bandwidth and deadline miss rate. The three algorithms try to exploit different properties of system characteristics for aggregation. Our simulation results show that a good aggregation algorithm should consider both data overlapping of client requests and their urgency.