{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T16:43:42Z","timestamp":1694623422299},"reference-count":12,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[1993,5,1]],"date-time":"1993-05-01T00:00:00Z","timestamp":736214400000},"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 Trans. Commun."],"published-print":{"date-parts":[[1993,5]]},"DOI":"10.1109\/26.225484","type":"journal-article","created":{"date-parts":[[2002,8,24]],"date-time":"2002-08-24T22:54:52Z","timestamp":1030229692000},"page":"683-693","source":"Crossref","is-referenced-by-count":4,"title":["Bounds on the delay distribution of window random-access algorithms"],"prefix":"10.1109","volume":"41","author":[{"given":"L.","family":"Georgiadis","sequence":"first","affiliation":[]},{"given":"M.","family":"Paterakis","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1987.1096710"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.1987.1146613"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057014"},{"key":"ref6","author":"studer","year":"1984","journal-title":"Q-ary Part-and-Try Algorithm for Packet Conflict Resolution"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1287\/opre.17.6.1058"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-2900-5_4"},{"key":"ref12","first-page":"1403","article-title":"A generalized busy period approach to the delay analysis of window access tree conflict resolution algorithms","author":"polyzos","year":"1987","journal-title":"Proc 1987 Int Conf Commun"},{"key":"ref8","author":"bertsekas","year":"1987","journal-title":"Data Networks"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.2307\/1425993"},{"key":"ref2","article-title":"Delay analysis of interval searching contention resolution algorithms","volume":"it 31","author":"huang","year":"1985","journal-title":"IEEE Trans Inform Theory"},{"key":"ref9","first-page":"77","article-title":"Packet delay in the case of a multiple-access stack algorithm","volume":"20","author":"vvedenskaya","year":"1984","journal-title":"Probl Peredach Inform"},{"key":"ref1","first-page":"76","article-title":"Upper bound for the delay in a random-access system with a splitting algorithm","volume":"18","author":"tsybakov","year":"1982","journal-title":"Problemy Peredachi Informatsii"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx1\/26\/5880\/00225484.pdf?arnumber=225484","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:04:34Z","timestamp":1638216274000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/225484\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,5]]},"references-count":12,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/26.225484","relation":{},"ISSN":["0090-6778"],"issn-type":[{"value":"0090-6778","type":"print"}],"subject":[],"published":{"date-parts":[[1993,5]]}}}