Fundamentals of queueing theory (2nd ed.).
Fundamentals of queueing theory (2nd ed.).
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
Efficient algorithms for scheduling data broadcast
Wireless Networks
Scheduling data broadcast to “impatient” users
Proceedings of the 1st ACM international workshop on Data engineering for wireless and mobile access
The data broadcast problem with non-uniform transmission times
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
R × W: a scheduling approach for large-scale on-demand data broadcast
IEEE/ACM Transactions on Networking (TON)
A cost-efficient scheduling algorithm of on-demand broadcasts
Wireless Networks
A Lazy Data Request Approach for On-Demand Data Broadcasting
ICDCSW '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Dynamic leveling: adaptive data broadcasting in a mobile computing environment
Mobile Networks and Applications
Pushing dependent data in clients-providers-servers systems
Wireless Networks
Adaptive realtime bandwidth allocation for wireless data delivery
Wireless Networks
Broadcast disks with polynomial cost functions
Wireless Networks
A Pull-Based Broadcast Algorithm that Considers Timing Constraints
ICPPW '04 Proceedings of the 2004 International Conference on Parallel Processing Workshops
IEEE Transactions on Mobile Computing
Competitive analysis of most-request-first for scheduling broadcasts with start-up delay
Theoretical Computer Science
Cognitive Agent Based Critical Information Gathering and Dissemination in Vehicular Ad hoc Networks
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
The essence of efficient scheduling and data transmission techniques lies in providing the web-applications with advanced data processing capabilities. In this paper we have efficiently combined the push and the pull scheduling to develop a new, practical, dynamic, hybrid scheduling strategy for heterogenous, asymmetric environments. The proposed algorithm dynamically computes the probabilities and the optimal cutoff-point to separate the push and the pull data sets. The data items are also assumed to be of variable lengths. While the push strategy uses the flat, roundrobin scheduling, the pull items are determined by stretch-optimal (max-request min-service time) scheduling policy. In order to make the scheduling more practical, we have considered the impact of the impatience of the clients waiting to get the service of a particular data item. The effects of this impatience can lead to departure of specific client(s) from the system. Our proposed hybrid scheduling strategy takes care of these effects to capture a real portrayal of the system dynamics. These scenarios are modelled by suitable birth and death process to analyze the overall expected delay of the system. Subsequently, simulation results corroborate the average system performance and points out significant improvement over existing hybrid systems in terms of average waiting time spent by a client.