Wireless Networks With Retrials and Heterogeneous Servers : Comparing Random Server and Fastest Free Server Disciplines
This paper proposes an algorithmic approach based on Generalized Stochastic Petri Nets, for modeling and analyzing finite-source wireless networks with retrial phenomenon and two servers' classes. The particularity of this approach is the direct computing of the infinitesimal generator of the proposed Generalized Stochastic Petri Net without generating neither the reachability graph nor the underlying Markov chain. Furthermore, the authors assume in this model that servers of one class are faster than those of the second one. In Random Server policy, customers requests are assigned randomly to free servers of both classes. The disadvantage of this policy is the increased response time when fast servers are free and requests are assigned (randomly) to slow ones.