{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T04:09:49Z","timestamp":1725768589427},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,1]]},"DOI":"10.1109\/ita.2010.5454097","type":"proceedings-article","created":{"date-parts":[[2010,5,6]],"date-time":"2010-05-06T15:18:19Z","timestamp":1273159099000},"page":"1-4","source":"Crossref","is-referenced-by-count":9,"title":["Random capture algorithms fluid limits and stability"],"prefix":"10.1109","author":[{"given":"M.","family":"Feuillet","sequence":"first","affiliation":[]},{"given":"A.","family":"Proutiere","sequence":"additional","affiliation":[]},{"given":"P.","family":"Robert","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"Network adiabatic theorem: An efficient randomized protocol for contention resolution","author":"shin","year":"2009","journal-title":"Proceedings of ACM SIGMETRICS"},{"article-title":"Distributed random access algorithm: Scheduling and congesion control","year":"2009","author":"jiang","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177004828"},{"key":"ref13","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316962","author":"billingsley","year":"1999","journal-title":"Convergence of Probability Measures"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-4483-2"},{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1145\/1375457.1375459","article-title":"Performance of random multi-access algorithms, an asymptotic approach","author":"bordenave","year":"2008","journal-title":"Proceedings of ACM SIGMETRICS"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1254882.1254920"},{"key":"ref6","article-title":"Maximum size matching is unstable in any packet switch","author":"zhang-shen","year":"2003","journal-title":"Technical report Stanford Univ TR03-HPNG-030100"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2008.4558579"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2008.4558577"},{"key":"ref7","article-title":"Throughput guarantees in maximal matching in wireless networks","author":"chaporkar","year":"2005","journal-title":"Proceedings of the 43rd Annual Allerton Conference on Communication Control and Computing"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1140277.1140283"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797741"}],"event":{"name":"2010 Information Theory and Applications Workshop (ITA)","start":{"date-parts":[[2010,1,31]]},"location":"La Jolla, CA, USA","end":{"date-parts":[[2010,2,5]]}},"container-title":["2010 Information Theory and Applications Workshop (ITA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5442786\/5454064\/05454097.pdf?arnumber=5454097","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T03:54:45Z","timestamp":1497844485000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5454097\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/ita.2010.5454097","relation":{},"subject":[],"published":{"date-parts":[[2010,1]]}}}