DC Field | Value | Language |
---|---|---|
dc.contributor.author | Tcha, Dong Wan | ko |
dc.contributor.author | PAIK, CH | ko |
dc.contributor.author | LEE, WT | ko |
dc.date.accessioned | 2008-06-03T04:46:51Z | - |
dc.date.available | 2008-06-03T04:46:51Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1995-04 | - |
dc.identifier.citation | COMPUTERS INDUSTRIAL ENGINEERING, v.28, no.2, pp.351 - 365 | - |
dc.identifier.issn | 0360-8352 | - |
dc.identifier.uri | http://hdl.handle.net/10203/4830 | - |
dc.description.abstract | We present a simple but effective decomposition method which yields tight throughput upper bounds for open Markovian finite-buffered queueing networks under any commonly used blocking mechanism. This method is first elaborated on with three specialized network configurations, tandem, split and merge, and then extended to a general configuration. Also shown is that the existing throughput-bounding methods for open queueing networks with blocking can be improved via duality consideration. Computational experiments confirm that our method is superior to all other existing methods. | - |
dc.language | English | - |
dc.language.iso | en_US | en |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | - |
dc.subject | QUEUING-NETWORKS | - |
dc.subject | FINITE BUFFERS | - |
dc.subject | EQUIVALENCIES | - |
dc.title | THROUGHPUT UPPER-BOUNDS FOR OPEN MARKOVIAN QUEUING-NETWORKS WITH BLOCKING | - |
dc.type | Article | - |
dc.identifier.wosid | A1995QP64300014 | - |
dc.identifier.scopusid | 2-s2.0-58149320526 | - |
dc.type.rims | ART | - |
dc.citation.volume | 28 | - |
dc.citation.issue | 2 | - |
dc.citation.beginningpage | 351 | - |
dc.citation.endingpage | 365 | - |
dc.citation.publicationname | COMPUTERS INDUSTRIAL ENGINEERING | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Tcha, Dong Wan | - |
dc.contributor.nonIdAuthor | PAIK, CH | - |
dc.contributor.nonIdAuthor | LEE, WT | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordPlus | QUEUING-NETWORKS | - |
dc.subject.keywordPlus | FINITE BUFFERS | - |
dc.subject.keywordPlus | EQUIVALENCIES | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.