A Product Theorem for Markov Chains with Application to PF-Queueing Networks

Queueing networks in random environments represent more realistic models of computer and telecommunication systems than classical product form networks. This is due to the fact that network behaviour often depends on human activities which may vary according to daytime dependent behavioural patterns as well as physiological and mental indexes. In this paper we establish a product connection theorem for Markov chains which contains some corresponding results for spatial processes as well as for queueing networks in random environment as special cases. We demonstrate how our results can be applied to construct an adequate model for wireless networks with hook up capacity.