On Total Sojourn Time in Acyclic Jackson Networks

Abstract

In this paper, we compute the mean of the equilibrium (steady-state) total sojourn time distribution for the important class of infinite capacity acyclic Jackson networks with a single server at each node. In addition, for those acyclic Jackson networks with a 'tree-like' structure, we derive the Laplace transform of the equilibrium total sojourn time distribution and then give a simple recursive procedure for computing the higher moments of the distribution. Such basic results should prove helpful in testing procedures for simulation output analysis of infinite capacity open networks of queues.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1979
Accession Number
ADA064427

Entities

People

  • Austin J. Lemoine

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Control Systems Engineering
  • Equations
  • Intensity
  • Intervals
  • Markov Processes
  • Mathematics
  • Operations Research
  • Probability
  • Probability Distributions
  • Queueing Theory
  • Random Variables
  • Simulations
  • Stationary
  • Steady State
  • Time Intervals
  • United States

Fields of Study

  • Mathematics

Readers

  • Mathematical Modeling and Probability Theory.