| Article ID: | iaor2004784 |
| Country: | United Kingdom |
| Volume: | 44 |
| Issue: | 10/11 |
| Start Page Number: | 1297 |
| End Page Number: | 1306 |
| Publication Date: | Nov 2002 |
| Journal: | Computers & Mathematics with Applications |
| Authors: | Parthasarathy P.R., Selvaraju N., Manimaran G. |
| Keywords: | networks, markov processes |
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.