No abstract

No abstract

No abstract

Recently, there has been increasing interest in information systems that deliver data using broadcast in both wired and wireless environments. The strategy in which a server repeatedly broadcasts data to clients can result in a larger throughput, and various methods have been studied to reduce the average response time to data requests in such systems. In this paper, we propose a strategy for scheduling the broadcast program which takes into account the correlation among data items. This strategy puts data items with strong correlation side by side in the broadcast program in order to reduce the average response time. We also propose a caching strategy which extends a conventional caching strategy so that it can take advantage of correlation among broadcast data items for greater efficiency. Finally: we use simulation studies to evaluate the performance of our proposed strategies.

Recently, there has been increasing interest in information systems that deliver data using broadcast in both wired and wireless environments. The strategy in which a server repeatedly broadcasts data to clients can result in a larger throughput, and various methods have been studied to reduce the average response time to data requests in such systems. In this paper, we propose a strategy for scheduling the broadcast program which takes into account the correlation among data. This strategy puts data items with strong correlation side by side in the broadcast program in order to reduce the average response time. We also propose a caching strategy which extends a conventional caching strategy so that it can take advantage of correlation among broadcast data for greater efficiency. Finally, we use simulation studies to evaluate the performance of our proposed strategies.