Broadcast disks: data management for asymmetric communication environments
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Balancing push and pull for data broadcast
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Log-time algorithms for scheduling single and multiple channel data broadcast
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
Broadcast scheduling for information distribution
Wireless Networks
Efficient algorithms for scheduling data broadcast
Wireless Networks
Data on Air: Organization and Access
IEEE Transactions on Knowledge and Data Engineering
Disseminating Updates on Broadcast Disks
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Adaptive Data Broadcast in Hybrid Networks
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Indexed Sequential Data Broadcasting in Wireless Mobile Computing
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
| Hi-index | 0.01 |
The server strategy of repeatedly broadcasting data items can result in 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, we introduce a strategy to determine the optimal broadcast interval between two correlated data items. Based on these estimated optimal intervals, we propose a new scheduling strategy of a broadcast program to accommodate an environment where a large number of correlated data items exist in the broadcast program.