On the guaranteed throughput and efficiency of closed re-entrant lines

Cited 6 time in webofscience Cited 9 time in scopus
  • Hit : 372
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorMorrison, James Rko
dc.contributor.authorKumar, PRko
dc.date.accessioned2013-02-27T11:43:32Z-
dc.date.available2013-02-27T11:43:32Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued1998-
dc.identifier.citationQUEUEING SYSTEMS, v.28, no.1-3, pp.33 - 54-
dc.identifier.issn0257-0130-
dc.identifier.urihttp://hdl.handle.net/10203/68347-
dc.description.abstractA closed network is said to be "guaranteed efficient" if the throughput converges under all non-idling policies to the capacity of the bottlenecks in the network, as the number of trapped customers increases to infinity. We obtain a necessary condition for guaranteed efficiency of closed re-entrant lines. For balanced two-station systems, this necessary condition is almost sufficient, differing from it only by the strictness of an inequality. This near characterization is obtained by studying a special type of virtual station called "alternating visit virtual station". These special virtual stations allow us to relate the necessary condition to certain indices arising in heavy traffic studies using a Brownian network approximation, as well as to certain policies proposed as being extremal with respect to the asymptotic loss in the throughput. Using the near characterization of guaranteed efficiency we also answer the often pondered question of whether an open network or its closed counterpart has greater throughput - the answer is that neither can assure a greater guaranteed throughput.-
dc.languageEnglish-
dc.publisherBALTZER SCI PUBL BV-
dc.subjectNETWORKS-
dc.titleOn the guaranteed throughput and efficiency of closed re-entrant lines-
dc.typeArticle-
dc.identifier.wosid000075334700003-
dc.identifier.scopusid2-s2.0-0032372063-
dc.type.rimsART-
dc.citation.volume28-
dc.citation.issue1-3-
dc.citation.beginningpage33-
dc.citation.endingpage54-
dc.citation.publicationnameQUEUEING SYSTEMS-
dc.identifier.doi10.1023/A:1019199022922-
dc.contributor.localauthorMorrison, James R-
dc.contributor.nonIdAuthorKumar, PR-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorqueueing networks-
dc.subject.keywordAuthorthroughput-
dc.subject.keywordAuthorclosed networks-
dc.subject.keywordAuthorefficiency-
dc.subject.keywordAuthorstability-
dc.subject.keywordPlusNETWORKS-
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 6 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0