{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:07:45Z","timestamp":1746058065042,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030910808"},{"type":"electronic","value":"9783030910815"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-91081-5_30","type":"book-chapter","created":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T21:03:40Z","timestamp":1636405420000},"page":"456-468","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Protocols for 2-Party Contention Resolution"],"prefix":"10.1007","author":[{"given":"Dingyu","family":"Wang","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,9]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Abramson, N.: The ALOHA system: another alternative for computer communications. In: Proceedings of the November 17\u201319, 1970, Fall Joint Computer Conference, pp. 281\u2013285. ACM (1970)","DOI":"10.1145\/1478462.1478502"},{"issue":"2","key":"30_CR2","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1109\/TIT.1987.1057295","volume":"33","author":"DJ Aldous","year":"1987","unstructured":"Aldous, D.J.: Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels. IEEE Trans. Inf. Theory 33(2), 219\u2013223 (1987). https:\/\/doi.org\/10.1109\/TIT.1987.1057295","journal-title":"IEEE Trans. Inf. Theory"},{"key":"30_CR3","doi-asserted-by":"publisher","unstructured":"Awerbuch, B., Richa, A.W., Scheideler, C.: A jamming-resistant MAC protocol for single-hop wireless networks. In: Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 45\u201354 (2008). https:\/\/doi.org\/10.1145\/1400751.1400759","DOI":"10.1145\/1400751.1400759"},{"issue":"1","key":"30_CR4","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/0022-0000(92)90042-H","volume":"45","author":"R Bar-Yehuda","year":"1992","unstructured":"Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization. J. Comput. Syst. Sci. 45(1), 104\u2013126 (1992)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"30_CR5","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1137\/17M1158604","volume":"47","author":"M Bender","year":"2018","unstructured":"Bender, M., Kopelowitz, T., Pettie, S., Young, M.: Contention resolution with constant throughput and log-logstar channel accesses. SIAM J. Comput. 47(5), 1735\u20131754 (2018). https:\/\/doi.org\/10.1137\/17M1158604","journal-title":"SIAM J. Comput."},{"key":"30_CR6","doi-asserted-by":"publisher","unstructured":"Bender, M.A., Farach-Colton, M., He, S., Kuszmaul, B.C., Leiserson, C.E.: Adversarial analyses of window backoff strategies. In: Proceedings 18th International Parallel and Distributed Processing Symposium (IPDPS) (2004). https:\/\/doi.org\/10.1109\/IPDPS.2004.1303230, https:\/\/doi.org\/10.1109\/IPDPS.2004.1303230","DOI":"10.1109\/IPDPS.2004.1303230"},{"key":"30_CR7","doi-asserted-by":"publisher","unstructured":"Bender, M.A., Farach-Colton, M., He, S., Kuszmaul, B.C., Leiserson, C.E.: Adversarial contention resolution for simple channels. In: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 325\u2013332 (2005). https:\/\/doi.org\/10.1145\/1073970.1074023","DOI":"10.1145\/1073970.1074023"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Fineman, J.T., Gilbert, S., Young, M.: Scaling exponential backoff: constant throughput, polylogarithmic channel-access attempts, and robustness. J. ACM 66(1), 6:1\u20136:33 (2019)","DOI":"10.1145\/3276769"},{"issue":"5","key":"30_CR9","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1109\/TIT.1979.1056093","volume":"25","author":"J Capetanakis","year":"1979","unstructured":"Capetanakis, J.: Tree algorithms for packet broadcast channels. IEEE Trans. Inf. Theory 25(5), 505\u2013515 (1979). https:\/\/doi.org\/10.1109\/TIT.1979.1056093","journal-title":"IEEE Trans. Inf. Theory"},{"key":"30_CR10","doi-asserted-by":"publisher","unstructured":"Chang, Y., Jin, W., Pettie, S.: Simple contention resolution via multiplicative weight updates. In: Proceedings 2nd Symposium on Simplicity in Algorithms (SOSA), pp. 16:1\u201316:16 (2019). https:\/\/doi.org\/10.4230\/OASIcs.SOSA.2019.16","DOI":"10.4230\/OASIcs.SOSA.2019.16"},{"key":"30_CR11","doi-asserted-by":"publisher","unstructured":"Chang, Y., Kopelowitz, T., Pettie, S., Wang, R., Zhan, W.: Exponential separations in the energy complexity of leader election. In: Proceedings 49th Annual ACM Symposium on Theory of Computing (STOC), pp. 771\u2013783 (2017). https:\/\/doi.org\/10.1145\/3055399.3055481, http:\/\/doi.acm.org\/10.1145\/3055399.3055481","DOI":"10.1145\/3055399.3055481"},{"key":"30_CR12","unstructured":"Gallager, R.G.: Conflict resolution in random access broadcast networks. In: Proceedings AFOSR Workshop on Communications Theory Applications, Provincetown, MA, 17\u201320 September, pp. 74\u201376 (1978)"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Jacobson, V.: Congestion avoidance and control. ACM SIGCOMM Comput. Commun. Rev. 18, 314\u2013329. ACM (1988)","DOI":"10.1145\/52325.52356"},{"issue":"2","key":"30_CR14","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1109\/TNET.2005.845533","volume":"13","author":"BJ Kwak","year":"2005","unstructured":"Kwak, B.J., Song, N.O., Miller, L.E.: Performance analysis of exponential backoff. IEEE\/ACM Trans. Netw. (TON) 13(2), 343\u2013355 (2005)","journal-title":"IEEE\/ACM Trans. Netw. (TON)"},{"issue":"7","key":"30_CR15","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1145\/360248.360253","volume":"19","author":"RM Metcalfe","year":"1976","unstructured":"Metcalfe, R.M., Boggs, D.R.: Ethernet: distributed packet switching for local computer networks. Commun. ACM 19(7), 395\u2013404 (1976)","journal-title":"Commun. ACM"},{"issue":"1","key":"30_CR16","first-page":"90","volume":"17","author":"VA Mikhailov","year":"1981","unstructured":"Mikhailov, V.A., Tsybakov, B.S.: Upper bound for the capacity of a random multiple access system. Problemy Peredachi Informatsii 17(1), 90\u201395 (1981)","journal-title":"Problemy Peredachi Informatsii"},{"issue":"2","key":"30_CR17","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1109\/TCOM.1985.1096261","volume":"33","author":"J Mosely","year":"1985","unstructured":"Mosely, J., Humblet, P.A.: A class of efficient contention resolution algorithms for multiple access channels. IEEE Trans. Commun. 33(2), 145\u2013151 (1985). https:\/\/doi.org\/10.1109\/TCOM.1985.1096261","journal-title":"IEEE Trans. Commun."},{"issue":"5","key":"30_CR18","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1109\/TPDS.2002.1003864","volume":"13","author":"K Nakano","year":"2002","unstructured":"Nakano, K., Olariu, S.: Uniform leader election protocols for radio networks. IEEE Trans. Parallel Distrib. Syst. 13(5), 516\u2013526 (2002). https:\/\/doi.org\/10.1109\/TPDS.2002.1003864","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Newport, C.: Radio network lower bounds made easy. In: Proceedings of the 28th International Symposium on Distributed Computing (DISC), pp. 258\u2013272 (2014)","DOI":"10.1007\/978-3-662-45174-8_18"},{"key":"30_CR20","doi-asserted-by":"crossref","unstructured":"Rajwar, R., Goodman, J.R.: Speculative lock elision: enabling highly concurrent multithreaded execution. In: Proceedings of the 34th Annual ACM\/IEEE International Symposium on Microarchitecture, pp. 294\u2013305. IEEE Computer Society (2001)","DOI":"10.1109\/MICRO.2001.991127"},{"issue":"4","key":"30_CR21","first-page":"32","volume":"14","author":"BS Tsybakov","year":"1978","unstructured":"Tsybakov, B.S., Mikhailov, V.A.: Slotted multiaccess packet broadcasting feedback channel. Problemy Peredachi Informatsii 14(4), 32\u201359 (1978)","journal-title":"Problemy Peredachi Informatsii"},{"issue":"2","key":"30_CR22","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1137\/0215032","volume":"15","author":"DE Willard","year":"1986","unstructured":"Willard, D.E.: Log-logarithmic selection resolution protocols in a multiple access channel. SIAM J. Comput. 15(2), 468\u2013477 (1986). https:\/\/doi.org\/10.1137\/0215032","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91081-5_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T19:37:46Z","timestamp":1726083466000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91081-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030910808","9783030910815"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91081-5_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cse.chalmers.se\/~elad\/SSS2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"56","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}