Data scheduling for multi-item and transactional requests in on-demand broadcast

Abstract

Recent advances in mobile computing and wireless communication have enabled the deployment of broadcast based information systems such as, wireless internet, traffic information, etc. The users and research community have recognized its potential for meeting the growing information demands of the future. At present existing systems are mainly pull-based (on-demand) and their performance highly depends on the broadcast schedule they use. Previous studies in on-demand scheduling have focused mainly on single item requests to keep the investigation simple. However, scheduling algorithms for single item request are unable to manage efficiently multi-item requests which are becoming more common. In addition to this these more and more requests are becoming transactional in nature. In this paper we take into consideration these requirements and study scheduling problems arising in on-demand broadcast environment and propose an efficient algorithm. We report its performance and demonstrate that our algorithm successfully manage multi-item simple and transactional requests and significantly reduces the wait time, tuning time and avoids transaction aborts.