{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T09:35:42Z","timestamp":1648632942276},"reference-count":20,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,9,1]],"date-time":"1989-09-01T00:00:00Z","timestamp":620611200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Networks and ISDN Systems"],"published-print":{"date-parts":[[1989,9]]},"DOI":"10.1016\/0169-7552(89)90084-6","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T19:17:02Z","timestamp":1060283822000},"page":"201-221","source":"Crossref","is-referenced-by-count":0,"title":["Throughput analysis of blocked access tree algorithms with mini-slots"],"prefix":"10.1016","volume":"17","author":[{"given":"Yuji","family":"Oie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shojiro","family":"Nishio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshiharu","family":"Hasegawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0169-7552(89)90084-6_BIB1","article-title":"A Conflict Resolution Algorithm with Multibit Feedback","author":"Berger","year":"1983"},{"issue":"5","key":"10.1016\/0169-7552(89)90084-6_BIB2","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1109\/TIT.1979.1056093","article-title":"Tree Algorithm for Packet Broadcast Channels","volume":"25","author":"Capetanakis","year":"1979","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"11","key":"10.1016\/0169-7552(89)90084-6_BIB3","doi-asserted-by":"crossref","first-page":"2413","DOI":"10.1109\/TCOM.1982.1095438","article-title":"A Collision Resolution Protocol for Random Access Channels with Energy Detectors","volume":"30","author":"Georgiadis","year":"1983","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/0169-7552(89)90084-6_BIB4","first-page":"71","article-title":"Stack Algorithms for Collision-Detecting Channels and Their Analysis: A Limited Survey","volume":"60","author":"Hofri","year":"1984"},{"issue":"6","key":"10.1016\/0169-7552(89)90084-6_BIB5","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1109\/TIT.1983.1056757","article-title":"Pretested Random Tree Protocols for Packet Conflict Resolution","volume":"29","author":"Huang","year":"1983","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"10.1016\/0169-7552(89)90084-6_BIB6","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1109\/TIT.1985.1057016","article-title":"Delay Analysis of Interval-Searching Contention Resolution Algorithms","volume":"31","author":"Huang","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"10.1016\/0169-7552(89)90084-6_BIB7","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/861.870","article-title":"Multiple-Access Protocols and Time-Constrained Communication","volume":"16","author":"Kurose","year":"1984","journal-title":"ACM Comput. Surveys"},{"issue":"10","key":"10.1016\/0169-7552(89)90084-6_BIB8","doi-asserted-by":"crossref","first-page":"1161","DOI":"10.1109\/TCOM.1983.1095742","article-title":"Combined Random\/Reservation Access for Packet Switched Transmission over a Satellite with On-board Processing: Part I \u2014 Global Beam Satellite","volume":"31","author":"Lee","year":"1983","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/0169-7552(89)90084-6_BIB9","article-title":"Collision-Resolution Algorithms and Random-Access Communications","author":"Massey","year":"1980"},{"issue":"2","key":"10.1016\/0169-7552(89)90084-6_BIB10","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\/0169-7552(89)90084-6_BIB11","series-title":"Proc. IEEE ICC'83","first-page":"C5.3.1","article-title":"Multiaccess of a Slotted Channel Using a Control Mini-Slot","author":"Merakos","year":"1983"},{"key":"10.1016\/0169-7552(89)90084-6_BIB12","series-title":"Modelling Techniques and Tools for Performance Analysis '85","first-page":"343","article-title":"A Proof of Channel Stability of D-ary Symmetrical Tree Algorithms","author":"Muro","year":"1986"},{"key":"10.1016\/0169-7552(89)90084-6_BIB13","series-title":"Proc. IEEE INFOCOM'87","first-page":"258","article-title":"Throughput and Delay Evaluations of Free Access Tree Algorithm with Mini-Slots","author":"Oie","year":"1987"},{"key":"10.1016\/0169-7552(89)90084-6_BIB14","doi-asserted-by":"crossref","first-page":"1058","DOI":"10.1287\/opre.17.6.1058","article-title":"Some Conditions for Ergodicity and Recurrence of Markov Chains","volume":"17","author":"Pakes","year":"1969","journal-title":"Oper. Res."},{"key":"10.1016\/0169-7552(89)90084-6_BIB15","series-title":"Computer Networking and Performance Evaluation","first-page":"399","article-title":"Analysis of a Recurrence Equation Arising in Stack-type Algorithms for Collision-Detecting Channels","author":"Szpankowski","year":"1986"},{"issue":"5","key":"10.1016\/0169-7552(89)90084-6_BIB16","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1109\/TCOM.1987.1096803","article-title":"Announced Arrival Random Access Protocols","volume":"35","author":"Towsley","year":"1987","journal-title":"IEEE Trans. Comm."},{"issue":"4","key":"10.1016\/0169-7552(89)90084-6_BIB17_1","first-page":"259","article-title":"Free Synchronous Packet Access in a Broadcast Channel with Feedback","volume":"14","author":"Tsybakov","year":"1978","journal-title":"Prob. Inform. Transmission"},{"issue":"4","key":"10.1016\/0169-7552(89)90084-6_BIB17_2","first-page":"32","article-title":"Free Synchronous Packet Access in a Broadcast Channel with Feedback","volume":"14","author":"Tsybakov","year":"1978","journal-title":"Problemy Peredachi Informatsii"},{"issue":"2","key":"10.1016\/0169-7552(89)90084-6_BIB18_1","first-page":"134","article-title":"Resolution of a Conflict of Known Multiplicity","volume":"16","author":"Tsybakov","year":"1980","journal-title":"Prob. Inform. Transmission"},{"issue":"2","key":"10.1016\/0169-7552(89)90084-6_BIB18_2","first-page":"69","article-title":"Resolution of a Conflict of Known Multiplicity","volume":"16","author":"Tsybakov","year":"1980","journal-title":"Problemy Peredachi Informatsii"}],"container-title":["Computer Networks and ISDN Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:0169755289900846?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:0169755289900846?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T03:21:25Z","timestamp":1552620085000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/0169755289900846"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,9]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,9]]}},"alternative-id":["0169755289900846"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/0169-7552(89)90084-6","relation":{},"ISSN":["0169-7552"],"issn-type":[{"value":"0169-7552","type":"print"}],"subject":[],"published":{"date-parts":[[1989,9]]}}}