{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T12:12:43Z","timestamp":1763381563402,"version":"3.45.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2340748"],"award-info":[{"award-number":["2340748"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,17]]},"DOI":"10.1145\/3772356.3772401","type":"proceedings-article","created":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T12:02:48Z","timestamp":1763380968000},"page":"227-235","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Beyond Lamport, Towards Probabilistic Fair Ordering"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1402-2115","authenticated-orcid":false,"given":"Muhammad","family":"Haseeb","sequence":"first","affiliation":[{"name":"New York University, New York City, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6574-8349","authenticated-orcid":false,"given":"Jinkun","family":"Geng","sequence":"additional","affiliation":[{"name":"Stanford University, Palo Alto, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4082-7865","authenticated-orcid":false,"given":"Radhika","family":"Mittal","sequence":"additional","affiliation":[{"name":"UIUC, Urbana-Champaign, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9664-4377","authenticated-orcid":false,"given":"Aurojit","family":"Panda","sequence":"additional","affiliation":[{"name":"NYU, New York City, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1128-477X","authenticated-orcid":false,"given":"Srinivas","family":"Narayana","sequence":"additional","affiliation":[{"name":"Rutgers University, New Brunswick, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5025-4234","authenticated-orcid":false,"given":"Anirudh","family":"Sivaraman","sequence":"additional","affiliation":[{"name":"New York University, New York City, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,11,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/279227.279229"},{"key":"e_1_3_2_1_2_1","first-page":"320","volume-title":"Proceedings of the 2014 USENIX Conference on USENIX Annual Technical Conference, USENIX ATC'14","author":"Ongaro Diego","year":"2014","unstructured":"Diego Ongaro and John Ousterhout. In search of an understandable consensus algorithm. In Proceedings of the 2014 USENIX Conference on USENIX Annual Technical Conference, USENIX ATC'14, page 305\u2013320, USA, 2014. USENIX Association. ISBN 9781931971102."},{"key":"e_1_3_2_1_3_1","first-page":"483","volume-title":"12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 16)","author":"Li Jialin","year":"2016","unstructured":"Jialin Li, Ellis Michael, Naveen Kr. Sharma, Adriana Szekeres, and Dan R. K. Ports. Just say NO to paxos overhead: Replacing consensus with network ordering. In 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 16), pages 467\u2013483, Savannah, GA, November 2016. USENIX Association. ISBN 978-1-931971-33-1. URL https:\/\/www.usenix.org\/conference\/osdi16\/technical-sessions\/presentation\/li."},{"key":"e_1_3_2_1_4_1","first-page":"320","volume-title":"20th USENIX Symposium on Networked Systems Design and Implementation (NSDI 23)","author":"Choi Inho","year":"2023","unstructured":"Inho Choi, Ellis Michael, Yunfan Li, Dan R. K. Ports, and Jialin Li. Hydra: Serialization-Free network ordering for strongly consistent distributed applications. In 20th USENIX Symposium on Networked Systems Design and Implementation (NSDI 23), pages 293\u2013320, Boston, MA, April 2023. USENIX Association. ISBN 978-1-939133-33-5. URL https:\/\/www.usenix.org\/conference\/nsdi23\/presentation\/choi."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132751"},{"key":"e_1_3_2_1_6_1","unstructured":"Amazon Ads. What is real-time bidding (rtb)? definition and importance. https:\/\/advertising.amazon.com\/library\/guides\/real-time-bidding. Accessed: 2025-04-07."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3458336.3465278"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3603269.3604871"},{"key":"e_1_3_2_1_9_1","volume-title":"Nike shoe bot - the ultimate sneaker bot","author":"Bot Nike Shoe","year":"2025","unstructured":"Nike Shoe Bot. Nike shoe bot - the ultimate sneaker bot, 2025. URL https:\/\/www.nikeshoebot.com\/. Accessed: 2025-03-19."},{"key":"e_1_3_2_1_10_1","volume-title":"Aio bot | the ultimate sneaker bot for automatic copping","author":"Bot AIO","year":"2025","unstructured":"AIO Bot. Aio bot | the ultimate sneaker bot for automatic copping, 2025. URL https:\/\/www.aiobot.com\/. Accessed: 2025-03-19."},{"key":"e_1_3_2_1_11_1","volume-title":"Nft bots: How they work and how to stop them","year":"2025","unstructured":"Kasada. Nft bots: How they work and how to stop them, 2025. URL https:\/\/www.kasada.io\/nft-bots\/. Accessed: 2025-03-19."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3469259.3470485"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3672202.3673728"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359563"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2010.2089210"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(84)80033-9"},{"key":"e_1_3_2_1_17_1","first-page":"94","volume-title":"15th USENIX Symposium on Networked Systems Design and Implementation (NSDI 18)","author":"Geng Yilong","year":"2018","unstructured":"Yilong Geng, Shiyu Liu, Zi Yin, Ashish Naik, Balaji Prabhakar, Mendel Rosenblum, and Amin Vahdat. Exploiting a natural network effect for scalable, fine-grained clock synchronization. In 15th USENIX Symposium on Networked Systems Design and Implementation (NSDI 18), pages 81\u201394, Renton, WA, April 2018. USENIX Association. ISBN 978-1-939133-01-4. URL https:\/\/www.usenix.org\/conference\/nsdi18\/presentation\/geng."},{"key":"e_1_3_2_1_18_1","volume-title":"Fair ordering","author":"Haseeb Muhammad","year":"2025","unstructured":"Muhammad Haseeb, Jinkun Geng, Radhika Mittal, Aurojit Panda, Srinivas Narayana, and Anirudh Sivaraman. Fair ordering, 2025. URL https:\/\/arxiv.org\/abs\/2510.13664."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1994.11996968"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491245"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3718958.3750530"},{"key":"e_1_3_2_1_22_1","unstructured":"leptonsys.com. Layer 1 switches: Key functions and technologies. https:\/\/www.leptonsys.com\/blog\/layer-1-switches-key-functions-and-technologies."},{"key":"e_1_3_2_1_23_1","first-page":"649","volume-title":"14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20)","author":"Zhang Yunhao","unstructured":"Yunhao Zhang, Srinath Setty, Qi Chen, Lidong Zhou, and Lorenzo Alvisi. Byzantine ordered consensus without byzantine oligarchy. In 14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20), pages 633\u2013649. USENIX Association, November 2020. ISBN 978-1-939133-19-9. URL https:\/\/www.usenix.org\/conference\/osdi20\/presentation\/zhang-yunhao."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3731569.3764854"},{"key":"e_1_3_2_1_25_1","first-page":"01","article-title":"A quantitative measure of fairness and discrimination for resource allocation in shared computer systems. CoRR, cs.","author":"Jain Raj","year":"1998","unstructured":"Raj Jain, Dah Ming Chiu, and Hawe WR. A quantitative measure of fairness and discrimination for resource allocation in shared computer systems. CoRR, cs.NI\/9809099, 01 1998.","journal-title":"NI\/9809099"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400097.1400102"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1985.1164715"},{"key":"e_1_3_2_1_28_1","unstructured":"Ha Yang Kim. Modeling and tracking time-varying clock drifts in wireless networks. PhD thesis Georgia Institute of Technology Atlanta GA USA 2015."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600572"},{"key":"e_1_3_2_1_30_1","unstructured":"DPDK Project. Data plane development kit (dpdk). https:\/\/www.dpdk.org\/. Accessed: 2025-04-07."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3281411.3281443"},{"key":"e_1_3_2_1_32_1","unstructured":"Real-Time Linux Project. Real-time linux. https:\/\/wiki.linuxfoundation.org\/realtime\/start. Accessed: 2025-04-07."}],"event":{"name":"HotNets '25: 24th ACM Workshop on Hot Topics in Networks","location":"UMD Campus College Park MD USA","acronym":"HotNets '25","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the 24th ACM Workshop on Hot Topics in Networks"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3772356.3772401","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T12:07:47Z","timestamp":1763381267000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3772356.3772401"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,17]]},"references-count":32,"alternative-id":["10.1145\/3772356.3772401","10.1145\/3772356"],"URL":"https:\/\/doi.org\/10.1145\/3772356.3772401","relation":{},"subject":[],"published":{"date-parts":[[2025,11,17]]},"assertion":[{"value":"2025-11-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}