{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T08:22:35Z","timestamp":1772785355334,"version":"3.50.1"},"reference-count":15,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2020,10,31]],"date-time":"2020-10-31T00:00:00Z","timestamp":1604102400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Queue"],"published-print":{"date-parts":[[2020,10,31]]},"abstract":"<jats:p>\n            Feeding all relevant inputs to a central solver is the obvious way to tackle a problem, but it's not always the only way.\n            <jats:italic>Decentralized<\/jats:italic>\n            methods that make do with only local communication and local computation are sometimes the best way. This episode of Drill Bits reviews an elegant protocol for self-organizing wireless networks that can also solve a seemingly impossible\n            <jats:italic>social<\/jats:italic>\n            networking problem. The protocol preserves privacy among participants and is so simple that it can be implemented with pencil, paper, and postcards. Example software implements both the decentralized protocol and a centralized solver.\n          <\/jats:p>","DOI":"10.1145\/3434571.3436964","type":"journal-article","created":{"date-parts":[[2020,11,20]],"date-time":"2020-11-20T14:40:29Z","timestamp":1605883229000},"page":"41-53","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Decentralized Computing"],"prefix":"10.1145","volume":"18","author":[{"given":"Terence","family":"Kelly","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,11,16]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Coatta T. 2008. From here to there the SOA way. acmqueue 5(6); https:\/\/queue.acm.org\/detail.cfm?id=1388788.","DOI":"10.1145\/1317394.1388788"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/570810.570812"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Kelly T. 2020. Efficient graph search. acmqueue 18(4); https:\/\/queue.acm.org\/detail.cfm?id=3424304.","DOI":"10.1145\/3424302.3424304"},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Killalea T. 2016. The hidden dividends of microservices. acmqueue 14(3); https:\/\/queue.acm.org\/detail.cfm?id=2956643.","DOI":"10.1145\/2956641.2956643"},{"key":"e_1_2_1_5_1","unstructured":"Lee J. G. Cheung G. Lee S.-L. Sharma P. 2013. Channel assignment for a wireless network. U.S. Patent # 8 531 956 (September)."},{"key":"e_1_2_1_6_1","unstructured":"Natarajan K. S. 1993. Robust scheduling mechanism for efficient bandwidth usage in multicell wireless local networks. U.S. Patent # 5 210 753 (May)."},{"key":"e_1_2_1_7_1","unstructured":"Onion News Network. 2011. CIA's \"Facebook\" program dramatically cut agency's costs; https:\/\/www.youtube.com\/watch?v=ZJ380SHZvYU and https:\/\/www.theonion.com\/cias-facebook-program-dramatically-cut-agencys-costs-1819594988."},{"key":"e_1_2_1_8_1","volume-title":"Interconnections: Bridges, Routers, Switches, and Internetworking Protocols","author":"Perlman R.","year":"1999","unstructured":"Perlman, R. 1999. Interconnections: Bridges, Routers, Switches, and Internetworking Protocols, second edition. Addison-Wesley. Chapter 12."},{"key":"e_1_2_1_9_1","unstructured":"Schreiber R. S. Kelly T. P. 2014. Determination of maximal independent sets of mobile devices. U.S. Patent # 8 849 325 (September)."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/382244.382832"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","unstructured":"Varian H. R. 2008. Designing the perfect auction. Communications of the ACM 51(8) 9?11; https:\/\/doi.org\/10.1145\/1378704.1378708.","DOI":"10.1145\/1378704.1378708"},{"key":"e_1_2_1_12_1","volume-title":"Market-Based Control: A Paradigm for Distributed Resource Allocation","author":"Wellman M. P.","year":"2010","unstructured":"Wellman, M. P. 1996. Market-oriented programming: some early lessons. In Market-Based Control: A Paradigm for Distributed Resource Allocation. Chapter 4. World Scientific; http:\/\/strategicreasoning.org\/wp-content\/uploads\/2010\/03\/mbc95.pdf."},{"key":"e_1_2_1_13_1","unstructured":"Wikipedia. Conway's Game of Life; https:\/\/en.wikipedia.org\/wiki\/Conway's_Game_of_Life."},{"key":"e_1_2_1_14_1","unstructured":"Wikipedia. Maximal Independent Set. https:\/\/en.wikipedia.org\/wiki\/Maximal_independent_set."},{"key":"e_1_2_1_15_1","volume-title":"Procedings of the Usenix Annual Technical Conference (June); https:\/\/www.usenix.org\/system\/files\/conference\/atc12\/atc12-final206-7-20-12","author":"Yoo S.","year":"2012","unstructured":"Yoo, S., Killian, C., Kelly, T., Cho, H. K., Plite, S. 2012. Composable reliability for asynchronous systems. In Procedings of the Usenix Annual Technical Conference (June); https:\/\/www.usenix.org\/system\/files\/conference\/atc12\/atc12-final206-7-20-12.pdf."}],"container-title":["Queue"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3434571.3436964","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3434571.3436964","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:31:48Z","timestamp":1750195908000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3434571.3436964"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,31]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,10,31]]}},"alternative-id":["10.1145\/3434571.3436964"],"URL":"https:\/\/doi.org\/10.1145\/3434571.3436964","relation":{},"ISSN":["1542-7730","1542-7749"],"issn-type":[{"value":"1542-7730","type":"print"},{"value":"1542-7749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,31]]},"assertion":[{"value":"2020-11-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}