{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T15:37:40Z","timestamp":1759073860088},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1988,11,1]],"date-time":"1988-11-01T00:00:00Z","timestamp":594345600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Performance Evaluation"],"published-print":{"date-parts":[[1988,11]]},"DOI":"10.1016\/0166-5316(88)90025-9","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T02:10:42Z","timestamp":1060308642000},"page":"69-78","source":"Crossref","is-referenced-by-count":17,"title":["Throughput bounds for closed queueing networks with queue-dependent service rates"],"prefix":"10.1016","volume":"9","author":[{"given":"J.George","family":"Shanthikumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David D.","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-5316(88)90025-9_BIB1","series-title":"Proc. Joint Performance 86 and ACM SIGMETRICS 1986 Conf.","article-title":"Approximate disaggregation and performance bounds for queueing networks with multiple-server stations","author":"Dallery","year":"1986"},{"key":"10.1016\/0166-5316(88)90025-9_BIB2","article-title":"Improved Throughput Bounds for Queueing Networks with Multi-Server Stations","author":"Dallery","year":"1986"},{"key":"10.1016\/0166-5316(88)90025-9_BIB3","series-title":"Performance '83\u2014Proc. 9th Internat. Symp. on computer Performance Modelling, Measurement, and Evaluation","first-page":"285","article-title":"Performance bounds based upon throughput curve properties","author":"Dowdy","year":"1983"},{"issue":"2","key":"10.1016\/0166-5316(88)90025-9_BIB4","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1145\/357360.357363","article-title":"Performance bound hierarchies for queueing networks","volume":"1","author":"Eager","year":"1983","journal-title":"ACM Trans. Comput. Syst."},{"key":"10.1016\/0166-5316(88)90025-9_BIB5","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1145\/4904.4992","article-title":"Bound hierarchies for multiple-class queueing networks","volume":"33","author":"Eager","year":"1986","journal-title":"J. ACM"},{"key":"10.1016\/0166-5316(88)90025-9_BIB6","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1214\/aoms\/1177706960","article-title":"Polya-type distribution II","volume":"28","author":"Karlin","year":"1957","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/0166-5316(88)90025-9_BIB7","series-title":"Reversibility and Stochastic Networks","author":"Kelly","year":"1979"},{"key":"10.1016\/0166-5316(88)90025-9_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-5316(86)90002-7","article-title":"The composite bound method (CBM) for computing throughput bounds in multiple class environments","volume":"6","author":"Kerola","year":"1986","journal-title":"Performance Evaluation"},{"key":"10.1016\/0166-5316(88)90025-9_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-5316(84)90021-X","article-title":"Throughput bounds for closed queueing networks","volume":"4","author":"Kriz","year":"1984","journal-title":"Performance Evaluation"},{"issue":"2","key":"10.1016\/0166-5316(88)90025-9_BIB10","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1145\/62.322432","article-title":"Asymptotic expansions and integral representations of moments of queue lengths in closed Markovian networks","volume":"31","author":"McKenna","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/0166-5316(88)90025-9_BIB11","series-title":"Performance '84\u2014Proc. 10th Internat. Symp. on Computer Performance Modelling, Measurement, and Evaluation","first-page":"377","article-title":"Some results on asymptotic expansions for closed Markovian networks with state-dependent service rates","author":"Mitra","year":"1984"},{"key":"10.1016\/0166-5316(88)90025-9_BIB12","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1145\/322186.322195","article-title":"Mean value analysis of closed multichain queueing networks","volume":"27","author":"Reiser","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0166-5316(88)90025-9_BIB13","series-title":"Stochastic Processes","author":"Ross","year":"1983"},{"key":"10.1016\/0166-5316(88)90025-9_BIB14","doi-asserted-by":"crossref","first-page":"123","DOI":"10.2307\/3214065","article-title":"On stochastic comparison of random vectors","volume":"24","author":"Shanthikumar","year":"1987","journal-title":"J. Appl. Probab."},{"key":"10.1016\/0166-5316(88)90025-9_BIB15","doi-asserted-by":"crossref","first-page":"474","DOI":"10.2307\/3214188","article-title":"The effect of increasing service rates in a closed queueing network","volume":"23","author":"Shanthikumar","year":"1986","journal-title":"J. Appl. Probab."},{"issue":"2","key":"10.1016\/0166-5316(88)90025-9_BIB16","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0304-4149(86)90039-6","article-title":"The preservation of likelihood ratio ordering under convolution","volume":"23","author":"Shanthikumar","year":"1986","journal-title":"Stoch. Process. Appl."},{"key":"10.1016\/0166-5316(88)90025-9_BIB17","series-title":"Tech. Rept., Dept. of Industrial and Operations Engineering","article-title":"Bounds on Performance Measures for Closed Queueing Networks: Networks with Multiserver Nodes","author":"Srinivasan","year":"1985"},{"key":"10.1016\/0166-5316(88)90025-9_BIB18","series-title":"ACM SIGMETRICS Performance Evaluation Review\u2014Proc. ACM\/SIGMETRICS Conf. on Measurement and Modeling of Computer Systems","first-page":"120","article-title":"Convolutional bound hierarchies","author":"Stephens","year":"1984"},{"issue":"2","key":"10.1016\/0166-5316(88)90025-9_BIB19","first-page":"116","article-title":"Generalized quick bounds for performance of queueing networks","volume":"5","author":"Suri","year":"1984","journal-title":"Comput. Performance"},{"key":"10.1016\/0166-5316(88)90025-9_BIB20","doi-asserted-by":"crossref","first-page":"1911","DOI":"10.1002\/j.1538-7305.1984.tb00084.x","article-title":"Open and closed models for networks of queues","volume":"63","author":"Whitt","year":"1984","journal-title":"Bell Lab. Tech. J."},{"issue":"2","key":"10.1016\/0166-5316(88)90025-9_BIB21","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1145\/358396.358447","article-title":"Balanced job bound analysis of queueing networks","volume":"25","author":"Zahorjan","year":"1982","journal-title":"Comm. ACM"}],"container-title":["Performance Evaluation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166531688900259?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166531688900259?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T20:57:25Z","timestamp":1552597045000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166531688900259"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,11]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,11]]}},"alternative-id":["0166531688900259"],"URL":"https:\/\/doi.org\/10.1016\/0166-5316(88)90025-9","relation":{},"ISSN":["0166-5316"],"issn-type":[{"value":"0166-5316","type":"print"}],"subject":[],"published":{"date-parts":[[1988,11]]}}}