Title 



A fair comparison of pull and push strategies in large distributed networks
 
Author 



 
Abstract 



In this paper, we compare the performance of the pull and push strategies in a large homogeneous distributed system. When a pull strategy is in use, lightly loaded nodes attempt to steal jobs from more highly loaded nodes, while under the push strategy, more highly loaded nodes look for lightly loaded nodes to process some of their jobs. Given the maximum allowed overall probe rate R and arrival rate lambda, we provide closedform solutions for the mean response time of a job for the push and pull strategy under the infinite system model. More specifically, we show that the push strategy outperforms the pull strategy for any probe rate R > 0 when lambda < phi1, where phi = (1 + root 5)/2 approximate to 1.6180 is the golden ratio. More generally, we show that the push strategy prevails if and only if 2 lambda < root(R+1)(2) + 4(R+1)  (R+1). We also show that under the infinite system model, a hybrid pullandpush strategy is always inferior to the pure pull or push strategy. The relation between the finite and infinite system model is discussed, and simulation results that validate the infinite system model are provided.   
Language 



English
 
Source (journal) 



IEEE/ACM transactions on networking / Institute of Electrical and Electronics Engineers [New York, N.Y.]; Association for Computing Machinery.  Piscataway, N.J.  
Publication 



Piscataway, N.J. : 2014
 
ISSN 



10636692
 
Volume/pages 



22:3(2014), p. 9961006
 
ISI 



000338124100024
 
Full text (Publisher's DOI) 


  
Full text (publisher's version  intranet only) 


  
