Rapid, efficient analysis of the lambda (n)/C sub k/r/N queue, with application to decomposition of closed queuing networks
A paper exploits advances in computational linear algebra and computing power to solve for the stationary probability vector of the related continuous time Markov chain (CTMC) of a lambda (n)/C sub k/r/N queue. The insights gained from studying the transition rate matrix of this chain are used to de...
Saved in:
| Published in | Computers & operations research Vol. 25; no. 7,8; p. 543 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
New York
Pergamon Press Inc
01.07.1998
|
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Abstract | A paper exploits advances in computational linear algebra and computing power to solve for the stationary probability vector of the related continuous time Markov chain (CTMC) of a lambda (n)/C sub k/r/N queue. The insights gained from studying the transition rate matrix of this chain are used to develop a list of candidate solution methods, each of which is used to calculate stationary probabilities for a set of 46 representative large-dimension problems. Based on this computational experience, a preferred solution approach for this type of CTMC is proposed. The effectiveness of the solution approach is demonstrated by using Marie's method to decompose 4 queuing networks containing stations with multiple k-phase Coaxian servers. |
|---|---|
| AbstractList | A paper exploits advances in computational linear algebra and computing power to solve for the stationary probability vector of the related continuous time Markov chain (CTMC) of a lambda (n)/C sub k/r/N queue. The insights gained from studying the transition rate matrix of this chain are used to develop a list of candidate solution methods, each of which is used to calculate stationary probabilities for a set of 46 representative large-dimension problems. Based on this computational experience, a preferred solution approach for this type of CTMC is proposed. The effectiveness of the solution approach is demonstrated by using Marie's method to decompose 4 queuing networks containing stations with multiple k-phase Coaxian servers. |
| Author | Dietz, D C Willits, C J |
| Author_xml | – sequence: 1 givenname: C surname: Willits middlename: J fullname: Willits, C J – sequence: 2 givenname: D surname: Dietz middlename: C fullname: Dietz, D C |
| BookMark | eNqNTssKwkAQW0TB5z8MnhSUtmp9nEXx5EG8y9pOdXTdWTtbRPx5i3jwaC4JIQlpqqplixXVCMdhPAzjybz6o-uqKXIJS8xGUUO9dtpROgDMMkoIrQdttXkKCXAG_oxg9O2YaujZfrAEKY5wDfJgC_cCCxzAg_wZtHOGEu2JLXiGFBO-ORb6GOVMYlgw_VTInsCif3B-lbaqZdoIdr7cUt31ar_cDF3OZVb84cJFXt6RQ7SI5_Eomk7Gf4Xe28FQbQ |
| CODEN | CMORAP |
| ContentType | Journal Article |
| Copyright | Copyright Pergamon Press Inc. Jul/Aug 1998 |
| Copyright_xml | – notice: Copyright Pergamon Press Inc. Jul/Aug 1998 |
| DBID | 7SC 8FD JQ2 L7M L~C L~D |
| DatabaseName | Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Technology Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 0305-0548 |
| ExternalDocumentID | 40356757 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 186 1B1 1RT 1~. 1~5 29F 457 4G. 5GY 5VS 6J9 7-5 71M 7SC 8FD 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAFJI AAIKJ AAKOC AALRI AAOAW AAQXK AARIN AAXKI AAXUO AAYFN AAYOK ABAOU ABBOA ABEFU ABFNM ABFRF ABJNI ABMAC ABMMH ABUCO ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD AEFWE AEHXG AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJOXV AKRWK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EFJIC EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBOLZ HAMUX HVGLF HZ~ IHE J1W JQ2 KOM L7M LY1 L~C L~D M41 MHUIS MO0 MS~ O-L O9- OAUVE OZT P-9 P2P PC. PQQKQ PRBVW Q38 R2- ROL RPZ RXW SDF SDG SDP SDS SES SPC SPCBC SSB SSD SSO SSV SSW SSZ T5K TAE TN5 U5U UAO UPT VH1 XPP ZMT ~02 ~G- |
| ID | FETCH-proquest_journals_1958521643 |
| ISSN | 0305-0548 |
| IngestDate | Fri Sep 13 03:27:11 EDT 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 7,8 |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-proquest_journals_1958521643 |
| PQID | 195852164 |
| PQPubID | 45870 |
| ParticipantIDs | proquest_journals_195852164 |
| PublicationCentury | 1900 |
| PublicationDate | 19980701 |
| PublicationDateYYYYMMDD | 1998-07-01 |
| PublicationDate_xml | – month: 07 year: 1998 text: 19980701 day: 01 |
| PublicationDecade | 1990 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Computers & operations research |
| PublicationYear | 1998 |
| Publisher | Pergamon Press Inc |
| Publisher_xml | – name: Pergamon Press Inc |
| SSID | ssj0000721 |
| Score | 3.1338706 |
| Snippet | A paper exploits advances in computational linear algebra and computing power to solve for the stationary probability vector of the related continuous time... |
| SourceID | proquest |
| SourceType | Aggregation Database |
| StartPage | 543 |
| SubjectTerms | Linear algebra Markov analysis Operations research Queuing Studies |
| Title | Rapid, efficient analysis of the lambda (n)/C sub k/r/N queue, with application to decomposition of closed queuing networks |
| URI | https://www.proquest.com/docview/195852164/abstract/ |
| Volume | 25 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEF5sD6IHH1VRqzKIB6VNX0maepQ-EKlVpIXeSh5bKUpSmvSi4G93ZnfTpFiKeglhQzaP-Zidnf3mW8auOM6RdV4baw2n5mqG7RroBz1P84yGXXd51eYe1Q4_9ur3A-NhaA4TSpCoLomckvuxsq7kP1bFNrQrVcn-wbKLTrEBz9G-eEQL4_FXNn6xpxNhIS6EICRdPBEZoZgSDe54NsWRlAAgNdxCOHcK6AM7JBzSK-C4MBdJTVnllqxnU1TqcaKcK16XYKC_ByGGqHQT5Rh8SSIP0yFuvE9EKFAVTPlMse2UrtAi_yxSPZGUOEhWp1oTLraYLbRUAtdLavSsdErimc9eaaskySJZJnSSf9EwTJQ-l69oU15ZlkMr9Fn42EbKzZpS2mlZPrv3NOoMut1Rvz3sL18Vw7VR0U2cHVkZltGrRP4sfSVkIFKJk-tN8k1-jMwi3OjvsR01T4A7afR9tsH9HNuMyxRybDf-zaC8c45tp7QlD9inAEcRFtCAGBoQjAGhARIacO3flJuAoIC38qzcAwGIIhAcIAUHiAJYggN1I-EACg4Qw-GQXXba_ea9Fn_dSME5HJHqEMZyGKEesawf-PyYAXdt_CNUQ2SYhmvqtlW3qrcOr-uWNbYq1ROWX9PR6dqrebaVYOeMZaPZnJ9jgBc5F8I2324AXF0 |
| link.rule.ids | 315,786,790 |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Rapid%2C+efficient+analysis+of+the+lambda+%28n%29%2FC+sub+k%2Fr%2FN+queue%2C+with+application+to+decomposition+of+closed+queuing+networks&rft.jtitle=Computers+%26+operations+research&rft.au=Willits%2C+C+J&rft.au=Dietz%2C+D+C&rft.date=1998-07-01&rft.pub=Pergamon+Press+Inc&rft.issn=0305-0548&rft.eissn=0305-0548&rft.volume=25&rft.issue=7%2C8&rft.spage=543&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=40356757 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon |