Sojourn time approximations in two-node queueing networks

O.J. Boxma; B.M.M. Gijsen; R.D. Mei, van der; J.A.C. Resing

Sojourn time approximations in two-node queueing networks

O.J. Boxma, B.M.M. Gijsen, R.D. Mei, van der, J.A.C. Resing

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Abstract

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.

Original language	English
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
Pages	P17/1-P17/6
ISBN (Print)	0-9540151-6-9
Publication status	Published - 2004

Cite this

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.

@inproceedings{62c42b6ed4da4b35871db16cfd5d829e,

title = "Sojourn time approximations in two-node queueing networks",

abstract = "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.",

author = "O.J. Boxma and B.M.M. Gijsen and {Mei, van der}, R.D. and J.A.C. Resing",

year = "2004",

language = "English",

isbn = "0-9540151-6-9",

pages = "P17/1--P17/6",

editor = "D.D. Kouvatsos and {et al.}, xx",

booktitle = "Proceedings 2nd International Working Conference on Performance Modelling and Evaluation of Heterogeneous Networks (HET-NETs '04, Ilkley, UK, July 26-28, 2004)",

publisher = "Networks UK Publishers",

}

Sojourn time approximations in two-node queueing networks. / Boxma, O.J.; Gijsen, B.M.M.; Mei, van der, R.D. et al.
Proceedings 2nd International Working Conference on Performance Modelling and Evaluation of Heterogeneous Networks (HET-NETs '04, Ilkley, UK, July 26-28, 2004). ed. / D.D. Kouvatsos; xx et al. Networks UK Publishers, 2004. p. P17/1-P17/6.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Sojourn time approximations in two-node queueing networks

AU - Boxma, O.J.

AU - Gijsen, B.M.M.

AU - Mei, van der, R.D.

AU - Resing, J.A.C.

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

M3 - Conference contribution

SN - 0-9540151-6-9

SP - P17/1-P17/6

BT - Proceedings 2nd International Working Conference on Performance Modelling and Evaluation of Heterogeneous Networks (HET-NETs '04, Ilkley, UK, July 26-28, 2004)

A2 - Kouvatsos, D.D.

A2 - et al., xx

PB - Networks UK Publishers

ER -

Sojourn time approximations in two-node queueing networks

Abstract

Fingerprint

Cite this