Exact transient analysis of a circulant queuing network
Circulant matrices possess unusual and interesting properties. These properties have been exploited to obtain the transient solution in closed form for a circulant queuing network that models a distributed query processing system. The sojourn time of a customer in the circulant queuing network is determined. A semi-Markov generalisation of this network is also studied. (C) 2002 Elsevier Science Ltd. All rights reserved.
circulants queuing networks sojourn times semi-markov process