An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking
This paper presents an efficient method for evaluating performance measures for a class of tandem queueing systems with finite buffers in which blocking and starvation are important. These systems are difficult to evaluate because they have large state spaces and because they cannot be decomposed ex...
Gespeichert in:
| Veröffentlicht in: | Operations research 1987-03, Vol.35 (2), p.291-305 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 305 |
|---|---|
| container_issue | 2 |
| container_start_page | 291 |
| container_title | Operations research |
| container_volume | 35 |
| creator | Gershwin, Stanley B |
| description | This paper presents an efficient method for evaluating performance measures for a class of tandem queueing systems with finite buffers in which blocking and starvation are important. These systems are difficult to evaluate because they have large state spaces and because they cannot be decomposed exactly. The approximate decomposition approach we describe is based on system characteristics such as conservation of flow. Comparisons with exact and simulation results indicate that the approach is very accurate. |
| doi_str_mv | 10.1287/opre.35.2.291 |
| format | Article |
| fullrecord | <record><control><sourceid>jstor_highw</sourceid><recordid>TN_cdi_highwire_informs_opres_35_2_291</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><jstor_id>170701</jstor_id><sourcerecordid>170701</sourcerecordid><originalsourceid>FETCH-LOGICAL-c477t-52881e7d6530186703765298bd786425586413f34ec2ef356697b0b9daf47f773</originalsourceid><addsrcrecordid>eNqFkc1vEzEQxS0EEqFw5NSL1SJO3eCPtb17DCUFpFYVoki9WY7XzjpN7MV2aPnv62VbekJcZg7zmzej9wB4i9Eck0Z8CEM0c8rmZE5a_AzMMCO8YjWnz8EMIYoqyuvrl-BVShuEUMs4m4G7hYdLa512xmf4yeiwG0Jy2QUPL0zuQwdtiDD3Bi6GIYY7t1PZwOUvtd2rP1Sw8Er5zuzgt73ZmwRvXe7hmfOucN9ziGpd-qC0gQWDH7dB3zi_fg1eWLVN5s1DPwA_zpZXp1-q88vPX08X55WuhcgVI02Djeg4owg3XCAqOCNts-pEw2vCWKmYWlobTYyljPNWrNCq7ZSthRWCHoCjSbc8_7O8l-Um7KMvJyXBLSY1w22Bjv8FYVqcEy1pRqqaKB1DStFYOcRiR_wtMZJjAnJMQFImiSwJFP7dg6pKWm1tVF679HdJMEERYgU7nLBNKm49aQok0ChyMk2dL0Hs0n9vvp_w3q37W1dGj3sjl57Ae-MBqo4</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1303079289</pqid></control><display><type>article</type><title>An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking</title><source>INFORMS PubsOnLine</source><source>Business Source Complete</source><source>Periodicals Index Online</source><source>JSTOR Archive Collection A-Z Listing</source><creator>Gershwin, Stanley B</creator><creatorcontrib>Gershwin, Stanley B</creatorcontrib><description>This paper presents an efficient method for evaluating performance measures for a class of tandem queueing systems with finite buffers in which blocking and starvation are important. These systems are difficult to evaluate because they have large state spaces and because they cannot be decomposed exactly. The approximate decomposition approach we describe is based on system characteristics such as conservation of flow. Comparisons with exact and simulation results indicate that the approach is very accurate.</description><identifier>ISSN: 0030-364X</identifier><identifier>EISSN: 1526-5463</identifier><identifier>DOI: 10.1287/opre.35.2.291</identifier><identifier>CODEN: OPREAI</identifier><language>eng</language><publisher>Linthicum, MD: INFORMS</publisher><subject>343 inventory levels and throughput in transfer lines ; 570 Markov chain model of transfer lines ; 683 decomposition approximation of queueing networks ; 721 reliability and storage ; Analysis ; Applied sciences ; Approximation ; Arithmetic mean ; Assembly lines ; Buffer storage ; Decomposition methods ; Exact sciences and technology ; Lines in space ; Mathematical analysis ; Modeling ; Network servers ; Networks ; Operational research and scientific management ; Operational research. Management science ; Operations research ; Queuing theory ; Queuing theory. Traffic theory ; Space storage ; Starvation</subject><ispartof>Operations research, 1987-03, Vol.35 (2), p.291-305</ispartof><rights>Copyright 1987 The Operations Research Society of America</rights><rights>1988 INIST-CNRS</rights><rights>Copyright Institute for Operations Research and the Management Sciences Mar/Apr 1987</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c477t-52881e7d6530186703765298bd786425586413f34ec2ef356697b0b9daf47f773</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.jstor.org/stable/pdf/170701$$EPDF$$P50$$Gjstor$$H</linktopdf><linktohtml>$$Uhttps://pubsonline.informs.org/doi/full/10.1287/opre.35.2.291$$EHTML$$P50$$Ginforms$$H</linktohtml><link.rule.ids>314,780,784,803,3692,27869,27924,27925,58017,58250,62616</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=7573005$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Gershwin, Stanley B</creatorcontrib><title>An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking</title><title>Operations research</title><description>This paper presents an efficient method for evaluating performance measures for a class of tandem queueing systems with finite buffers in which blocking and starvation are important. These systems are difficult to evaluate because they have large state spaces and because they cannot be decomposed exactly. The approximate decomposition approach we describe is based on system characteristics such as conservation of flow. Comparisons with exact and simulation results indicate that the approach is very accurate.</description><subject>343 inventory levels and throughput in transfer lines</subject><subject>570 Markov chain model of transfer lines</subject><subject>683 decomposition approximation of queueing networks</subject><subject>721 reliability and storage</subject><subject>Analysis</subject><subject>Applied sciences</subject><subject>Approximation</subject><subject>Arithmetic mean</subject><subject>Assembly lines</subject><subject>Buffer storage</subject><subject>Decomposition methods</subject><subject>Exact sciences and technology</subject><subject>Lines in space</subject><subject>Mathematical analysis</subject><subject>Modeling</subject><subject>Network servers</subject><subject>Networks</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Operations research</subject><subject>Queuing theory</subject><subject>Queuing theory. Traffic theory</subject><subject>Space storage</subject><subject>Starvation</subject><issn>0030-364X</issn><issn>1526-5463</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1987</creationdate><recordtype>article</recordtype><sourceid>K30</sourceid><recordid>eNqFkc1vEzEQxS0EEqFw5NSL1SJO3eCPtb17DCUFpFYVoki9WY7XzjpN7MV2aPnv62VbekJcZg7zmzej9wB4i9Eck0Z8CEM0c8rmZE5a_AzMMCO8YjWnz8EMIYoqyuvrl-BVShuEUMs4m4G7hYdLa512xmf4yeiwG0Jy2QUPL0zuQwdtiDD3Bi6GIYY7t1PZwOUvtd2rP1Sw8Er5zuzgt73ZmwRvXe7hmfOucN9ziGpd-qC0gQWDH7dB3zi_fg1eWLVN5s1DPwA_zpZXp1-q88vPX08X55WuhcgVI02Djeg4owg3XCAqOCNts-pEw2vCWKmYWlobTYyljPNWrNCq7ZSthRWCHoCjSbc8_7O8l-Um7KMvJyXBLSY1w22Bjv8FYVqcEy1pRqqaKB1DStFYOcRiR_wtMZJjAnJMQFImiSwJFP7dg6pKWm1tVF679HdJMEERYgU7nLBNKm49aQok0ChyMk2dL0Hs0n9vvp_w3q37W1dGj3sjl57Ae-MBqo4</recordid><startdate>19870301</startdate><enddate>19870301</enddate><creator>Gershwin, Stanley B</creator><general>INFORMS</general><general>Operations Research Society of America</general><general>Institute for Operations Research and the Management Sciences</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>HJHVS</scope><scope>IBDFT</scope><scope>K30</scope><scope>PAAUG</scope><scope>PAWHS</scope><scope>PAWZZ</scope><scope>PAXOH</scope><scope>PBHAV</scope><scope>PBQSW</scope><scope>PBYQZ</scope><scope>PCIWU</scope><scope>PCMID</scope><scope>PCZJX</scope><scope>PDGRG</scope><scope>PDWWI</scope><scope>PETMR</scope><scope>PFVGT</scope><scope>PGXDX</scope><scope>PIHIL</scope><scope>PISVA</scope><scope>PJCTQ</scope><scope>PJTMS</scope><scope>PLCHJ</scope><scope>PMHAD</scope><scope>PNQDJ</scope><scope>POUND</scope><scope>PPLAD</scope><scope>PQAPC</scope><scope>PQCAN</scope><scope>PQCMW</scope><scope>PQEME</scope><scope>PQHKH</scope><scope>PQMID</scope><scope>PQNCT</scope><scope>PQNET</scope><scope>PQSCT</scope><scope>PQSET</scope><scope>PSVJG</scope><scope>PVMQY</scope><scope>PZGFC</scope><scope>JQ2</scope><scope>K9.</scope></search><sort><creationdate>19870301</creationdate><title>An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking</title><author>Gershwin, Stanley B</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c477t-52881e7d6530186703765298bd786425586413f34ec2ef356697b0b9daf47f773</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1987</creationdate><topic>343 inventory levels and throughput in transfer lines</topic><topic>570 Markov chain model of transfer lines</topic><topic>683 decomposition approximation of queueing networks</topic><topic>721 reliability and storage</topic><topic>Analysis</topic><topic>Applied sciences</topic><topic>Approximation</topic><topic>Arithmetic mean</topic><topic>Assembly lines</topic><topic>Buffer storage</topic><topic>Decomposition methods</topic><topic>Exact sciences and technology</topic><topic>Lines in space</topic><topic>Mathematical analysis</topic><topic>Modeling</topic><topic>Network servers</topic><topic>Networks</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Operations research</topic><topic>Queuing theory</topic><topic>Queuing theory. Traffic theory</topic><topic>Space storage</topic><topic>Starvation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Gershwin, Stanley B</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Periodicals Index Online Segment 19</collection><collection>Periodicals Index Online Segment 27</collection><collection>Periodicals Index Online</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - West</collection><collection>Primary Sources Access (Plan D) - International</collection><collection>Primary Sources Access & Build (Plan A) - MEA</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - Midwest</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - Northeast</collection><collection>Primary Sources Access (Plan D) - Southeast</collection><collection>Primary Sources Access (Plan D) - North Central</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - Southeast</collection><collection>Primary Sources Access (Plan D) - South Central</collection><collection>Primary Sources Access & Build (Plan A) - UK / I</collection><collection>Primary Sources Access (Plan D) - Canada</collection><collection>Primary Sources Access (Plan D) - EMEALA</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - North Central</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - South Central</collection><collection>Primary Sources Access & Build (Plan A) - International</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - International</collection><collection>Primary Sources Access (Plan D) - West</collection><collection>Periodicals Index Online Segments 1-50</collection><collection>Primary Sources Access (Plan D) - APAC</collection><collection>Primary Sources Access (Plan D) - Midwest</collection><collection>Primary Sources Access (Plan D) - MEA</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - Canada</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - UK / I</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - EMEALA</collection><collection>Primary Sources Access & Build (Plan A) - APAC</collection><collection>Primary Sources Access & Build (Plan A) - Canada</collection><collection>Primary Sources Access & Build (Plan A) - West</collection><collection>Primary Sources Access & Build (Plan A) - EMEALA</collection><collection>Primary Sources Access (Plan D) - Northeast</collection><collection>Primary Sources Access & Build (Plan A) - Midwest</collection><collection>Primary Sources Access & Build (Plan A) - North Central</collection><collection>Primary Sources Access & Build (Plan A) - Northeast</collection><collection>Primary Sources Access & Build (Plan A) - South Central</collection><collection>Primary Sources Access & Build (Plan A) - Southeast</collection><collection>Primary Sources Access (Plan D) - UK / I</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - APAC</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - MEA</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Health & Medical Complete (Alumni)</collection><jtitle>Operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Gershwin, Stanley B</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking</atitle><jtitle>Operations research</jtitle><date>1987-03-01</date><risdate>1987</risdate><volume>35</volume><issue>2</issue><spage>291</spage><epage>305</epage><pages>291-305</pages><issn>0030-364X</issn><eissn>1526-5463</eissn><coden>OPREAI</coden><abstract>This paper presents an efficient method for evaluating performance measures for a class of tandem queueing systems with finite buffers in which blocking and starvation are important. These systems are difficult to evaluate because they have large state spaces and because they cannot be decomposed exactly. The approximate decomposition approach we describe is based on system characteristics such as conservation of flow. Comparisons with exact and simulation results indicate that the approach is very accurate.</abstract><cop>Linthicum, MD</cop><pub>INFORMS</pub><doi>10.1287/opre.35.2.291</doi><tpages>15</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0030-364X |
| ispartof | Operations research, 1987-03, Vol.35 (2), p.291-305 |
| issn | 0030-364X 1526-5463 |
| language | eng |
| recordid | cdi_highwire_informs_opres_35_2_291 |
| source | INFORMS PubsOnLine; Business Source Complete; Periodicals Index Online; JSTOR Archive Collection A-Z Listing |
| subjects | 343 inventory levels and throughput in transfer lines 570 Markov chain model of transfer lines 683 decomposition approximation of queueing networks 721 reliability and storage Analysis Applied sciences Approximation Arithmetic mean Assembly lines Buffer storage Decomposition methods Exact sciences and technology Lines in space Mathematical analysis Modeling Network servers Networks Operational research and scientific management Operational research. Management science Operations research Queuing theory Queuing theory. Traffic theory Space storage Starvation |
| title | An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T12%3A40%3A57IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-jstor_highw&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20Efficient%20Decomposition%20Method%20for%20the%20Approximate%20Evaluation%20of%20Tandem%20Queues%20with%20Finite%20Storage%20Space%20and%20Blocking&rft.jtitle=Operations%20research&rft.au=Gershwin,%20Stanley%20B&rft.date=1987-03-01&rft.volume=35&rft.issue=2&rft.spage=291&rft.epage=305&rft.pages=291-305&rft.issn=0030-364X&rft.eissn=1526-5463&rft.coden=OPREAI&rft_id=info:doi/10.1287/opre.35.2.291&rft_dat=%3Cjstor_highw%3E170701%3C/jstor_highw%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1303079289&rft_id=info:pmid/&rft_jstor_id=170701&rfr_iscdi=true |