Marginal queue length approximations for a two-layered network with correlated queues
We consider an extension of the classical machine-repair model, where we assume that the machines, apart from receiving service from the repairman, also serve queues of products. The extended model can be viewed as a layered queueing network, where the first layer consists of the queues of products...
Gespeichert in:
| Veröffentlicht in: | Queueing systems 2013-09, Vol.75 (1), p.29-63 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 63 |
|---|---|
| container_issue | 1 |
| container_start_page | 29 |
| container_title | Queueing systems |
| container_volume | 75 |
| creator | Dorsman, J. L. Boxma, O. J. Vlasiou, M. |
| description | We consider an extension of the classical machine-repair model, where we assume that the machines, apart from receiving service from the repairman, also serve queues of products. The extended model can be viewed as a layered queueing network, where the first layer consists of the queues of products and the second layer is the ordinary machine-repair model. As the repair time of one machine may affect the time the other machine is not able to process products, the downtimes of the machines are correlated. This correlation leads to dependence between the queues of products in the first layer. Analysis of these queue length distributions is hard, as the exact dependence structure for the downtimes, or the queue lengths, is not known. Therefore, we obtain an approximation for the complete marginal queue length distribution of any queue in the first layer, by viewing such a queue as a single server queue with correlated server downtimes. Under an explicit assumption on the form of the downtime dependence, we obtain exact results for the queue length distribution for that single server queue. We use these exact results to approximate the machine-repair model. We do so by computing the downtime correlation for the latter model and by subsequently using this information to fine-tune the parameters we introduced to the single server queue. As a result, we immediately obtain an approximation for the queue length distributions of products in the machine-repair model, which we show to be highly accurate by extensive numerical experiments. |
| doi_str_mv | 10.1007/s11134-012-9338-2 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1671560048</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3038992931</sourcerecordid><originalsourceid>FETCH-LOGICAL-c349t-644a22a6c0784eefb8c414faae1cd1019daded90ccbeb509aebb52530edc65313</originalsourceid><addsrcrecordid>eNp1kMtOwzAQRS0EEqXwAewssWETmPEjjyWqeElFbOjacpxJSUmTYicq_XsMZYGQWFljn3ttH8bOEa4QILsOiChVAiiSQso8EQdsgjqLk1LykE1A6CyeSjhmJyGsACAVupiwxZP1y6azLX8faSTeUrccXrndbHz_0azt0PRd4HXvueXDtk9auyNPFe8oTv6Nb5tIu957au0Q979bwik7qm0b6OxnnbLF3e3L7CGZP98_zm7miZOqGJJUKSuETR1kuSKqy9wpVLW1hK5CwKKyFVUFOFdSqaGwVJZaaAlUuVRLlFN2ue-Nr403h8Gsm-CobW1H_RgMphnqFEDlEb34g6760cePR0phLrXAWDlluKec70PwVJuNjxb8ziCYL9FmL9pE0eZLtBExI_aZENluSf5X87-hT2I5gc8</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1418352165</pqid></control><display><type>article</type><title>Marginal queue length approximations for a two-layered network with correlated queues</title><source>Springer Nature - Complete Springer Journals</source><creator>Dorsman, J. L. ; Boxma, O. J. ; Vlasiou, M.</creator><creatorcontrib>Dorsman, J. L. ; Boxma, O. J. ; Vlasiou, M.</creatorcontrib><description>We consider an extension of the classical machine-repair model, where we assume that the machines, apart from receiving service from the repairman, also serve queues of products. The extended model can be viewed as a layered queueing network, where the first layer consists of the queues of products and the second layer is the ordinary machine-repair model. As the repair time of one machine may affect the time the other machine is not able to process products, the downtimes of the machines are correlated. This correlation leads to dependence between the queues of products in the first layer. Analysis of these queue length distributions is hard, as the exact dependence structure for the downtimes, or the queue lengths, is not known. Therefore, we obtain an approximation for the complete marginal queue length distribution of any queue in the first layer, by viewing such a queue as a single server queue with correlated server downtimes. Under an explicit assumption on the form of the downtime dependence, we obtain exact results for the queue length distribution for that single server queue. We use these exact results to approximate the machine-repair model. We do so by computing the downtime correlation for the latter model and by subsequently using this information to fine-tune the parameters we introduced to the single server queue. As a result, we immediately obtain an approximation for the queue length distributions of products in the machine-repair model, which we show to be highly accurate by extensive numerical experiments.</description><identifier>ISSN: 0257-0130</identifier><identifier>EISSN: 1572-9443</identifier><identifier>DOI: 10.1007/s11134-012-9338-2</identifier><language>eng</language><publisher>Boston: Springer US</publisher><subject>Approximation ; Breakdowns ; Business and Management ; Computer Communication Networks ; Computer science ; Computer terminals ; Control ; Correlation ; Customer services ; Downtime ; Mathematical models ; Networks ; Operations Research/Decision Theory ; Probability Theory and Stochastic Processes ; Queues ; Queuing ; Receiving ; Servers ; Studies ; Supply Chain Management ; Systems Theory ; Vacations</subject><ispartof>Queueing systems, 2013-09, Vol.75 (1), p.29-63</ispartof><rights>Springer Science+Business Media New York 2013</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c349t-644a22a6c0784eefb8c414faae1cd1019daded90ccbeb509aebb52530edc65313</citedby><cites>FETCH-LOGICAL-c349t-644a22a6c0784eefb8c414faae1cd1019daded90ccbeb509aebb52530edc65313</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11134-012-9338-2$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s11134-012-9338-2$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,778,782,27911,27912,41475,42544,51306</link.rule.ids></links><search><creatorcontrib>Dorsman, J. L.</creatorcontrib><creatorcontrib>Boxma, O. J.</creatorcontrib><creatorcontrib>Vlasiou, M.</creatorcontrib><title>Marginal queue length approximations for a two-layered network with correlated queues</title><title>Queueing systems</title><addtitle>Queueing Syst</addtitle><description>We consider an extension of the classical machine-repair model, where we assume that the machines, apart from receiving service from the repairman, also serve queues of products. The extended model can be viewed as a layered queueing network, where the first layer consists of the queues of products and the second layer is the ordinary machine-repair model. As the repair time of one machine may affect the time the other machine is not able to process products, the downtimes of the machines are correlated. This correlation leads to dependence between the queues of products in the first layer. Analysis of these queue length distributions is hard, as the exact dependence structure for the downtimes, or the queue lengths, is not known. Therefore, we obtain an approximation for the complete marginal queue length distribution of any queue in the first layer, by viewing such a queue as a single server queue with correlated server downtimes. Under an explicit assumption on the form of the downtime dependence, we obtain exact results for the queue length distribution for that single server queue. We use these exact results to approximate the machine-repair model. We do so by computing the downtime correlation for the latter model and by subsequently using this information to fine-tune the parameters we introduced to the single server queue. As a result, we immediately obtain an approximation for the queue length distributions of products in the machine-repair model, which we show to be highly accurate by extensive numerical experiments.</description><subject>Approximation</subject><subject>Breakdowns</subject><subject>Business and Management</subject><subject>Computer Communication Networks</subject><subject>Computer science</subject><subject>Computer terminals</subject><subject>Control</subject><subject>Correlation</subject><subject>Customer services</subject><subject>Downtime</subject><subject>Mathematical models</subject><subject>Networks</subject><subject>Operations Research/Decision Theory</subject><subject>Probability Theory and Stochastic Processes</subject><subject>Queues</subject><subject>Queuing</subject><subject>Receiving</subject><subject>Servers</subject><subject>Studies</subject><subject>Supply Chain Management</subject><subject>Systems Theory</subject><subject>Vacations</subject><issn>0257-0130</issn><issn>1572-9443</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNp1kMtOwzAQRS0EEqXwAewssWETmPEjjyWqeElFbOjacpxJSUmTYicq_XsMZYGQWFljn3ttH8bOEa4QILsOiChVAiiSQso8EQdsgjqLk1LykE1A6CyeSjhmJyGsACAVupiwxZP1y6azLX8faSTeUrccXrndbHz_0azt0PRd4HXvueXDtk9auyNPFe8oTv6Nb5tIu957au0Q979bwik7qm0b6OxnnbLF3e3L7CGZP98_zm7miZOqGJJUKSuETR1kuSKqy9wpVLW1hK5CwKKyFVUFOFdSqaGwVJZaaAlUuVRLlFN2ue-Nr403h8Gsm-CobW1H_RgMphnqFEDlEb34g6760cePR0phLrXAWDlluKec70PwVJuNjxb8ziCYL9FmL9pE0eZLtBExI_aZENluSf5X87-hT2I5gc8</recordid><startdate>20130901</startdate><enddate>20130901</enddate><creator>Dorsman, J. L.</creator><creator>Boxma, O. J.</creator><creator>Vlasiou, M.</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88I</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L6V</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>M2O</scope><scope>M2P</scope><scope>M7S</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PADUT</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>PYYUZ</scope><scope>Q9U</scope></search><sort><creationdate>20130901</creationdate><title>Marginal queue length approximations for a two-layered network with correlated queues</title><author>Dorsman, J. L. ; Boxma, O. J. ; Vlasiou, M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c349t-644a22a6c0784eefb8c414faae1cd1019daded90ccbeb509aebb52530edc65313</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Approximation</topic><topic>Breakdowns</topic><topic>Business and Management</topic><topic>Computer Communication Networks</topic><topic>Computer science</topic><topic>Computer terminals</topic><topic>Control</topic><topic>Correlation</topic><topic>Customer services</topic><topic>Downtime</topic><topic>Mathematical models</topic><topic>Networks</topic><topic>Operations Research/Decision Theory</topic><topic>Probability Theory and Stochastic Processes</topic><topic>Queues</topic><topic>Queuing</topic><topic>Receiving</topic><topic>Servers</topic><topic>Studies</topic><topic>Supply Chain Management</topic><topic>Systems Theory</topic><topic>Vacations</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Dorsman, J. L.</creatorcontrib><creatorcontrib>Boxma, O. J.</creatorcontrib><creatorcontrib>Vlasiou, M.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Research Library</collection><collection>Science Database</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Research Library China</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ABI/INFORM Collection China</collection><collection>ProQuest Central Basic</collection><jtitle>Queueing systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Dorsman, J. L.</au><au>Boxma, O. J.</au><au>Vlasiou, M.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Marginal queue length approximations for a two-layered network with correlated queues</atitle><jtitle>Queueing systems</jtitle><stitle>Queueing Syst</stitle><date>2013-09-01</date><risdate>2013</risdate><volume>75</volume><issue>1</issue><spage>29</spage><epage>63</epage><pages>29-63</pages><issn>0257-0130</issn><eissn>1572-9443</eissn><abstract>We consider an extension of the classical machine-repair model, where we assume that the machines, apart from receiving service from the repairman, also serve queues of products. The extended model can be viewed as a layered queueing network, where the first layer consists of the queues of products and the second layer is the ordinary machine-repair model. As the repair time of one machine may affect the time the other machine is not able to process products, the downtimes of the machines are correlated. This correlation leads to dependence between the queues of products in the first layer. Analysis of these queue length distributions is hard, as the exact dependence structure for the downtimes, or the queue lengths, is not known. Therefore, we obtain an approximation for the complete marginal queue length distribution of any queue in the first layer, by viewing such a queue as a single server queue with correlated server downtimes. Under an explicit assumption on the form of the downtime dependence, we obtain exact results for the queue length distribution for that single server queue. We use these exact results to approximate the machine-repair model. We do so by computing the downtime correlation for the latter model and by subsequently using this information to fine-tune the parameters we introduced to the single server queue. As a result, we immediately obtain an approximation for the queue length distributions of products in the machine-repair model, which we show to be highly accurate by extensive numerical experiments.</abstract><cop>Boston</cop><pub>Springer US</pub><doi>10.1007/s11134-012-9338-2</doi><tpages>35</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0257-0130 |
| ispartof | Queueing systems, 2013-09, Vol.75 (1), p.29-63 |
| issn | 0257-0130 1572-9443 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1671560048 |
| source | Springer Nature - Complete Springer Journals |
| subjects | Approximation Breakdowns Business and Management Computer Communication Networks Computer science Computer terminals Control Correlation Customer services Downtime Mathematical models Networks Operations Research/Decision Theory Probability Theory and Stochastic Processes Queues Queuing Receiving Servers Studies Supply Chain Management Systems Theory Vacations |
| title | Marginal queue length approximations for a two-layered network with correlated queues |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T18%3A58%3A16IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Marginal%20queue%20length%20approximations%20for%20a%20two-layered%20network%20with%20correlated%20queues&rft.jtitle=Queueing%20systems&rft.au=Dorsman,%20J.%20L.&rft.date=2013-09-01&rft.volume=75&rft.issue=1&rft.spage=29&rft.epage=63&rft.pages=29-63&rft.issn=0257-0130&rft.eissn=1572-9443&rft_id=info:doi/10.1007/s11134-012-9338-2&rft_dat=%3Cproquest_cross%3E3038992931%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1418352165&rft_id=info:pmid/&rfr_iscdi=true |