Algorithms of Admission Control and Batch Scheduling of On-Demand Broadcast with Deadlines

Abstract:

Owing to its potential to satisfy all outstanding requests for the same data item with a single response, on-demand data broadcast becomes a widely accepted approach to dynamic and scalable wireless information dissemination. In the existing works, clients must wait until the deadline of their requests in the case the requests cannot be satisfied. In this paper, broadcast admission control is introduced to data broadcast systems such that the clients can be informed in advance on the result of admission control for the requests. Furthermore, a matching based allocation scheme is proposed for batch scheduling to maximize data sharing among requests. Simulation results show that our proposed algorithms have better comprehensive performance than traditional algorithms in terms of scheduling, admission control and QoS.

• Periodical: Applied Mechanics and Materials (Volumes 511-512)
• Pages: 892-897
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.511-512.892
• Online since: February 2014
• Authors: Chun Li Chen*, Jing Song Lv, Yan Jiang
• Keywords: Admission Control, Batch Scheduling, Channel Allocation, Data Broadcasting, Real-Time Multi-Item Requests

References

[1] D. Aksoy and M. Franklin, Scheduling for large-scale on-demand data broadcasting, in Proceedings of. IEEE INFOCOM, vol. 2. IEEE, 1998, p.651–659.

[2] Y. Chung and M. Kim, QEM: A Scheduling Method for Wireless Broadcast Data, in Proceedings of the Sixth International Conference on Database Systems for Advanced Applications. IEEE Computer Society, 1999, p.135–142.

DOI: 10.1109/dasfaa.1999.765745

[3] H. Hung, J. Huang, J. Huang, and M. Chen, Scheduling dependent items in data broadcasting environments, " in Proceedings of the 2006 ACM Symposium on Applied Computing (SAC, 06). ACM, 2006, p.1177–1181.

DOI: 10.1145/1141277.1141555

[4] J. Xu, X. Tang, and W. Lee, Time-critical on-demand data broadcast: Algorithms, analysis, and performance evaluation, IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 1, p.3–14, (2006).

DOI: 10.1109/tpds.2006.14

[5] J. Wong, Broadcast delivery, Proceedings of the IEEE, vol. 76, no. 12, p.1566–1577, (1988).

[6] C. Liu and J. Layland, Scheduling algorithms for multiprogramming in a hard-real-time environment, Journal of the Association for Computing Machinery, vol. 20, no. 1, p.46–61, (1973).

DOI: 10.1145/321738.321743

[7] J. Lv, V. Lee, M. Li, and E. Chen, Profit-based scheduling and channel allocation for multi-item requests in real-time on-demand data broadcast systems, Data & Knowledge Engineering, vol. 73, p.23–42, (2012).

DOI: 10.1016/j.datak.2011.09.005

[8] T. Su and C. Liu, On-demand data broadcasting for data items with time constraints on multiple broadcast channels, in Database Systems for Advanced Applications. Springer, 2010, p.458–469.

DOI: 10.1007/978-3-642-14589-6_46

[9] H. Schwetman, CSIM19: a powerful tool for building system models, in Proceedings of the 33rd Conference on Winter Simulation. IEEE Computer Society Washington, DC, USA, 2001, p.250–255.

DOI: 10.1109/wsc.2001.977280

[10] G. Zipf, Human behavior and the principle of least effort: an introduction to human ecology. Addison-Wesley Press, (1949).

DOI: 10.2307/2572028