Optimal routing in general finite multi-server queueing networks
The design of general finite multi-server queueing networks is a challenging problem that arises in many real-life situations, including computer networks, manufacturing systems, and telecommunication networks. In this paper, we examine the optimal routing problem in arbitrary configured acyclic que...
Gespeichert in:
| Veröffentlicht in: | PloS one 2014-07, Vol.9 (7), p.e102075-e102075 |
|---|---|
| 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 | e102075 |
|---|---|
| container_issue | 7 |
| container_start_page | e102075 |
| container_title | PloS one |
| container_volume | 9 |
| creator | van Woensel, Tom Cruz, Frederico R B |
| description | The design of general finite multi-server queueing networks is a challenging problem that arises in many real-life situations, including computer networks, manufacturing systems, and telecommunication networks. In this paper, we examine the optimal routing problem in arbitrary configured acyclic queueing networks. The performance of the finite queueing network is evaluated with a known approximate performance evaluation method and the optimization is done by means of a heuristics based on the Powell algorithm. The proposed methodology is then applied to determine the optimal routing probability vector that maximizes the throughput of the queueing network. We show numerical results for some networks to quantify the quality of the routing vector approximations obtained. |
| doi_str_mv | 10.1371/journal.pone.0102075 |
| format | Article |
| fullrecord | <record><control><sourceid>gale_plos_</sourceid><recordid>TN_cdi_plos_journals_1544377756</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A418636011</galeid><doaj_id>oai_doaj_org_article_9396be588fbe46efa4bbcfef7690dffd</doaj_id><sourcerecordid>A418636011</sourcerecordid><originalsourceid>FETCH-LOGICAL-c692t-79540642a13285ac3ac25e1d08499520c1272bb2f59794f2d87cb67c7ecf0ed53</originalsourceid><addsrcrecordid>eNqNkluP0zAQhSMEYpeFf4CgEhKChxZfYjt-QaxWXCqtVInbq-U449Qltbt2ssC_x6XZVYP2Afkh1uQ7ZzKTUxRPMVpgKvCbTRii191iFzwsEEYECXavOMWSkjkniN4_up8Uj1LaIMRoxfnD4oSwLOAcnRbvVrvebXU3i2HonW9nzs9a8BBzyTrvephth6538wTxGuLsaoAB9pyH_meIP9Lj4oHVXYIn4_Os-Pbh_deLT_PL1cflxfnl3HBJ-rmQrES8JBpTUjFtqDaEAW5QVUrJCDKYCFLXxDIpZGlJUwlTc2EEGIugYfSseH7w3XUhqXH4pDArSyqEYDwTywPRBL1Ru5jHir9V0E79LYTYKh17ZzpQkkpeA6sqW0PJweqyro0FK7hEjbVN9no7dhvqLTQGfJ83MjGdvvFurdpwrUokCZI0G7waDWLIO0u92rpkoOu0hzAcvltQIdEeffEPevd0I9XqPIDzNuS-Zm-qzktcccoRxpla3EHl08DWmZwU63J9Ing9EWSmh199q4eU1PLL5_9nV9-n7Msjdg2669cpdDljwacpWB5AE0NKEeztkjFS-6DfbEPtg67GoGfZs-MfdCu6STb9A3wA-AM</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1544377756</pqid></control><display><type>article</type><title>Optimal routing in general finite multi-server queueing networks</title><source>MEDLINE</source><source>DOAJ Directory of Open Access Journals</source><source>Public Library of Science (PLoS)</source><source>EZB-FREE-00999 freely available EZB journals</source><source>PubMed Central</source><source>Free Full-Text Journals in Chemistry</source><creator>van Woensel, Tom ; Cruz, Frederico R B</creator><contributor>Adesso, Gerardo</contributor><creatorcontrib>van Woensel, Tom ; Cruz, Frederico R B ; Adesso, Gerardo</creatorcontrib><description>The design of general finite multi-server queueing networks is a challenging problem that arises in many real-life situations, including computer networks, manufacturing systems, and telecommunication networks. In this paper, we examine the optimal routing problem in arbitrary configured acyclic queueing networks. The performance of the finite queueing network is evaluated with a known approximate performance evaluation method and the optimization is done by means of a heuristics based on the Powell algorithm. The proposed methodology is then applied to determine the optimal routing probability vector that maximizes the throughput of the queueing network. We show numerical results for some networks to quantify the quality of the routing vector approximations obtained.</description><identifier>ISSN: 1932-6203</identifier><identifier>EISSN: 1932-6203</identifier><identifier>DOI: 10.1371/journal.pone.0102075</identifier><identifier>PMID: 25010660</identifier><language>eng</language><publisher>United States: Public Library of Science</publisher><subject>Algorithms ; Applied mathematics ; Computer Communication Networks ; Computer industry ; Computer networks ; Computers ; Design optimization ; Engineering and Technology ; File servers ; Manufacturing ; Markov analysis ; Networks ; Numerical Analysis, Computer-Assisted ; Operations research ; Optimization ; Performance evaluation ; Physical Sciences ; Powell algorithms ; Probability ; Problem solving ; Queues ; Queuing theory ; Routing ; Traffic assignment</subject><ispartof>PloS one, 2014-07, Vol.9 (7), p.e102075-e102075</ispartof><rights>COPYRIGHT 2014 Public Library of Science</rights><rights>2014 van Woensel, Cruz. This is an open-access article distributed under the terms of the Creative Commons Attribution License: http://creativecommons.org/licenses/by/4.0/ (the “License”), which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>2014 van Woensel, Cruz 2014 van Woensel, Cruz</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c692t-79540642a13285ac3ac25e1d08499520c1272bb2f59794f2d87cb67c7ecf0ed53</citedby><cites>FETCH-LOGICAL-c692t-79540642a13285ac3ac25e1d08499520c1272bb2f59794f2d87cb67c7ecf0ed53</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.ncbi.nlm.nih.gov/pmc/articles/PMC4092093/pdf/$$EPDF$$P50$$Gpubmedcentral$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://www.ncbi.nlm.nih.gov/pmc/articles/PMC4092093/$$EHTML$$P50$$Gpubmedcentral$$Hfree_for_read</linktohtml><link.rule.ids>230,314,723,776,780,860,881,2095,2914,23846,27903,27904,53769,53771,79346,79347</link.rule.ids><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/25010660$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink></links><search><contributor>Adesso, Gerardo</contributor><creatorcontrib>van Woensel, Tom</creatorcontrib><creatorcontrib>Cruz, Frederico R B</creatorcontrib><title>Optimal routing in general finite multi-server queueing networks</title><title>PloS one</title><addtitle>PLoS One</addtitle><description>The design of general finite multi-server queueing networks is a challenging problem that arises in many real-life situations, including computer networks, manufacturing systems, and telecommunication networks. In this paper, we examine the optimal routing problem in arbitrary configured acyclic queueing networks. The performance of the finite queueing network is evaluated with a known approximate performance evaluation method and the optimization is done by means of a heuristics based on the Powell algorithm. The proposed methodology is then applied to determine the optimal routing probability vector that maximizes the throughput of the queueing network. We show numerical results for some networks to quantify the quality of the routing vector approximations obtained.</description><subject>Algorithms</subject><subject>Applied mathematics</subject><subject>Computer Communication Networks</subject><subject>Computer industry</subject><subject>Computer networks</subject><subject>Computers</subject><subject>Design optimization</subject><subject>Engineering and Technology</subject><subject>File servers</subject><subject>Manufacturing</subject><subject>Markov analysis</subject><subject>Networks</subject><subject>Numerical Analysis, Computer-Assisted</subject><subject>Operations research</subject><subject>Optimization</subject><subject>Performance evaluation</subject><subject>Physical Sciences</subject><subject>Powell algorithms</subject><subject>Probability</subject><subject>Problem solving</subject><subject>Queues</subject><subject>Queuing theory</subject><subject>Routing</subject><subject>Traffic assignment</subject><issn>1932-6203</issn><issn>1932-6203</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>EIF</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><sourceid>DOA</sourceid><recordid>eNqNkluP0zAQhSMEYpeFf4CgEhKChxZfYjt-QaxWXCqtVInbq-U449Qltbt2ssC_x6XZVYP2Afkh1uQ7ZzKTUxRPMVpgKvCbTRii191iFzwsEEYECXavOMWSkjkniN4_up8Uj1LaIMRoxfnD4oSwLOAcnRbvVrvebXU3i2HonW9nzs9a8BBzyTrvephth6538wTxGuLsaoAB9pyH_meIP9Lj4oHVXYIn4_Os-Pbh_deLT_PL1cflxfnl3HBJ-rmQrES8JBpTUjFtqDaEAW5QVUrJCDKYCFLXxDIpZGlJUwlTc2EEGIugYfSseH7w3XUhqXH4pDArSyqEYDwTywPRBL1Ru5jHir9V0E79LYTYKh17ZzpQkkpeA6sqW0PJweqyro0FK7hEjbVN9no7dhvqLTQGfJ83MjGdvvFurdpwrUokCZI0G7waDWLIO0u92rpkoOu0hzAcvltQIdEeffEPevd0I9XqPIDzNuS-Zm-qzktcccoRxpla3EHl08DWmZwU63J9Ing9EWSmh199q4eU1PLL5_9nV9-n7Msjdg2669cpdDljwacpWB5AE0NKEeztkjFS-6DfbEPtg67GoGfZs-MfdCu6STb9A3wA-AM</recordid><startdate>20140710</startdate><enddate>20140710</enddate><creator>van Woensel, Tom</creator><creator>Cruz, Frederico R B</creator><general>Public Library of Science</general><general>Public Library of Science (PLoS)</general><scope>CGR</scope><scope>CUY</scope><scope>CVF</scope><scope>ECM</scope><scope>EIF</scope><scope>NPM</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>IOV</scope><scope>ISR</scope><scope>3V.</scope><scope>7QG</scope><scope>7QL</scope><scope>7QO</scope><scope>7RV</scope><scope>7SN</scope><scope>7SS</scope><scope>7T5</scope><scope>7TG</scope><scope>7TM</scope><scope>7U9</scope><scope>7X2</scope><scope>7X7</scope><scope>7XB</scope><scope>88E</scope><scope>8AO</scope><scope>8C1</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FH</scope><scope>8FI</scope><scope>8FJ</scope><scope>8FK</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AEUYN</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>ATCPS</scope><scope>AZQEC</scope><scope>BBNVY</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>BHPHI</scope><scope>C1K</scope><scope>CCPQU</scope><scope>D1I</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FYUFA</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>H94</scope><scope>HCIFZ</scope><scope>K9.</scope><scope>KB.</scope><scope>KB0</scope><scope>KL.</scope><scope>L6V</scope><scope>LK8</scope><scope>M0K</scope><scope>M0S</scope><scope>M1P</scope><scope>M7N</scope><scope>M7P</scope><scope>M7S</scope><scope>NAPCQ</scope><scope>P5Z</scope><scope>P62</scope><scope>P64</scope><scope>PATMY</scope><scope>PDBOC</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>PYCSY</scope><scope>RC3</scope><scope>7X8</scope><scope>5PM</scope><scope>DOA</scope></search><sort><creationdate>20140710</creationdate><title>Optimal routing in general finite multi-server queueing networks</title><author>van Woensel, Tom ; Cruz, Frederico R B</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c692t-79540642a13285ac3ac25e1d08499520c1272bb2f59794f2d87cb67c7ecf0ed53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Algorithms</topic><topic>Applied mathematics</topic><topic>Computer Communication Networks</topic><topic>Computer industry</topic><topic>Computer networks</topic><topic>Computers</topic><topic>Design optimization</topic><topic>Engineering and Technology</topic><topic>File servers</topic><topic>Manufacturing</topic><topic>Markov analysis</topic><topic>Networks</topic><topic>Numerical Analysis, Computer-Assisted</topic><topic>Operations research</topic><topic>Optimization</topic><topic>Performance evaluation</topic><topic>Physical Sciences</topic><topic>Powell algorithms</topic><topic>Probability</topic><topic>Problem solving</topic><topic>Queues</topic><topic>Queuing theory</topic><topic>Routing</topic><topic>Traffic assignment</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>van Woensel, Tom</creatorcontrib><creatorcontrib>Cruz, Frederico R B</creatorcontrib><collection>Medline</collection><collection>MEDLINE</collection><collection>MEDLINE (Ovid)</collection><collection>MEDLINE</collection><collection>MEDLINE</collection><collection>PubMed</collection><collection>CrossRef</collection><collection>Gale In Context: Opposing Viewpoints</collection><collection>Gale In Context: Science</collection><collection>ProQuest Central (Corporate)</collection><collection>Animal Behavior Abstracts</collection><collection>Bacteriology Abstracts (Microbiology B)</collection><collection>Biotechnology Research Abstracts</collection><collection>Nursing & Allied Health Database</collection><collection>Ecology Abstracts</collection><collection>Entomology Abstracts (Full archive)</collection><collection>Immunology Abstracts</collection><collection>Meteorological & Geoastrophysical Abstracts</collection><collection>Nucleic Acids Abstracts</collection><collection>Virology and AIDS Abstracts</collection><collection>Agricultural Science Collection</collection><collection>Health & Medical Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Medical Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Public Health Database</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Natural Science Collection</collection><collection>Hospital Premium Collection</collection><collection>Hospital Premium Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest One Sustainability</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>Agricultural & Environmental Science Collection</collection><collection>ProQuest Central Essentials</collection><collection>Biological Science Collection</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>Natural Science Collection</collection><collection>Environmental Sciences and Pollution Management</collection><collection>ProQuest One Community College</collection><collection>ProQuest Materials Science Collection</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>Health Research Premium Collection</collection><collection>Health Research Premium Collection (Alumni)</collection><collection>ProQuest Central Student</collection><collection>AIDS and Cancer Research Abstracts</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Health & Medical Complete (Alumni)</collection><collection>Materials Science Database</collection><collection>Nursing & Allied Health Database (Alumni Edition)</collection><collection>Meteorological & Geoastrophysical Abstracts - Academic</collection><collection>ProQuest Engineering Collection</collection><collection>ProQuest Biological Science Collection</collection><collection>Agricultural Science Database</collection><collection>Health & Medical Collection (Alumni Edition)</collection><collection>Medical Database</collection><collection>Algology Mycology and Protozoology Abstracts (Microbiology C)</collection><collection>Biological Science Database</collection><collection>Engineering Database</collection><collection>Nursing & Allied Health Premium</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Biotechnology and BioEngineering Abstracts</collection><collection>Environmental Science Database</collection><collection>Materials Science Collection</collection><collection>Publicly Available Content Database</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>Environmental Science Collection</collection><collection>Genetics Abstracts</collection><collection>MEDLINE - Academic</collection><collection>PubMed Central (Full Participant titles)</collection><collection>DOAJ Directory of Open Access Journals</collection><jtitle>PloS one</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>van Woensel, Tom</au><au>Cruz, Frederico R B</au><au>Adesso, Gerardo</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimal routing in general finite multi-server queueing networks</atitle><jtitle>PloS one</jtitle><addtitle>PLoS One</addtitle><date>2014-07-10</date><risdate>2014</risdate><volume>9</volume><issue>7</issue><spage>e102075</spage><epage>e102075</epage><pages>e102075-e102075</pages><issn>1932-6203</issn><eissn>1932-6203</eissn><abstract>The design of general finite multi-server queueing networks is a challenging problem that arises in many real-life situations, including computer networks, manufacturing systems, and telecommunication networks. In this paper, we examine the optimal routing problem in arbitrary configured acyclic queueing networks. The performance of the finite queueing network is evaluated with a known approximate performance evaluation method and the optimization is done by means of a heuristics based on the Powell algorithm. The proposed methodology is then applied to determine the optimal routing probability vector that maximizes the throughput of the queueing network. We show numerical results for some networks to quantify the quality of the routing vector approximations obtained.</abstract><cop>United States</cop><pub>Public Library of Science</pub><pmid>25010660</pmid><doi>10.1371/journal.pone.0102075</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1932-6203 |
| ispartof | PloS one, 2014-07, Vol.9 (7), p.e102075-e102075 |
| issn | 1932-6203 1932-6203 |
| language | eng |
| recordid | cdi_plos_journals_1544377756 |
| source | MEDLINE; DOAJ Directory of Open Access Journals; Public Library of Science (PLoS); EZB-FREE-00999 freely available EZB journals; PubMed Central; Free Full-Text Journals in Chemistry |
| subjects | Algorithms Applied mathematics Computer Communication Networks Computer industry Computer networks Computers Design optimization Engineering and Technology File servers Manufacturing Markov analysis Networks Numerical Analysis, Computer-Assisted Operations research Optimization Performance evaluation Physical Sciences Powell algorithms Probability Problem solving Queues Queuing theory Routing Traffic assignment |
| title | Optimal routing in general finite multi-server queueing networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-23T20%3A57%3A20IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_plos_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Optimal%20routing%20in%20general%20finite%20multi-server%20queueing%20networks&rft.jtitle=PloS%20one&rft.au=van%20Woensel,%20Tom&rft.date=2014-07-10&rft.volume=9&rft.issue=7&rft.spage=e102075&rft.epage=e102075&rft.pages=e102075-e102075&rft.issn=1932-6203&rft.eissn=1932-6203&rft_id=info:doi/10.1371/journal.pone.0102075&rft_dat=%3Cgale_plos_%3EA418636011%3C/gale_plos_%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1544377756&rft_id=info:pmid/25010660&rft_galeid=A418636011&rft_doaj_id=oai_doaj_org_article_9396be588fbe46efa4bbcfef7690dffd&rfr_iscdi=true |