A Simple Proof of the Equivalence of Input and Output Intervals in Jackson Networks of Single Server Nodes

Peter C. Kiessler
Additional contact information
Peter C. Kiessler: Virginia Commonwealth University, Richmond, Virginia

Operations Research, 1989, vol. 37, issue 4, 645-647

Abstract: In this paper, we provide a simple proof that the distributions of an input and an output interval in a stationary Jackson network of single server nodes are equivalent. The proof also applies to Gordon and Newell networks of single server nodes. The proof's key idea is that the reverse process of a Jackson network's stationary queue length process is also a Jackson network's stationary queue length process.

Keywords: queues; networks: traffic processes in networks (search for similar items in EconPapers)
Date: 1989
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.37.4.645 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:37:y:1989:i:4:p:645-647

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().