{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,31]],"date-time":"2025-08-31T10:20:51Z","timestamp":1756635651536,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,20]],"date-time":"2024-07-20T00:00:00Z","timestamp":1721433600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Tri-Agency Institutional Program","award":["70009932"],"award-info":[{"award-number":["70009932"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,23]]},"DOI":"10.1145\/3673422.3674891","type":"proceedings-article","created":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T06:25:21Z","timestamp":1721111121000},"page":"31-37","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["DARE: Making Diffusing Computations More Efficient for Loop-Free Shortest-Path Routing"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9914-6031","authenticated-orcid":false,"given":"J. J.","family":"Garcia-Luna-Aceves","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6149-0774","authenticated-orcid":false,"given":"Morteza","family":"Moghaddassian","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, Canada"}]}],"member":"320","published-online":{"date-parts":[[2024,7,20]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Interop '94","author":"Albrightson B.","year":"1994","unstructured":"B. Albrightson, et al., \"EIGRP - A Fast Routing Protocol based on Distance Vectors,\" Proc. Interop '94, 1994."},{"key":"e_1_3_2_1_2_1","author":"Arora A.","year":"2006","unstructured":"A. Arora and H. Zhang, \"LSRP: Local Stabilization in Shortest Path Routing,\" IEEE\/ACM Trans.on Networking, June 2006.","journal-title":"\"LSRP: Local Stabilization in Shortest Path Routing,\" IEEE\/ACM Trans.on Networking"},{"key":"e_1_3_2_1_3_1","volume-title":"IEEE INFOCOM '98","author":"Behrens J.","year":"1998","unstructured":"J. Behrens and J.J. Garcia-Luna-Aceves, \"Hierarchical Routing Using Link Vectors,\" Proc. IEEE INFOCOM '98, 1998."},{"key":"e_1_3_2_1_4_1","volume-title":"July","author":"Bhargavan K.","year":"2002","unstructured":"K. Bhargavan et al., \"Formal Verification of Standards for Distance Vector Routing Protocols,\" Journal of the ACM, July 2002."},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. ACM SIGCOMM '89","author":"Cheng C.","year":"1989","unstructured":"C. Cheng et al., \"A Loop-Free Extended Bellman-Ford Routing Protocol without Bouncing Effect,\" Proc. ACM SIGCOMM '89, Aug. 1989."},{"key":"e_1_3_2_1_6_1","volume-title":"IETF","author":"Chroboczek J.","year":"2021","unstructured":"J. Chroboczek and D. Schinazi, \"The Babel Routing Protocol,\" RFC 8966, IETF, Jan. 2021."},{"key":"e_1_3_2_1_7_1","volume-title":"IEEE WiMob '11","author":"Clausen T.","year":"2011","unstructured":"T. Clausen, U. Herberg, and M. Philipp, \"A Critical Evaluation of the IPv6 Routing Protocol for Low Power and Lossy Networks (RPL),\" Proc. IEEE WiMob '11, Oct. 2011."},{"key":"e_1_3_2_1_8_1","volume-title":"IEEE Vehicular Technology Conference '12","author":"Clausen T.","year":"2012","unstructured":"T. Clausen, J. Yi, A.C. de Verdiere, \"LOADng: Towards AODV Version 2,\" Proc. IEEE Vehicular Technology Conference '12, Sept. 2012."},{"key":"e_1_3_2_1_9_1","volume-title":"Protocol, Extension, and Applicability,\" Computer Networks","author":"Clausen T.","year":"2017","unstructured":"T. Clausen, J. Yi, and Ulrich Herber, \"Lightweight On-demand Ad hoc Distance-vector Routing - Next Generation (LOADng): Protocol, Extension, and Applicability,\" Computer Networks, 2017."},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. IEEE ICNP 2000","author":"Cobb J.A.","year":"2000","unstructured":"J.A. Cobb, \"Convergent Multi-Path Routing,\" Proc. IEEE ICNP 2000, Nov. 2000."},{"key":"e_1_3_2_1_11_1","author":"Cobb J.A.","year":"2002","unstructured":"J.A. Cobb and M.G. Gouda, \"Stabilization of General Loop-Free Routing,\" Journal of Parallel and Distributed Computing, 2002.","journal-title":"\"Stabilization of General Loop-Free Routing,\" Journal of Parallel and Distributed Computing"},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. SEA","author":"D'Angelo G.","year":"2012","unstructured":"G. D'Angelo et al., \"Engineering a New Loop-Free Shortest Path Routing Algorithm,\" Proc. SEA 12, Sep. 2012."},{"key":"e_1_3_2_1_13_1","volume-title":"Communications","author":"Gafni E.","year":"1981","unstructured":"E. Gafni and D. Bertsekas, \"Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topologies,\" IEEE Trans. Communications, Jan. 1981."},{"key":"e_1_3_2_1_14_1","author":"Garcia-Luna-Aceves J.J.","year":"1993","unstructured":"J.J. Garcia-Luna-Aceves, \"Loop-Free Routing Using Diffusing Computations,\" IEEE\/ACM Trans. Networking, 1993.","journal-title":"Trans. Networking"},{"key":"e_1_3_2_1_15_1","author":"Garcia-Luna-Aceves J.J.","year":"1995","unstructured":"J.J. Garcia-Luna-Aceves and J. Behrens, \"Distributed, Scalable Routing based on Vectors of Link States,\" IEEE JSAC, Oct. 1995.","journal-title":"\"Distributed, Scalable Routing based on Vectors of Link States,\" IEEE JSAC"},{"key":"e_1_3_2_1_16_1","volume-title":"IEEE ICNP '98","author":"Garcia-Luna-Aceves J. J.","year":"1998","unstructured":"J. J. Garcia-Luna-Aceves and M. Spohn, \"Scalable Link-State Internet Routing,\" Proc. IEEE ICNP '98, Oct. 1998."},{"key":"e_1_3_2_1_17_1","first-page":"1058","author":"Hedrick C.L.","year":"1988","unstructured":"C.L. Hedrick, \"Routing Information Protocol,\" RFC 1058, 1988.","journal-title":"RFC"},{"key":"e_1_3_2_1_18_1","author":"Humblet P.A.","year":"1991","unstructured":"P.A. Humblet, \"Another Adaptive Shortest-Path Algorithm,\" IEEE Trans. Communications, June 1991.","journal-title":"Trans. Communications"},{"key":"e_1_3_2_1_19_1","first-page":"2002","volume":"10589","author":"International Organization for Standardization","year":"2002","unstructured":"International Organization for Standardization, International Standard ISO\/IEC 10589:2002(E), 2002.","journal-title":"International Standard ISO\/IEC"},{"key":"e_1_3_2_1_20_1","volume-title":"July","author":"Jaffe J.M.","year":"1982","unstructured":"J.M. Jaffe and F.M. Moss, \"A Responsive Routing Algorithm for Computer Networks,\" IEEE Trans. on Communications, July 1982."},{"key":"e_1_3_2_1_21_1","volume-title":"Dynamic Source Routing in Ad Hoc Wireless Networks,\" Mobile Computing","author":"Johnson D. B.","year":"1996","unstructured":"D. B. Johnson and D. A. Maltz, \"Dynamic Source Routing in Ad Hoc Wireless Networks,\" Mobile Computing, Chapter 5, Kluwer Academic Publishers, 1996."},{"key":"e_1_3_2_1_22_1","volume-title":"Oct.","author":"Johnson D.","year":"2008","unstructured":"D. Johnson, N. Ntlatlapa, and C. Aichele, \"A Simple Pragmatic Approach to Mesh Routing Using BATMAN,\" Proc. IFIP Int'l Symposium on Wireless Communications and Information Technology in Developing Countries, Oct. 2008."},{"key":"e_1_3_2_1_23_1","first-page":"2453","author":"Malkin G.","year":"1998","unstructured":"G. Malkin, \"RIP Version 2,\" RFC 2453, 1998.","journal-title":"RFC"},{"key":"e_1_3_2_1_24_1","volume-title":"Communications","author":"McQuillan J. M.","year":"1980","unstructured":"J. M. McQuillan, I. Richer, and E. C. Rosen, \"The New Routing Algorithm for the ARPANET,\" IEEE Trans. Communications, 1980."},{"key":"e_1_3_2_1_25_1","author":"Merlin P.M.","year":"1979","unstructured":"P.M. Merlin and A.Segall, \"A Failsafe Distributed Routing Protocol,\" IEEE Trans. on Communications, Sept. 1979.","journal-title":"Trans. on Communications"},{"key":"e_1_3_2_1_26_1","first-page":"2328","author":"Moy J.","year":"1998","unstructured":"J. Moy, \"OSPF Version 2,\" RFC 2328, 1998.","journal-title":"RFC"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1997.631180"},{"key":"e_1_3_2_1_28_1","volume-title":"ACM SIGCOMM '94","author":"Perkins C. E.","year":"1994","unstructured":"C. E. Perkins and P. Bhagwat, \"Routing over Multihop Wireless Network of Mobile Computers,\" Proc. ACM SIGCOMM '94, 1994."},{"key":"e_1_3_2_1_29_1","author":"Ray S.","year":"2010","unstructured":"S. Ray, R. Guerin, K.-W. Kwong, and R. Sofia, \"Always Acyclic Distributed Path Computation,\" IEEE\/ACM Trans. on Networking, 2010.","journal-title":"\"Always Acyclic Distributed Path Computation,\" IEEE\/ACM Trans. on Networking"},{"key":"e_1_3_2_1_30_1","first-page":"1771","volume":"4","author":"Rekhter Y.","year":"1995","unstructured":"Y. Rekhter and T. Li, \"A Border Gateway Protocol 4 (BGP-4),\" RFC 1771, March 1995.","journal-title":"\"A Border Gateway Protocol"},{"key":"e_1_3_2_1_31_1","first-page":"7868","author":"Savage D.","year":"2016","unstructured":"D. Savage et al., \"Cisco's Enhanced Interior Gateway Routing Protocol (EIGRP),\" RFC 7868, 2016.","journal-title":"RFC"},{"key":"e_1_3_2_1_32_1","volume-title":"Communications","author":"Schwartz M.","year":"1980","unstructured":"M. Schwartz and T. Stern, \"Routing Techniques Used in Computer Communication Networks,\" IEEE Trans. Communications, Apr. 1980."},{"key":"e_1_3_2_1_33_1","author":"Segall A.","year":"1983","unstructured":"A. Segall, \"Distributed Network Protocols,\" IEEE Trans. on Information Theory, Jan. 1983.","journal-title":"Trans. on Information Theory"},{"key":"e_1_3_2_1_34_1","volume-title":"Proc. ACM MSWiM '13","author":"Van Glabbeek R.","year":"2013","unstructured":"R. Van Glabbeek et al., \"Sequence Numbers Do Not Guarantee Loop Freedom-AODV Can Yield Routing Loops,\" Proc. ACM MSWiM '13, Nov. 2013."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/316188.316227"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916780"},{"key":"e_1_3_2_1_37_1","volume-title":"IETF","author":"Winter T.","year":"2012","unstructured":"T. Winter, et al., \"RPL: IPv6 Routing Protocol for Low-Power and Lossy Networks,\" RFC 6550, IETF, March 2012."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/115992.115997"},{"key":"e_1_3_2_1_39_1","first-page":"881","volume":"5","author":"Zaumen W.T.","year":"1999","unstructured":"W.T. Zaumen and J.J. Garcia-Luna-Aceves, \"System for Maintaining Multiple Loop-Free Paths between Source Node and Destination Node in Computer Network\" U.S. Patent 5,881,243, March 9, 1999.","journal-title":"Patent"}],"event":{"name":"ANRW '24: Applied Networking Research Workshop","sponsor":["Internet Society Internet Society","SIGCOMM ACM Special Interest Group on Data Communication","IRTF Internet Research Task Force"],"location":"Vancouver AA Canada","acronym":"ANRW '24"},"container-title":["Proceedings of the Applied Networking Research Workshop on zzz"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3673422.3674891","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3673422.3674891","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T19:25:11Z","timestamp":1756236311000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3673422.3674891"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,20]]},"references-count":39,"alternative-id":["10.1145\/3673422.3674891","10.1145\/3673422"],"URL":"https:\/\/doi.org\/10.1145\/3673422.3674891","relation":{},"subject":[],"published":{"date-parts":[[2024,7,20]]},"assertion":[{"value":"2024-07-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}