Optimal buffer allocation in finite closed networks with multiple servers
In this study, we present an optimal buffer allocation procedure for closed queueing networks with finite buffers. The performance measures are evaluated using the expanded mean value analysis, and the solution procedure is incorporated into a nonlinear optimization scheme to arrive at the sub-optim...
Gespeichert in:
| Veröffentlicht in: | Computers & operations research 2008-08, Vol.35 (8), p.2579-2598 |
|---|---|
| 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 | 2598 |
|---|---|
| container_issue | 8 |
| container_start_page | 2579 |
| container_title | Computers & operations research |
| container_volume | 35 |
| creator | Yuzukirmizi, Mustafa Smith, J. MacGregor |
| description | In this study, we present an optimal buffer allocation procedure for closed queueing networks with finite buffers. The performance measures are evaluated using the expanded mean value analysis, and the solution procedure is incorporated into a nonlinear optimization scheme to arrive at the sub-optimal buffer space vector. The effectiveness of the method is demonstrated through several numerical experiments. Discussions on convergence and computational complexity are also included. |
| doi_str_mv | 10.1016/j.cor.2006.12.008 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_31870965</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0305054806003091</els_id><sourcerecordid>31870965</sourcerecordid><originalsourceid>FETCH-LOGICAL-c359t-84991745a57d498e08178a7b796236f7fa30b48318a534a2452a6256f72f51ff3</originalsourceid><addsrcrecordid>eNp9kE1LAzEQhoMoWKs_wFtO3nZNsptNFk9S_CgUelHwFtJ0gqnppibZFv-9KfXsXOYw7zPwPgjdUlJTQrv7TW1CrBkhXU1ZTYg8QxMqRVOJjn-cowlpCK8Ib-UlukppQ8oIRidovtxlt9Uer0ZrIWLtfTA6uzBgN2DrBpcBGx8SrPEA-RDiV8IHlz_xdvTZ7TzgBHEPMV2jC6t9gpu_PUXvz09vs9dqsXyZzx4XlWl4nyvZ9j0VLddcrNteApFUSC1Wou9Y01lhdUNWrWyo1LxpNWs50x3j5cIsp9Y2U3R3-ruL4XuElNXWJQPe6wHCmFQhBek7XoL0FDQxpBTBql0sVeOPokQdpamNKtLUUZqiTBVphXk4MVAa7B1ElYyDwcDaRTBZrYP7h_4FBxF0Yw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>31870965</pqid></control><display><type>article</type><title>Optimal buffer allocation in finite closed networks with multiple servers</title><source>Elsevier ScienceDirect Journals</source><creator>Yuzukirmizi, Mustafa ; Smith, J. MacGregor</creator><creatorcontrib>Yuzukirmizi, Mustafa ; Smith, J. MacGregor</creatorcontrib><description>In this study, we present an optimal buffer allocation procedure for closed queueing networks with finite buffers. The performance measures are evaluated using the expanded mean value analysis, and the solution procedure is incorporated into a nonlinear optimization scheme to arrive at the sub-optimal buffer space vector. The effectiveness of the method is demonstrated through several numerical experiments. Discussions on convergence and computational complexity are also included.</description><identifier>ISSN: 0305-0548</identifier><identifier>EISSN: 1873-765X</identifier><identifier>DOI: 10.1016/j.cor.2006.12.008</identifier><language>eng</language><publisher>Elsevier Ltd</publisher><subject>Combinatorial optimization ; Finite closed queueing networks</subject><ispartof>Computers & operations research, 2008-08, Vol.35 (8), p.2579-2598</ispartof><rights>2007 Elsevier Ltd</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c359t-84991745a57d498e08178a7b796236f7fa30b48318a534a2452a6256f72f51ff3</citedby><cites>FETCH-LOGICAL-c359t-84991745a57d498e08178a7b796236f7fa30b48318a534a2452a6256f72f51ff3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0305054806003091$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,27903,27904,65309</link.rule.ids></links><search><creatorcontrib>Yuzukirmizi, Mustafa</creatorcontrib><creatorcontrib>Smith, J. MacGregor</creatorcontrib><title>Optimal buffer allocation in finite closed networks with multiple servers</title><title>Computers & operations research</title><description>In this study, we present an optimal buffer allocation procedure for closed queueing networks with finite buffers. The performance measures are evaluated using the expanded mean value analysis, and the solution procedure is incorporated into a nonlinear optimization scheme to arrive at the sub-optimal buffer space vector. The effectiveness of the method is demonstrated through several numerical experiments. Discussions on convergence and computational complexity are also included.</description><subject>Combinatorial optimization</subject><subject>Finite closed queueing networks</subject><issn>0305-0548</issn><issn>1873-765X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2008</creationdate><recordtype>article</recordtype><recordid>eNp9kE1LAzEQhoMoWKs_wFtO3nZNsptNFk9S_CgUelHwFtJ0gqnppibZFv-9KfXsXOYw7zPwPgjdUlJTQrv7TW1CrBkhXU1ZTYg8QxMqRVOJjn-cowlpCK8Ib-UlukppQ8oIRidovtxlt9Uer0ZrIWLtfTA6uzBgN2DrBpcBGx8SrPEA-RDiV8IHlz_xdvTZ7TzgBHEPMV2jC6t9gpu_PUXvz09vs9dqsXyZzx4XlWl4nyvZ9j0VLddcrNteApFUSC1Wou9Y01lhdUNWrWyo1LxpNWs50x3j5cIsp9Y2U3R3-ruL4XuElNXWJQPe6wHCmFQhBek7XoL0FDQxpBTBql0sVeOPokQdpamNKtLUUZqiTBVphXk4MVAa7B1ElYyDwcDaRTBZrYP7h_4FBxF0Yw</recordid><startdate>20080801</startdate><enddate>20080801</enddate><creator>Yuzukirmizi, Mustafa</creator><creator>Smith, J. MacGregor</creator><general>Elsevier Ltd</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20080801</creationdate><title>Optimal buffer allocation in finite closed networks with multiple servers</title><author>Yuzukirmizi, Mustafa ; Smith, J. MacGregor</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c359t-84991745a57d498e08178a7b796236f7fa30b48318a534a2452a6256f72f51ff3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Combinatorial optimization</topic><topic>Finite closed queueing networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yuzukirmizi, Mustafa</creatorcontrib><creatorcontrib>Smith, J. MacGregor</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science 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><jtitle>Computers & operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yuzukirmizi, Mustafa</au><au>Smith, J. MacGregor</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimal buffer allocation in finite closed networks with multiple servers</atitle><jtitle>Computers & operations research</jtitle><date>2008-08-01</date><risdate>2008</risdate><volume>35</volume><issue>8</issue><spage>2579</spage><epage>2598</epage><pages>2579-2598</pages><issn>0305-0548</issn><eissn>1873-765X</eissn><abstract>In this study, we present an optimal buffer allocation procedure for closed queueing networks with finite buffers. The performance measures are evaluated using the expanded mean value analysis, and the solution procedure is incorporated into a nonlinear optimization scheme to arrive at the sub-optimal buffer space vector. The effectiveness of the method is demonstrated through several numerical experiments. Discussions on convergence and computational complexity are also included.</abstract><pub>Elsevier Ltd</pub><doi>10.1016/j.cor.2006.12.008</doi><tpages>20</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0305-0548 |
| ispartof | Computers & operations research, 2008-08, Vol.35 (8), p.2579-2598 |
| issn | 0305-0548 1873-765X |
| language | eng |
| recordid | cdi_proquest_miscellaneous_31870965 |
| source | Elsevier ScienceDirect Journals |
| subjects | Combinatorial optimization Finite closed queueing networks |
| title | Optimal buffer allocation in finite closed networks with multiple servers |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T23%3A46%3A51IST&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=Optimal%20buffer%20allocation%20in%20finite%20closed%20networks%20with%20multiple%20servers&rft.jtitle=Computers%20&%20operations%20research&rft.au=Yuzukirmizi,%20Mustafa&rft.date=2008-08-01&rft.volume=35&rft.issue=8&rft.spage=2579&rft.epage=2598&rft.pages=2579-2598&rft.issn=0305-0548&rft.eissn=1873-765X&rft_id=info:doi/10.1016/j.cor.2006.12.008&rft_dat=%3Cproquest_cross%3E31870965%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=31870965&rft_id=info:pmid/&rft_els_id=S0305054806003091&rfr_iscdi=true |