We develop a method for approximating sojourn time distributions in open queueing networks. The work is motivated by the performance analysis of distributed information systems, where transactions are handled by iterative server and database actions. In this paper we restrict ourselves to a system with one server and a single database, modelled as an open two-node queueing network with a processor sharing node and a first-come first-served node. At the end of the note, we indicate some model extensions which can also be handled effectively by our method.
|Title of host publication||Proceedings 2nd International Working Conference on Performance Modelling and Evaluation of Heterogeneous Networks (HET-NETs '04, Ilkley, UK, July 26-28, 2004)|
|Editors||D.D. Kouvatsos, xx et al.|
|Publisher||Networks UK Publishers|
|Publication status||Published - 2004|
Boxma, O. J., Gijsen, B. M. M., Mei, van der, R. D., & Resing, J. A. C. (2004). Sojourn time approximations in two-node queueing networks. In D. D. Kouvatsos, & X. et al. (Eds.), Proceedings 2nd International Working Conference on Performance Modelling and Evaluation of Heterogeneous Networks (HET-NETs '04, Ilkley, UK, July 26-28, 2004) (pp. P17/1-P17/6). Networks UK Publishers.