Sleepers and workaholics: caching strategies in mobile environments
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Energy efficient indexing on air
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Broadcast disks: data management for asymmetric communication environments
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Hierarchical packet fair queueing algorithms
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Balancing push and pull for data broadcast
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Scheduling on-demand broadcasts: new metrics and algorithms
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Broadcast scheduling for information distribution
Wireless Networks
Scheduling data broadcast in asymmetric communication environments
Wireless Networks
Efficient algorithms for scheduling data broadcast
Wireless Networks
R × W: a scheduling approach for large-scale on-demand data broadcast
IEEE/ACM Transactions on Networking (TON)
Optimal broadcasting of two files over an asymmetric channel
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile computing and communications
The Architecture of Videotex Systems
The Architecture of Videotex Systems
Prefetching from Broadcast Disks
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Adaptive Data Broadcast in Hybrid Networks
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Airdisks and AirRAID: Modeling and scheduling periodic wireless data broadcast
Airdisks and AirRAID: Modeling and scheduling periodic wireless data broadcast
Scheduling data broadcast: an efficient cut-off point between periodic and on-demand data
IEEE Communications Letters
ICDCIT'04 Proceedings of the First international conference on Distributed Computing and Internet Technology
Caching strategies for push-based broadcast considering consecutive data accesses with think-time
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
Hi-index | 0.00 |
It is believed that broadcast is an efficient way to transmit data in an asymmetric communication system. Most of the previous work focused on either pull-based or push-based scheduling. However, for systems with a very large number of data items, none of these schemes is efficient. We propose a novel scheduling algorithm which uses both pull- and push-based schemes. In our approach, data items are divided into two disjoint sets: one consisting of more-popular items and the other of less-popular items. The items in the former set are broadcast by a push-based schedule, while those in the latter set by a pull-based schedule. By optimally selecting the cut-off point to distinguish these two sets, the new hybrid scheduling algorithm achieves a lower expected access time than other existing schedules.