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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aksoy, D., Franklin, M.: RxW: A Scheduling Approach for Large-Scale On-Demand Data Broadcast. IEEE/ACM Transactions on Networking 7(6) (December 1999)
Acharya, S., Muthukrishnan, S.: Scheduling On-demand Broadcasts: New Metrics and Algorithms. In: ACM MobiCom 1998, pp. 43–54 (October 1998)
Liu, C.L., Layland, J.W.: Scheduling Algorithms for Multiprogramming in Hard Real-time Environments. J. of ACM 20(1), 46–61 (1973)
Wu, X., Lee, V.C.S.: Wireless real-time on-demand data broadcast scheduling with dual deadlines. Journal of Parallel and Distributed Computing 65(6) (2005)
Coffman, E.G., et al.: Approximation algorithms for bin packing: A survey. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-Hard Problems (1996)
Schwetman, H.: CSIM user’s guide (Version 18). MCC Corporation
Vaidya, N.H., Hamed, S.: Scheduling Data Broadcast in Asymmetric Communication Environments. ACM/Baltzer Journal of Wireless Networks 5(3), 171–182 (1999)
Wu, X., Lee, V.C.S., Ng, J.: A Preemptive Scheduling Algorithm for Wireless Real-Time On-Demand Data Broadcast. In: RTCSA 2005Â (2005)
Xuan, P., Sen, S., Gonzalez, O., Fernandez, J., Ramamritham, K.: Broadcast on Demand: Efficient and Timely Dissemination of Data in Mobile Environments. In: RTAS 1997, pp. 38–48 (June 1997)
Xu, J., Tang, X., Lee, W.-C.: Time-Critical On-Demand Broadcast: Algorithms, Analysis, and Performance Evaluation. Technical report (2003)
Zipf, G.K.: Human Behavior and the Principle of Least Effort. Addison-Wesley, Massachusetts (1949)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lam, KW., Hung, SL. (2007). Scheduling Real-Time Requests in On-Demand Broadcast Environments. In: Enokido, T., Barolli, L., Takizawa, M. (eds) Network-Based Information Systems. NBiS 2007. Lecture Notes in Computer Science, vol 4658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74573-0_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-74573-0_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74572-3
Online ISBN: 978-3-540-74573-0
eBook Packages: Computer ScienceComputer Science (R0)