Scheduling and caching strategies for broadcasting correlated data

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. 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.

Intelligent Data Receiver Mechanism for Wireless Broadcasting System

“…(1) Designing mechanism on the client side to further reduce access time This type of approach mainly relies on caching [8], prefetching [19], data compression [6] or balanced (push and pull) bandwidth [18]. Swarup Acharya et al proposed a cache method, called P/X, to reduce access time.…”

Research issues for data communication in mobile ad-hoc network database systems

“…al. [22] and Grassi [8] approach the problem differently. They try to improve database service by the organization and use of the broadcast.…”

“…They try to improve database service by the organization and use of the broadcast. Yajima [22] builds broadcasts where highly correlated items are found together in the broadcast, minimizing the number of times a client must access the broadcast. Grassi [8] uses prefetching related items into the client cache so that they will be available locally if needed.…”

Broadcast program generation for unordered queries with data replication

“…(Q i ) can be obtained by Equations (5) and (6). By the definition of access time, T Access (Q i ) can be formulated as…”