A formal proof for the insensitivity of simple bounds for finite multi-server non-exponential tandem queues based on monotonicity results

Nico van Dijk

Stochastic Processes and their Applications, 1987, vol. 27, 261-277

Abstract: In Van Dijk and Lamond (1985) and Van Dijk and Van der Wal (1986) simple and intuitively obvious bounds were provided for finite tandem queues with blocking in the exponential case. This technical note formally proves that these bounds are insensitive, that is remain valid in the non-exponential case, for multi-server disciplines. The proof is based on showing structured monotonicity results by means of Markov reward theory. This technique extends standard approaches for proving monotonicity results. It seems promising for further application.

Keywords: tandem; queue; bounds; Markov; chain; phase-method (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0304-4149(87)90041-X
Full text for ScienceDirect subscribers only

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:eee:spapps:v:27:y:1987:i::p:261-277

Ordering information: This journal article can be ordered from
http://http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Stochastic Processes and their Applications is currently edited by T. Mikosch

More articles in Stochastic Processes and their Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().