Isomorphs of a class of Queueing systems
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 system...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
1979-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1155/S0161171279000107 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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 (Ep/Eq/1). |
|---|---|
| ISSN: | 0161-1712 1687-0425 |