{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T09:52:35Z","timestamp":1672393955232},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,4,1]],"date-time":"1989-04-01T00:00:00Z","timestamp":607392000000},"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":[[1989,4]]},"DOI":"10.1016\/0166-5316(89)90037-0","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T02:10:42Z","timestamp":1060308642000},"page":"119-133","source":"Crossref","is-referenced-by-count":3,"title":["PAM\u2014A noniterative approximate solution method for closed multichain queueing networks"],"prefix":"10.1016","volume":"9","author":[{"family":"Ching-Tarng Hsieh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon S","family":"Lam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-5316(89)90037-0_BIB1","series-title":"Performance of Computer Systems","article-title":"Some extensions to multiclass queueing network analysis","author":"Bard","year":"1979"},{"issue":"2","key":"10.1016\/0166-5316(89)90037-0_BIB2","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1145\/358396.358403","article-title":"Linearizer: A heuristic algorithm for queueing network models of computer systems","volume":"25","author":"Chandy","year":"1982","journal-title":"Comm. ACM"},{"issue":"1","key":"10.1016\/0166-5316(89)90037-0_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-5316(83)90029-9","article-title":"Approximations for large scale closed queueing networks","volume":"3","author":"Chow","year":"1983","journal-title":"Performance Evaluation"},{"issue":"1","key":"10.1016\/0166-5316(89)90037-0_BIB4","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"},{"issue":"2","key":"10.1016\/0166-5316(89)90037-0_BIB5","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1145\/214419.214423","article-title":"A tree-structured mean value analysis algorithm","volume":"4","author":"Hoyme","year":"1986","journal-title":"ACM Trans. Computer Systems"},{"key":"10.1016\/0166-5316(89)90037-0_BIB6","article-title":"Models and Algorithms for the Design of Store-and-Forward Communication Networks","author":"Hsieh","year":"1987"},{"issue":"1","key":"10.1016\/0166-5316(89)90037-0_BIB7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0166-5316(87)90054-X","article-title":"Two classes of performance bounds for closed queueing networks","volume":"7","author":"Hsieh","year":"1987","journal-title":"Performance Evaluation"},{"key":"10.1016\/0166-5316(89)90037-0_BIB8","doi-asserted-by":"crossref","DOI":"10.1145\/55483.55499","article-title":"Modeling, Analysis, and Optimal Routing of Flow-Controlled Communication Networks","author":"Lam","year":"1987"},{"key":"10.1016\/0166-5316(89)90037-0_BIB9","series-title":"Proc. 7th Data Communications Symp.","first-page":"98","article-title":"Modeling and analysis of flow-controlled packet switching networks","author":"Lam","year":"1981"},{"issue":"3","key":"10.1016\/0166-5316(89)90037-0_BIB10","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1145\/358061.358075","article-title":"A tree convolution algorithm for the solution of queueing networks","volume":"26","author":"Lam","year":"1983","journal-title":"Comm. ACM"},{"key":"10.1016\/0166-5316(89)90037-0_BIB11","doi-asserted-by":"crossref","first-page":"1199","DOI":"10.1109\/TCOM.1979.1094531","article-title":"A queueing network analysis of computer communication networks with window flow control","volume":"COM-27","author":"Reiser","year":"1979","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/0166-5316(89)90037-0_BIB12","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1147\/rd.193.0283","article-title":"Queueing networks with multiple closed chains: Theory and computational algorithms","volume":"21","author":"Reiser","year":"1975","journal-title":"IBM J. Res. Develop."},{"issue":"2","key":"10.1016\/0166-5316(89)90037-0_BIB13","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(89)90037-0_BIB14","series-title":"Proc. Internat. Conf. on Stochastic Control and Optimization","article-title":"Approximate analysis of multiclass closed networks of queues","author":"Schweitzer","year":"1979"},{"issue":"5","key":"10.1016\/0166-5316(89)90037-0_BIB15","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1109\/TC.1986.1676784","article-title":"A clustering approximation technique for queueing network models with a large number of chains","volume":"C-35","author":"de Souza e Silva","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-5316(89)90037-0_BIB16","article-title":"A Note on the Computational Cost of the Linearizer Algorithm for Queueing Networks","author":"de Souza e Silva","year":"1987"},{"key":"10.1016\/0166-5316(89)90037-0_BIB17","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1109\/TCT.1969.1083004","article-title":"The design of minimum cost survivable networks","volume":"CT-16","author":"Steiglitz","year":"1969","journal-title":"IEEE Trans. Circuit Theory"},{"issue":"3","key":"10.1016\/0166-5316(89)90037-0_BIB18","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0166-5316(85)90012-4","article-title":"The tree MVA algorithm","volume":"5","author":"Tucci","year":"1985","journal-title":"Performance Evaluation"},{"issue":"4","key":"10.1016\/0166-5316(89)90037-0_BIB19","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0166-5316(88)90028-4","article-title":"Accuracy, speed, and convergence of approximate mean value analysis","volume":"8","author":"Zahorjan","year":"1988","journal-title":"Performance Evaluation"},{"issue":"2","key":"10.1016\/0166-5316(89)90037-0_BIB20","doi-asserted-by":"crossref","first-page":"132","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:0166531689900370?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166531689900370?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:36Z","timestamp":1552597056000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166531689900370"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,4]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,4]]}},"alternative-id":["0166531689900370"],"URL":"https:\/\/doi.org\/10.1016\/0166-5316(89)90037-0","relation":{},"ISSN":["0166-5316"],"issn-type":[{"value":"0166-5316","type":"print"}],"subject":[],"published":{"date-parts":[[1989,4]]}}}