{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T08:52:51Z","timestamp":1754556771554},"reference-count":23,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"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":[[2003,8]]},"DOI":"10.1016\/s0166-5316(03)00061-0","type":"journal-article","created":{"date-parts":[[2003,6,9]],"date-time":"2003-06-09T21:09:27Z","timestamp":1055192967000},"page":"169-185","source":"Crossref","is-referenced-by-count":12,"title":["Delay models for contention trees in closed populations"],"prefix":"10.1016","volume":"53","author":[{"given":"Onno","family":"Boxma","sequence":"first","affiliation":[]},{"given":"Dee","family":"Denteneer","sequence":"additional","affiliation":[]},{"given":"Jacques","family":"Resing","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-5316(03)00061-0_BIB1","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF02100270","article-title":"Response times in gated M\/G\/1\/ queues: the processor sharing case","volume":"4","author":"Avi-Itzhak","year":"1989","journal-title":"Queueing Syst."},{"key":"10.1016\/S0166-5316(03)00061-0_BIB2","unstructured":"D.P. Bertsekas, R.G. Gallager, Data Networks, Prentice-Hall, Englewood Cliffs, NJ, 1992."},{"key":"10.1016\/S0166-5316(03)00061-0_BIB3","doi-asserted-by":"crossref","unstructured":"S.C. Borst, O.J. Boxma, J.A. Morrison, R. N\u00fa\u00f1ez Queija, The equivalence of processor sharing and service in random order, Oper. Res. Lett. 31 (2003) 254\u2013262.","DOI":"10.1016\/S0167-6377(03)00006-3"},{"key":"10.1016\/S0166-5316(03)00061-0_BIB4","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1109\/TIT.1979.1056093","article-title":"Tree algorithms for packet broadcast channels","volume":"25","author":"Capetanakis","year":"1979","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-5316(03)00061-0_BIB5","unstructured":"J.W. Cohen, The Single Server Queue, 2nd ed., North-Holland, Amsterdam, 1982."},{"key":"10.1016\/S0166-5316(03)00061-0_BIB6","doi-asserted-by":"crossref","first-page":"937","DOI":"10.2307\/3213712","article-title":"On processor sharing and random order of service","volume":"21","author":"Cohen","year":"1984","journal-title":"J. Appl. Prob."},{"issue":"8","key":"10.1016\/S0166-5316(03)00061-0_BIB7","doi-asserted-by":"crossref","first-page":"1403","DOI":"10.1002\/j.1538-7305.1973.tb02025.x","article-title":"Use of a gate to reduce the variance of delays in queues with random service","volume":"52","author":"Coleman","year":"1973","journal-title":"Bell Syst. Tech. J."},{"issue":"2","key":"10.1016\/S0166-5316(03)00061-0_BIB8","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1109\/90.842142","article-title":"A priority scheme for the IEEE 802.14 MAC protocol for hybrid fiber-coax networks","volume":"8","author":"Corner","year":"2000","journal-title":"IEEE\/ACM Trans. Network."},{"key":"10.1016\/S0166-5316(03)00061-0_BIB9","unstructured":"D. Denteneer, V. Pronk, On the number of contenders in a contention tree, in: Proceedings of the ITC Specialist Seminar, Girona, 2001, pp. 105\u2013112."},{"issue":"6","key":"10.1016\/S0166-5316(03)00061-0_BIB10","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/35.587713","article-title":"The (r)evolution of access networks for the information super-highway","volume":"35","author":"van Driel","year":"1997","journal-title":"IEEE Commun. Mag."},{"key":"10.1016\/S0166-5316(03)00061-0_BIB11","unstructured":"DVB, Digital Video Broadcasting (DVB), DVB interaction channel for cable TV distribution systems (CATV), Working draft, Version 3, 28 June 2000, based on European Telecommunications Standard 300800, March 1998."},{"key":"10.1016\/S0166-5316(03)00061-0_BIB12","doi-asserted-by":"crossref","first-page":"2163","DOI":"10.1109\/18.868486","article-title":"Analysis of contention tree-algorithms","volume":"46","author":"Janssen","year":"2000","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-5316(03)00061-0_BIB13","unstructured":"L. Kleinrock, Queueing Systems Vol. 2: Computer Applications, Wiley, New York, 1976."},{"key":"10.1016\/S0166-5316(03)00061-0_BIB14","unstructured":"H. Kobayashi, Modeling and Analysis: An Introduction to System Performance Evaluation Methodology, Addison-Wesley, Reading, MA, 1978."},{"key":"10.1016\/S0166-5316(03)00061-0_BIB15","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1109\/TIT.1985.1057013","article-title":"Q-ary collision resolution algorithms in random-access systems with free or blocked channel access","volume":"31","author":"Mathys","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-5316(03)00061-0_BIB16","doi-asserted-by":"crossref","first-page":"931","DOI":"10.1109\/18.21217","article-title":"Delay analysis of the n-ary stack random access algorithm","volume":"34","author":"Merakos","year":"1988","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-5316(03)00061-0_BIB17","unstructured":"D. Mitra, Waiting time distributions for closed queueing network models of shared-processor systems, in: F.J. Kylstra (Ed.), Proceedings of the Performance\u201981, North-Holland, Amsterdam, 1981, pp. 113\u2013131."},{"key":"10.1016\/S0166-5316(03)00061-0_BIB18","unstructured":"K.C. Sevcik, I. Mitrani, The distribution of queueing network states at input and output instants, in: M. Arato, et al. (Eds.), Proceedings of the Performance\u201979, North-Holland, Amsterdam, 1979, pp. 319\u2013335."},{"key":"10.1016\/S0166-5316(03)00061-0_BIB19","unstructured":"L. Tak\u00e1cs, Introduction to the Theory of Queues, Oxford University Press, Oxford, 1962."},{"key":"10.1016\/S0166-5316(03)00061-0_BIB20","first-page":"65","article-title":"Random multiple access of packets: part and try algorithm","volume":"16","author":"Tsybakov","year":"1980","journal-title":"Problem Peredachi Inform."},{"key":"10.1016\/S0166-5316(03)00061-0_BIB21","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1109\/TIT.1985.1057023","article-title":"Survey of USSR contributions to random multiple-access communications","volume":"31","author":"Tsybakov","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-5316(03)00061-0_BIB22","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF03019441","article-title":"Les formules d\u2019Erlang et leur calcul pratique","volume":"6","author":"Vaulot","year":"1951","journal-title":"Ann. Telecom."},{"key":"10.1016\/S0166-5316(03)00061-0_BIB23","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1002\/j.1538-7305.1984.tb00102.x","article-title":"Heavy-traffic approximations for service systems with blocking","volume":"63","author":"Whitt","year":"1984","journal-title":"AT&T Bell Lab. Tech. J."}],"container-title":["Performance Evaluation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166531603000610?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166531603000610?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T10:43:31Z","timestamp":1682505811000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166531603000610"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":23,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0166531603000610"],"URL":"https:\/\/doi.org\/10.1016\/s0166-5316(03)00061-0","relation":{},"ISSN":["0166-5316"],"issn-type":[{"value":"0166-5316","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}