A probabilistic push-pull hybrid scheduling algorithm for asymmetric wireless environment

The vision of mobile computing lies in a seamless connectivity with the mobile clients and transmission of data in precise quality of service (QoS) guarantee. In order to endow such mobile applications with advanced data processing capabilities, efficient, dynamic scheduling algorithms are necessary. In this paper, we have introduced a new hybrid scheduling algorithm that probabilistically combines the number of push and pull operations depending on the number of items present in the system and their popularity. The access probabilities of the data items are computed dynamically, without any prior knowledge. The basic elixir of our work lies in the efficiency of the algorithm in obtaining an improved data access-time, even with high system load and items having equivalent degree of access probabilities. The expected waiting time spent by a client is evaluated and compared analytically. Simulation results point out sufficient improvement in average waiting time than pure push systems and some existing hybrid systems.