The Sojourn Time in a Three Node, Acyclic, Jackson Queueing Network.

Abstract

In this paper we consider the three node, acyclic, Jackson queueing network discussed by Simon and Foley (1980). We provide a solution to the sojourn time problem for a given customer. To the best of our knowledge, this is the first solution to the sojourn time problem in any acyclic Jackson network with overtaking. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 27, 1982
Accession Number
ADA110412

Entities

People

  • Peter Kiessler
  • Ralph L. Disney

Organizations

  • Virginia Tech

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • Applied Mathematics
  • Engineering
  • Equations
  • Industrial Engineering
  • Information Science
  • Interdisciplinary Science
  • Intervals
  • Markov Processes
  • Mathematics
  • Operations Research
  • Probability
  • Queueing Theory
  • Statistics
  • United States
  • United States Government
  • Virginia

Readers

  • Computer Networking
  • Mathematical Modeling and Probability Theory.