Skip to Main Content
Recently, there has been an increasing interest in the research of push-based information systems that deliver data using broadcast in both wired and wireless environments. In push-based systems, since a server can meet all requests for broadcast data pending in a system with one broadcast, a larger throughput can be expected when there exists a large number of clients. In this paper to reduce the response time of data access, we propose a new scheduling strategy of broadcast program considering an environment where clients issue requests for multiple data items consecutively with think-time. The proposed strategy reduces the average response time by broadcasting the optimal data item at present according to clients' access characteristics such as access frequencies, correlations among data items, and think-time.