Scheduling strategies of correlated broadcast data in push-based systems

The server strategy of repeatedly broadcasting data items can result in a higher throughput than sending the requested data items to individual clients. Various methods have been studied to reduce the average response time in such systems. In this paper, two strategies are presented for scheduling the broadcast program. Both strategies take into account the correlation among the requested data items. The first strategy is suitable for an environment where clients access a set of correlated data items by submitting multiple access requests at the same time. A broadcast program is composed by placing strongly correlated data items next to each other. The second strategy is suitable for an environment where clients access a set of correlated data items by submitting multiple access requests at intervals between the requests. This latter strategy places strongly correlated data items at suitable intervals in the program. Simulation studies were used to evaluate the performance of the proposed strategies.