Sojourn-time approximations in queueing networks with feedback

B.M.M. Gijsen; R.D. van der Mei; P. Engelberts; J.L. van den Berg; K.M.C. van Wingerden

doi:10.1016/j.peva.2005.08.002

Sojourn-time approximations in queueing networks with feedback

B.M.M. Gijsen, R.D. van der Mei, P. Engelberts, J.L. van den Berg, K.M.C. van Wingerden

Mathematics

Research output: Contribution to Journal › Article › Academic › peer-review

Abstract

This paper is motivated by the response-time analysis of distributed information systems, where transactions are handled by a sequence of front-end server and back-end server actions. We study sojourn times in an open queueing network with a single Processor Sharing (PS) node and an arbitrary number of M multi-server First-Come-First-Served (FCFS) nodes. Customers arrive at the PS according to a Poisson process. After departing from the PS node a customer jumps to FCFS node k with probability p

Original language	English
Pages (from-to)	743-758
Journal	Performance Evaluation
Volume	63
DOIs	https://doi.org/10.1016/j.peva.2005.08.002
Publication status	Published - 2006

Bibliographical note

wingerden2006

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1016/j.peva.2005.08.002

Handle.net

Persistent link

Cite this

@article{7c841c287806492694e8e6bc3f3b9dd6,

title = "Sojourn-time approximations in queueing networks with feedback",

abstract = "This paper is motivated by the response-time analysis of distributed information systems, where transactions are handled by a sequence of front-end server and back-end server actions. We study sojourn times in an open queueing network with a single Processor Sharing (PS) node and an arbitrary number of M multi-server First-Come-First-Served (FCFS) nodes. Customers arrive at the PS according to a Poisson process. After departing from the PS node a customer jumps to FCFS node k with probability p",

author = "B.M.M. Gijsen and {van der Mei}, R.D. and P. Engelberts and {van den Berg}, J.L. and {van Wingerden}, K.M.C.",

note = "wingerden2006 ",

year = "2006",

doi = "10.1016/j.peva.2005.08.002",

language = "English",

volume = "63",

pages = "743--758",

journal = "Performance Evaluation",

issn = "0166-5316",

publisher = "Elsevier",

}

TY - JOUR

T1 - Sojourn-time approximations in queueing networks with feedback

AU - Gijsen, B.M.M.

AU - van der Mei, R.D.

AU - Engelberts, P.

AU - van den Berg, J.L.

AU - van Wingerden, K.M.C.

N1 - wingerden2006

PY - 2006

Y1 - 2006

N2 - This paper is motivated by the response-time analysis of distributed information systems, where transactions are handled by a sequence of front-end server and back-end server actions. We study sojourn times in an open queueing network with a single Processor Sharing (PS) node and an arbitrary number of M multi-server First-Come-First-Served (FCFS) nodes. Customers arrive at the PS according to a Poisson process. After departing from the PS node a customer jumps to FCFS node k with probability p

AB - This paper is motivated by the response-time analysis of distributed information systems, where transactions are handled by a sequence of front-end server and back-end server actions. We study sojourn times in an open queueing network with a single Processor Sharing (PS) node and an arbitrary number of M multi-server First-Come-First-Served (FCFS) nodes. Customers arrive at the PS according to a Poisson process. After departing from the PS node a customer jumps to FCFS node k with probability p

U2 - 10.1016/j.peva.2005.08.002

DO - 10.1016/j.peva.2005.08.002

M3 - Article

VL - 63

SP - 743

EP - 758

JO - Performance Evaluation

JF - Performance Evaluation

SN - 0166-5316

ER -

Sojourn-time approximations in queueing networks with feedback

Abstract

Bibliographical note

UN SDGs

Access to Document

Handle.net

Fingerprint

Cite this