A Concept of Monotonicity and Its Characterization for Closed Queueing Networks

Rajan Suri
Additional contact information
Rajan Suri: Harvard University, Cambridge, Massachusetts

Operations Research, 1985, vol. 33, issue 3, 606-624

Abstract: We define a qualitative property, called monotonicity, for a closed queueing network. This property is defined both for a station in the network and for the network as a whole. Several results in this paper relate monotonic behavior to the known parameters of a network and allow us to state a priori, for many practical systems, whether the monotonicity property will apply for a network or a station. Monotonicity thus ensures that the system is well-behaved with respect to a number of parameters. We present diverse examples that demonstrate how knowledge of this property can be useful in network design and performance evaluation.

Keywords: 64 computer system performance modeling; 585 flexible manufacturing systems; 694 closed queueing networks (search for similar items in EconPapers)
Date: 1985
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.33.3.606 (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:33:y:1985:i:3:p:606-624

Access Statistics for this article

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