Performance analysis of a novel hybrid push–pull algorithm with QoS adaptations in wireless networks

Abstract

In this paper, we present a novel hybrid push-pull algorithm which combines broadcasting of push data items, with dissemination upon request of pull items in asymmetric communication environments. These environments are made up only of one database server and many clients. Requests made by the clients are queued up for the pull items. The (pull) item with the number of pending requests is the one selected to be pulled. We present a performance analysis of our scheme, and determine the individual response time for each item disseminated and the overall time for the pull queue to be flushed. Next, we extend our algorithm by incorporating quality of service (QoS) factors, and then, study its performance analytically.