Sojourn time approximations in queueing networks with feedback

  • Authors:

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

  • Affiliations:

  • TNO Information and Communication Technology, Department of Planning, Performance and Quality of Service, Delft, The Netherlands;CWI, Department of Advanced Communication Networks--PNA2, Center for Mathematics and Computer Science, SJ Amsterdam, The Netherlands and Vrije Universiteit, Faculty of Sciences, HV Amsterdam, The ...;TNO Information and Communication Technology, Department of Planning, Performance and Quality of Service, Delft, The Netherlands;TNO Information and Communication Technology, Department of Planning, Performance and Quality of Service, Delft, The Netherlands and University of Twente, Faculty of Sciences, Enschede, The Nether ...;TNO Information and Communication Technology, Department of Planning, Performance and Quality of Service, Delft, The Netherlands and CWI, Department of Advanced Communication Networks, Amsterdam, ...

  • Venue:
  • Performance Evaluation
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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 pk, and departs from the system with probability 1 - p, where p = Σk-1M pk (0 p