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!
|
| _version_ | 1832554667054202880 |
|---|---|
| author | A. Ghosal Sudhir Madan |
| author_facet | A. Ghosal Sudhir Madan |
| author_sort | A. Ghosal |
| collection | DOAJ |
| description | 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). |
| format | Article |
| id | doaj-art-d4c312fd30e742918cec97abc884186b |
| institution | Kabale University |
| issn | 0161-1712 1687-0425 |
| language | English |
| publishDate | 1979-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Mathematics and Mathematical Sciences |
| spelling | doaj-art-d4c312fd30e742918cec97abc884186b2025-02-03T05:51:01ZengWileyInternational Journal of Mathematics and Mathematical Sciences0161-17121687-04251979-01-012110311010.1155/S0161171279000107Isomorphs of a class of Queueing systemsA. Ghosal0Sudhir Madan1Operational Research group, CSIR, New Delhi, IndiaUniversity of Delhi, IndiaRestricted 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).http://dx.doi.org/10.1155/S0161171279000107isomorphrestricted isomorphquasi-restricted (Q. R.) isomorphwaiting timequeue sizeidle timegamma distribution. |
| spellingShingle | A. Ghosal Sudhir Madan Isomorphs of a class of Queueing systems International Journal of Mathematics and Mathematical Sciences isomorph restricted isomorph quasi-restricted (Q. R.) isomorph waiting time queue size idle time gamma distribution. |
| title | Isomorphs of a class of Queueing systems |
| title_full | Isomorphs of a class of Queueing systems |
| title_fullStr | Isomorphs of a class of Queueing systems |
| title_full_unstemmed | Isomorphs of a class of Queueing systems |
| title_short | Isomorphs of a class of Queueing systems |
| title_sort | isomorphs of a class of queueing systems |
| topic | isomorph restricted isomorph quasi-restricted (Q. R.) isomorph waiting time queue size idle time gamma distribution. |
| url | http://dx.doi.org/10.1155/S0161171279000107 |
| work_keys_str_mv | AT aghosal isomorphsofaclassofqueueingsystems AT sudhirmadan isomorphsofaclassofqueueingsystems |