Isomorphs of a class of Queueing systems

A. Ghosal and Sudhir Madan

International Journal of Mathematics and Mathematical Sciences, 1979, vol. 2, 1-8

Abstract:

Restricted isomorphism between two queueing systems implies that they have equivalent distribution function for at least one (but not all) output elements (e.g. waiting time, queue size, idle time, etc.). Quasi-isomorphism implies an approximate equivalence. Most of the single-server queueing systems can be approximated by a quasi-isomorphic system which has a gamma inter-arrival and gamma service distributions ( E p / E q / 1 ) .

This paper deals with the derivation of simpler isomorphs (in quasi-restricted sense) for such gamma-gamma ( E p / E q / 1 ) systems.

Date: 1979
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2/643169.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2/643169.xml (text/xml)

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:hin:jijmms:643169

DOI: 10.1155/S0161171279000107

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().