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

    5 Citations (Scopus)
    280 Downloads (Pure)


    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 pk, and departs from the system with probability 1 - p, where p = Σk-1M pk (0 < p < 1). After receiving service at a FCFS node, a customer jumps back to the PS node. For this model, we focus on the mean and the variability of the sojourn time of an arbitrary customer in the system. The model is a product-form network, which immediately leads to a closed-form expression for the mean sojourn times. The variance of the sojourn times, however, does not admit an exact expression; the complexity is caused by the possibility of overtaking. To this end, we propose a new methodology for deriving closed-form approximations for the variance of sojourn times in queueing networks with feedback. Numerical results from extensive experimentation with simulations demonstrates that the approximations are highly accurate for a wide range of parameter values.
    Original languageEnglish
    Pages (from-to)743-758
    Number of pages16
    JournalPerformance evaluation
    Issue number8
    Publication statusPublished - Aug 2006


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

    Cite this