Weiwei Sun
ABSTRACT
In mobile wireless systems data on air can be accessed by a large number of mobile users. Many of these applications such as wireless internets and traffic information systems are pull-based, that is, they respond to on-demand user requests. In this paper, we study the scheduling problems of on-demand broadcast environments. Traditionally, the response time of the requests has been used as a performance measure. In this paper we consider the performance as the average cost of request composed of three kinds of costs—access time cost, tuning time cost, and cost of handling failure request. Our main contribution is a self-adaptive scheduling algorithm named LDFC, which computes the delay cost of data item as the priority for broadcast. It performs well compared with some previous algorithms in this context.
- 1.Acharya, S., Alonso, R., Franklin, M. and Zdonik, S. Broadcast Disks: Data management for asymmetric commu- nications environments. In Michael J. Carey and Donovan A. Schneider, editors, Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, San Jose, California, 1995. Google Scholar
Digital Library
- 2.Acharya, S., Franklin, M. and Zdonik, S. Disseminating updates on broadcast disks. In: Proc 22nd VLDB Conf, 1996. Google ScholarDigital Library
- 3.Acharya, S., Franklin, M. and Zdonik, S. Dissemination-based data delivery using Broadcast Disks. IEEE Personal Communications, 1995,2(6): 50- 60.Google ScholarCross Ref
- 4.Acharya, S. and Muthukrishnan, S. Scheduling ondemand broadcasts: new metrics and algorithms. Proceeding of ACM/IEEE MobiCom, Dallas, TX, 1998. Google ScholarDigital Library
- 5.Aksoy, D. and Franklin, M. Scheduling for large scale on-demand data broadcast. In Proc. of IEEE INFOCOM, San Francisco, CA, 1998.Google ScholarCross Ref
- 6.Bender, M., Chakrabarti, S. and Muthukrishnan, S. Flow and stretch metrics for scheduling continuous job streams. In Proceedings of the Ninth Annual ACM - SIAM Symposium on Discrete Algorithms, San Francisco, California, 1998. Google ScholarDigital Library
- 7.Chiueh, T. Scheduling for broadcast-based file systems. In: Proc MOBIDATA Workshop, 1994.Google Scholar
- 8.Datta, A., Vandermeer, D. E., Celik, A. and Kumar, B.V. Broadcast protocols to support efficient retrieval from database by mobile users. ACM TODS, 1999, 24(1) 1-79. Google ScholarDigital Library
- 9.Gondhalekar, V. A. Scheduling periodic wireless data broadcast. MS Thesis, the University of Texas at Austin, 1995. Google ScholarDigital Library
- 10.Imielinski, T. and Badrinath, B. R. Mobile wireless computing: solutions and challenges in data management. Communications of the ACM, 1994, 37(10). Google ScholarDigital Library
- 11.Imielinski, T., Viswanathan, S. and Badrinath, B. R. Energy efficient indexing on air. In: Proc ACM SIGMOD 1994. Google ScholarDigital Library
- 12.Shivakumar, N. and Venka, S. Efficient indexing for broadcast-based wireless systems. ACM Mobile Networks and Nomadic Applications, 1996, 1(4): 433- 446. Google ScholarDigital Library
- 13.Su, C. and Tassiulas, L. Broadcast scheduling for information distribution. In Proceedings of IEEE INFOCOM, Los Alamitos, CA USA, April 1997. Google ScholarDigital Library
- 14.Viswanathan, S. and Imielinski, T. Pyramid broadcasting for Video on Demand service. Technical Report DCS TR-311, Rutgers University, 1994.Google Scholar
- 15.Wong, J. W. Broadcast delivery. Proceedings of the IEEE, 1988, 76(t2): 1566-1577.Google ScholarCross Ref
Index Terms
- A self-adaptive scheduling algorithm of on-demand broadcasts
Recommendations
A cost-efficient scheduling algorithm of on-demand broadcasts
In mobile wireless systems data on air can be accessed by a large number of mobile users. Many of these applications including wireless internets and traffic information systems are pull-based, that is, they respond to on-demand user requests. In this ...
Scheduling on-demand data broadcast in mixed-type request environments
In many on-demand broadcast environments, there can be a mix of requests, in which some of the requests have real-time constraints, while other requests have no time constraints associated with them. We refer to such environments as mixed-type ...
Dynamic Skyscraper Broadcasts for Video-on-Demand
MIS '98: Proceedings of the 4th International Workshop on Advances in Multimedia Information SystemsSkyscraper Broadcasting is a recently proposed statically scheduled broadcast technique for video-on-demand that addresses the network-I/O bottleneck to provide significantly superior performance over previous approaches. This paper defines a scheme for ...
Comments