Introduction to algorithms
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)
Internet QoS: Architectures and Mechanisms for Quality of Service
Internet QoS: Architectures and Mechanisms for Quality of Service
Pinwheel Scheduling for Fault-Tolerant Broadcast Disks in Real-time Database Systems
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Priority assignment in real-time active databases
The VLDB Journal — The International Journal on Very Large Data Bases
AIDA-based real-time fault-tolerant broadcast disks
RTAS '96 Proceedings of the 2nd IEEE Real-Time Technology and Applications Symposium (RTAS '96)
Multi-Level Multi-Channel Air Cache Designs for Broadcasting in a Mobile Environment
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Real-time content analysis and adaptive transmission of lecture videos for mobile applications
Proceedings of the 12th annual ACM international conference on Multimedia
Time-Critical On-Demand Data Broadcast: Algorithms, Analysis, and Performance Evaluation
IEEE Transactions on Parallel and Distributed Systems
Real-time traffic support in heterogeneous mobile networks
Wireless Networks
ACM Transactions on Embedded Computing Systems (TECS)
A Computing Resource Management Framework for Software-Defined Radios
IEEE Transactions on Computers
Hi-index | 0.00 |
Mobile data delivery is a critical issue in the mobile computing area. One of the most important problems is the efficient access to data. A proposed solution to this problem is the prefetching technique which consists in putting in reserving the information before the users need it. Low bandwidth, unreliable wireless links, and frequent disconnections of mobile environments make it difficult to satisfy the timing requirements of traditional strategies. This paper investigates broadcast scheduling strategies for push-based broadcast with timing constraints in the form of deadlines ,and proposes a prediction algorithm based on Kalman filter theory for this study. The proposed dissemination policy and adaptive bandwidth allocation scheme obtain sufficient conditions such that all the time-bounded traffic sources satisfy their timing constraints to provide various quality of service guarantees in the broadcast period. Our goal is to identify scheduling algorithms for broadcast systems that ensure requests meeting their deadlines. Our approach examines the performance of traditional real-time strategies and mobile broadcasting strategies, and demonstrates that traditional real-time algorithms do not always perform the best in mobile environments. The proposed design indeed achieves good performance in mobile environments.