{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:22:54Z","timestamp":1787340174868,"version":"build-2736575974"},"reference-count":11,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1998,1]]},"abstract":"<jats:p>We study contention resolution protocols under a stochastic model of continuous request generation from a set of contenders. The performance of such a protocol is characterized by two parameters: the maximum arrival rate for which the protocol is stable and the expected delay of a request from arrival to service.<\/jats:p>\n                  <jats:p>Known solutions are either unstable for any constant injection rate or have at least polynomial (in the number of contenders) expected delay. Our main contribution is a protocol that is stable for a constant injection rate, while achieving logarithmic expected delay. We extend our results to the case of multiple servers, with each request being targeted for a specific server. This is related to the optically connected parallel computer (or OCPC) model. Finally, we prove a lower bound showing that long delays are inevitable in a class of protocols including backoff-style protocols, if the arrival rate is large enough (but still smaller than 1).<\/jats:p>","DOI":"10.1137\/s0097539795285333","type":"journal-article","created":{"date-parts":[[2003,6,11]],"date-time":"2003-06-11T11:12:06Z","timestamp":1055329926000},"page":"709-719","source":"Crossref","is-referenced-by-count":49,"title":["Stochastic Contention Resolution With Short Delays"],"prefix":"10.1137","volume":"28","author":[{"given":"Prabhakar","family":"Raghavan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eli","family":"Upfal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,28]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057295"},{"key":"R2","volume-title":"An introduction to probability theory and its applications. Vol. II.","author":"Feller William","year":"1971"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1145\/44483.44488"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1145\/23005.23006"},{"key":"R5","unstructured":"Leslie Goldberg, Philip MacKenzie, Analysis of practical backoff protocols for contention resolution with multiple servers, ACM, New York, 1996, 554\u20135631381961"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"J. H\u00e5stad, T. Leighton, and B. Rogoff,\n                      Analysis of backoff protocols for multiple access channels\n                      , in Proceedings of the 19th ACM Symp. on Theory of Computing, 1987, pp. 241\u2013253.","DOI":"10.1145\/28395.28422"},{"key":"R7","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1111\/j.2517-6161.1985.tb01367.x","volume":"47","author":"Kelly F. P.","year":"1985","journal-title":"J. Roy. Statist. Soc. B","ISSN":"https:\/\/id.crossref.org\/issn\/0035-9246","issn-type":"print"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"P. D. MacKenzie, C. G. Plaxton, and R. Rajaraman,\n                      On contention resolution protocols and associated probabilistic phenomena\n                      , in Proceedings of the 26th ACM Symp. on Theory of Computing, 1994, pp. 153\u2013162.","DOI":"10.1145\/195058.195122"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1145\/360248.360253"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"R. Motwani and P. Raghavan,\n                      Randomized Algorithms\n                      , Cambridge University Press, New York, 1995.","DOI":"10.1017\/CBO9780511814075"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"M. Paterson and A. Srinivasan,\n                      Contension resolution with bounded delays\n                      , in Proceedings of the 36th Annual ACM Symp. on Foundations of Computer Science, 1995, pp. 104\u2013113.","DOI":"10.1109\/SFCS.1995.492467"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S0097539795285333","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:22:54Z","timestamp":1787336574000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S0097539795285333"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["10.1137\/S0097539795285333"],"URL":"https:\/\/doi.org\/10.1137\/s0097539795285333","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}