Letter to the Editor—Signal Flow Graphs and Analog Computation in the Analysis of Finite Queues

Ronald L. Gue
Additional contact information
Ronald L. Gue: University of Florida, Gainesville, Florida

Operations Research, 1966, vol. 14, issue 2, 342-350

Abstract: The signal flow graph has been shown to be a useful device for displaying and analyzing discrete state, continuous time, finite Markov processes (3, 4, 5, 6). The one-to-one correspondence between the flow graph and the wiring diagram for an analog computer is discussed. These concepts are summarized and used to outline a framework for the transient analysis of finite queues. Applications are discussed, including cases with non-Poisson arrivals and nonexponential service.

Date: 1966
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.14.2.342 (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:14:y:1966:i:2:p:342-350

Access Statistics for this article

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