{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T19:07:58Z","timestamp":1693854478334},"reference-count":48,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1982,10,1]],"date-time":"1982-10-01T00:00:00Z","timestamp":402278400000},"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":[[1982,10]]},"DOI":"10.1016\/0166-5316(82)90009-8","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T06:10:42Z","timestamp":1060323042000},"page":"161-180","source":"Crossref","is-referenced-by-count":33,"title":["Queueing network models of packet switching networks part 2: Networks with population size constraints"],"prefix":"10.1016","volume":"2","author":[{"given":"S.S.","family":"Lam","sequence":"first","affiliation":[]},{"given":"J.W.","family":"Wong","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-5316(82)90009-8_BIB1","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1287\/mnsc.10.1.131","article-title":"Jobshop-like queueing systems","volume":"10","author":"Jackson","year":"1963","journal-title":"Management Sci."},{"key":"10.1016\/0166-5316(82)90009-8_BIB2","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321879.321887","article-title":"Open, closed and mixed networks of queues with different classes of customers","volume":"22","author":"Baskett","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0166-5316(82)90009-8_BIB3","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":"19","author":"Reiser","year":"1975","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0166-5316(82)90009-8_BIB4","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1147\/rd.214.0370","article-title":"Queueing networks with population size constraints","volume":"21","author":"Lam","year":"1977","journal-title":"IBM J. Res. Develop."},{"issue":"1","key":"10.1016\/0166-5316(82)90009-8_BIB5","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/0166-5316(82)90017-7","article-title":"Queueing network models of packet switching networks, Part 1: Open networks","volume":"2","author":"Wong","year":"1982","journal-title":"Performance Evaluation"},{"key":"10.1016\/0166-5316(82)90009-8_BIB6","series-title":"Communication Nets \u2014 Stochastic Message Flow and Delays","author":"Kleinrock","year":"1964"},{"key":"10.1016\/0166-5316(82)90009-8_BIB7","author":"Kleinrock","year":"1976"},{"key":"10.1016\/0166-5316(82)90009-8_BIB8","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1109\/TCOM.1976.1093320","article-title":"Store-and forward buffer requirements in a packet switching network","volume":"COM-24","author":"Lam","year":"1976","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/0166-5316(82)90009-8_BIB9","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1147\/rd.191.0036","article-title":"Parametric analysis of queueing networks","volume":"19","author":"Chandy","year":"1975","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0166-5316(82)90009-8_BIB10","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. Assoc. Comput. Mach."},{"key":"10.1016\/0166-5316(82)90009-8_BIB11","article-title":"A tree convolution algorithm for the solution of queueing networks","author":"Lam","year":"1981"},{"key":"10.1016\/0166-5316(82)90009-8_BIB12","series-title":"Proc. 3rd Data Communications Symposium","article-title":"Presentation and major design aspects of the CYCLADES computer network","author":"Pouzin","year":"1973"},{"key":"10.1016\/0166-5316(82)90009-8_BIB13","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1109\/TCOM.1974.1092259","article-title":"A protocol for packet network intercommunication","volume":"COM-22","author":"Cerf","year":"1974","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/0166-5316(82)90009-8_BIB14","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1147\/sj.182.0298","article-title":"Routing and flow control in Systems Network Architecture","volume":"18","author":"Ahuja","year":"1979","journal-title":"IBM SystemsJ."},{"key":"10.1016\/0166-5316(82)90009-8_BIB15","series-title":"Proc. Nat. Telecommunications Conference","article-title":"The influence of control procedures on the performance of packet-switched networks","author":"Opderbeck","year":"1974"},{"key":"10.1016\/0166-5316(82)90009-8_BIB16","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. Comm."},{"key":"10.1016\/0166-5316(82)90009-8_BIB17","series-title":"Proc. 7th Data Communications Symposium","article-title":"Modeling and analysis of flow controlled packet switching networks","author":"Lam","year":"1981"},{"issue":"1","key":"10.1016\/0166-5316(82)90009-8_BIB18","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/1010631.801688","article-title":"Optimal routing in networks with flow controlled virtual channels","volume":"11","author":"Lam","year":"1982","journal-title":"Performance Evaluation Rev."},{"key":"10.1016\/0166-5316(82)90009-8_BIB19_1","article-title":"Dynamic scaling and growth behavior of queueing network normalization constants","author":"Lam","year":"1980"},{"key":"10.1016\/0166-5316(82)90009-8_BIB19_2","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1145\/322307.322321","volume":"29","author":"Lam","year":"1982","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0166-5316(82)90009-8_BIB20","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1145\/362342.362345","article-title":"Computational algorithms for closed queueing networks with exponential servers","volume":"16","author":"Buzen","year":"1973","journal-title":"Comm. ACM"},{"key":"10.1016\/0166-5316(82)90009-8_BIB21","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1287\/opre.9.3.383","article-title":"A proof of the queueing formula: L = \u03b3W","volume":"9","author":"Little","year":"1961","journal-title":"Oper. Res."},{"key":"10.1016\/0166-5316(82)90009-8_BIB22","doi-asserted-by":"crossref","first-page":"1434","DOI":"10.1109\/TCOM.1975.1092752","article-title":"Congestion control in store and forward tandem links","volume":"COM-23","author":"Pennotti","year":"1975","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/0166-5316(82)90009-8_BIB23","article-title":"A simple derivation of the MVA and LBANC algorithms from the convolution algorithm","author":"Lam","year":"1981"},{"key":"10.1016\/0166-5316(82)90009-8_BIB24","article-title":"Modeling and analysis of flow-controlled computer communication networks","author":"Lien","year":"1981"},{"key":"10.1016\/0166-5316(82)90009-8_BIB25","article-title":"An analysis of the tree convolution algorithm for queueing networks","author":"Lam","year":"1981"},{"key":"10.1016\/0166-5316(82)90009-8_BIB26","series-title":"Proc. 5th ICCC","article-title":"Routing and flow control interplay in computer networks","author":"Gerla","year":"1980"},{"key":"10.1016\/0166-5316(82)90009-8_BIB27","doi-asserted-by":"crossref","first-page":"1802","DOI":"10.1109\/TCOM.1978.1094040","article-title":"A review of the development and performance of the ARPANET routing algorithm","volume":"COM-26","author":"McQuillan","year":"1978","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/0166-5316(82)90009-8_BIB28","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/359970.359987","article-title":"On quadrative adaptive routing algorithms","volume":"19","author":"Agnew","year":"1976","journal-title":"Comm. ACM"},{"key":"10.1016\/0166-5316(82)90009-8_BIB29","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1109\/TCOM.1977.1093711","article-title":"An optimal routing algorithm using distributed computation","volume":"COM-25","author":"Gallager","year":"1977","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/0166-5316(82)90009-8_BIB30","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/net.3230030202","article-title":"The flow deviation method: An approach to store-and-forward network design","volume":"3","author":"Fratta","year":"1973","journal-title":"Network"},{"key":"10.1016\/0166-5316(82)90009-8_BIB31","article-title":"The design of store-and-forward networks for computer communications","author":"Gerla","year":"1973"},{"key":"10.1016\/0166-5316(82)90009-8_BIB32","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1147\/rd.206.0542","article-title":"Buffer overflow in a store-and-forward network node","volume":"20","author":"Schweitzer","year":"1976","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0166-5316(82)90009-8_BIB33","doi-asserted-by":"crossref","first-page":"958","DOI":"10.1109\/TCOM.1977.1093929","article-title":"Buffer sharing in computer-communication network nodes","volume":"COM-25","author":"Rich","year":"1977","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/0166-5316(82)90009-8_BIB34","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/TCOM.1978.1094076","article-title":"Buffer management in a packet switch","volume":"COM-26","author":"Irland","year":"1978","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/0166-5316(82)90009-8_BIB35","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1109\/TCOM.1980.1094756","article-title":"Analysis of shared finite storage in a computer network environment under general traffic conditions","volume":"COM-28","author":"Kamoun","year":"1980","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/0166-5316(82)90009-8_BIB36","article-title":"Data network simulation experiments at the national physical laboratory","volume":"1","author":"Price","year":"1977","journal-title":"Comput. Networks"},{"key":"10.1016\/0166-5316(82)90009-8_BIB37","first-page":"191","article-title":"Packet networks with deadlock-free buffer allocation \u2014 An investigation by simulation","volume":"2","author":"Giessler","year":"1978","journal-title":"Comput. Networks"},{"key":"10.1016\/0166-5316(82)90009-8_BIB38","first-page":"546","article-title":"The control of congestion in packet switching networks","volume":"COM-23","author":"Davies","year":"1975","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/0166-5316(82)90009-8_BIB39","first-page":"315","article-title":"Analysis of flow control in switched data networks","volume":"77","author":"Wong","year":"1977"},{"key":"10.1016\/0166-5316(82)90009-8_BIB40","article-title":"Credit-oriented congestion control in two-level hierarchical packet switching networks","author":"Unsoy","year":"1980"},{"key":"10.1016\/0166-5316(82)90009-8_BIB41","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1109\/TCOM.1979.1094280","article-title":"Congestion control of store-and-forward networks by input buffer limits \u2014 An analysis","volume":"COM-27","author":"Lam","year":"1979","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/0166-5316(82)90009-8_BIB42","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1109\/TC.1981.1675692","article-title":"Congestion control of packet communication networks by input buffer limits \u2014 A simulation study","volume":"C-30","author":"Lam","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-5316(82)90009-8_BIB43","series-title":"ICC '80 Conf. Rec.","first-page":"23.1.1","article-title":"Input buffer limiting mechanisms for congestion control","author":"Saad","year":"1980"},{"key":"10.1016\/0166-5316(82)90009-8_BIB44","series-title":"Proc. 5th Internat. Conf. Comp. Comm.","first-page":"845","article-title":"Congestion control with a buffer management strategy based on traffic priorities","author":"Kamoun","year":"1980"},{"key":"10.1016\/0166-5316(82)90009-8_BIB45","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1145\/356733.356740","article-title":"Queueing network modeling of computer communication networks","volume":"10","author":"Wong","year":"1978","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/0166-5316(82)90009-8_BIB46","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/TCOM.1977.1093709","article-title":"On the topological design of distributed computer networks","volume":"COM-25","author":"Gerla","year":"1977","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/0166-5316(82)90009-8_BIB47","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1109\/TCOM.1980.1094691","article-title":"Flow control: A comparative survey","volume":"COM-28","author":"Gerla","year":"1980","journal-title":"IEEE Trans. Comm."}],"container-title":["Performance Evaluation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166531682900098?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166531682900098?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T00:53:59Z","timestamp":1552611239000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166531682900098"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,10]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,10]]}},"alternative-id":["0166531682900098"],"URL":"https:\/\/doi.org\/10.1016\/0166-5316(82)90009-8","relation":{},"ISSN":["0166-5316"],"issn-type":[{"value":"0166-5316","type":"print"}],"subject":[],"published":{"date-parts":[[1982,10]]}}}