{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T18:50:43Z","timestamp":1773082243406,"version":"3.50.1"},"reference-count":17,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[1987,7,1]],"date-time":"1987-07-01T00:00:00Z","timestamp":552096000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Select. Areas Commun."],"published-print":{"date-parts":[[1987,7]]},"DOI":"10.1109\/jsac.1987.1146613","type":"journal-article","created":{"date-parts":[[2004,4,29]],"date-time":"2004-04-29T00:28:59Z","timestamp":1083198539000},"page":"1051-1062","source":"Crossref","is-referenced-by-count":56,"title":["A Method for the Delay Analysis of Random Multiple-Access Algorithms Whose Delay Process is Regenerative"],"prefix":"10.1109","volume":"5","author":[{"given":"L.","family":"Georgiadis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Merakos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Papantoni-Kazakos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10a","author":"fayolle","year":"1983","journal-title":"The evaluation of packet transmission characteristics in a multi-access collision detection channel with stack collision resolution protocol"},{"key":"ref11","first-page":"385","article-title":"Delay analysis of the n-ary stack algorithm for a random-access broadcast channel","author":"merakos","year":"1984","journal-title":"Proc Allerton Conf Communication and Computers"},{"key":"ref12","first-page":"77","article-title":"Packet delay in the case of a multiple-access stack algorithm","volume":"20","author":"vvedenskaya","year":"1984","journal-title":"Prob Peredach Informatsii"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057018"},{"key":"ref14","first-page":"80","article-title":"Stack algorithm for random multiple access","volume":"15","author":"tsybakov","year":"1980","journal-title":"Probl Peredachi Inform"},{"key":"ref15","author":"kantorovich","year":"1958","journal-title":"Approximate Methods of Higher Analysis"},{"key":"ref16","first-page":"76","article-title":"Upper bound for the delay in a multiple-random-access system with a splitting algorithm","volume":"18","author":"tsybakov","year":"1982","journal-title":"Prob Peredach Informatsii"},{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-95281-4","author":"cohen","year":"1976","journal-title":"On Regenerative Processes in Queueing Theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.2307\/1425993"},{"key":"ref6","article-title":"Conflict resolution in random access broadcast networks","author":"gallager","year":"1978","journal-title":"Proc AFOSR Workshop Commun Theory AppL"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1111\/j.2517-6161.1958.tb00294.x","article-title":"Renewal theory and its ramifications","volume":"b20","author":"smith","year":"1958","journal-title":"J Roy Stat Soc"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057022"},{"key":"ref7","first-page":"65","article-title":"Random multiple access of packets. Part-and-try algorithm","volume":"16","author":"tsybakov","year":"1985","journal-title":"Probl Peredachi Inform"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-2900-5_4"},{"key":"ref1","article-title":"Special Issue on Random-Access Communication","volume":"it 31","year":"1985","journal-title":"IEEE Trans Inform Theory"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1986.1096639"},{"key":"ref10b","first-page":"244","volume":"it 31","year":"1985","journal-title":"IEEE Trans Inform Theory"}],"container-title":["IEEE Journal on Selected Areas in Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx6\/49\/25832\/01146613.pdf?arnumber=1146613","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,16]],"date-time":"2024-12-16T07:18:09Z","timestamp":1734333489000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1146613\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,7]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1987,7]]}},"URL":"https:\/\/doi.org\/10.1109\/jsac.1987.1146613","relation":{},"ISSN":["0733-8716"],"issn-type":[{"value":"0733-8716","type":"print"}],"subject":[],"published":{"date-parts":[[1987,7]]}}}