Sleepers and workaholics: caching strategies in mobile environments
SIGMOD '94 Proceedings of the 1994 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
Scheduling data broadcast in asymmetric communication environments
Wireless Networks
Efficient algorithms for scheduling data broadcast
Wireless Networks
The Architecture of Videotex Systems
The Architecture of Videotex Systems
A new hybrid broadcast scheduling algorithm for asymmetric communication systems
ACM SIGMOBILE Mobile Computing and Communications Review
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
Pinwheel Scheduling for Fault-Tolerant Broadcast Disks in Real-time Database Systems
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
AIDA-based real-time fault-tolerant broadcast disks
RTAS '96 Proceedings of the 2nd IEEE Real-Time Technology and Applications Symposium (RTAS '96)
Airdisks and AirRAID: Modeling and scheduling periodic wireless data broadcast
Airdisks and AirRAID: Modeling and scheduling periodic wireless data broadcast
Broadcast disks with polynomial cost functions
Wireless Networks
A New Hybrid Scheduling Framework for Asymmetric Wireless Environments with Request Repetition
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
On-line balanced k-channel data allocation with hybrid schedule per channel
Proceedings of the 6th international conference on Mobile data management
Performance analysis of a novel hybrid push-pull algorithm with QoS adaptations in wireless networks
Performance Evaluation - Performance modelling and evaluation of high-performance parallel and distributed systems
Hi-index | 0.00 |
A hybrid scheduling that effectively combines broadcasting for very popular data (push data) and dissemination upon-request for less popular data (pull data) in asymmetric communication environments is introduced. In this solution, the server continuously broadcasts one push item and disseminates one pull item. The clients send their requests to the server, which queues-up them for the pull items. At any instant of time, the item to be broadcast is designated applying a pure-push scheduling, while the item to be pulled is the one stored in the pull-queue, which has accumulated, so far, the highest number of pending requests. The value of the average expected waiting time spent by a client in the hybrid system is evaluated analytically, and the cut-off point between push and pull items is chosen so that such a waiting time is minimized. It is found out that by doing so the cut off point decreases to a value, which is much less than the total number of items present in the system, improving upon the average waiting time spent by a client in a pure push system and also on that spent in some of the hybrid systems already proposed in literature.