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

Research output: Contribution to JournalArticleAcademicpeer-review


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 languageEnglish
Pages (from-to)743-758
JournalPerformance Evaluation
Publication statusPublished - 2006

Bibliographical note



Dive into the research topics of 'Sojourn-time approximations in queueing networks with feedback'. Together they form a unique fingerprint.

Cite this