{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T05:28:14Z","timestamp":1738128494642,"version":"3.33.0"},"reference-count":45,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T00:00:00Z","timestamp":1732233600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T00:00:00Z","timestamp":1732233600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,11,22]]},"DOI":"10.1109\/ipccc59868.2024.10850473","type":"proceedings-article","created":{"date-parts":[[2025,1,27]],"date-time":"2025-01-27T18:37:48Z","timestamp":1738003068000},"page":"1-10","source":"Crossref","is-referenced-by-count":0,"title":["Spreading Computations for Loop-Free Multipath Routing in Computer Networks"],"prefix":"10.1109","author":[{"given":"J.J.","family":"Garcia-Luna-Aceves","sequence":"first","affiliation":[{"name":"University of Toronto,Department of Electrical and Computer Engineering"}]},{"given":"Morteza","family":"Moghaddassian","sequence":"additional","affiliation":[{"name":"University of Toronto,Department of Electrical and Computer Engineering"}]},{"given":"Charles","family":"Hsieh","sequence":"additional","affiliation":[{"name":"University of Toronto,Department of Electrical and Computer Engineering"}]}],"member":"263","reference":[{"article-title":"EIGRP\u2013A Fast Routing Protocol based on Distance Vectors","volume-title":"Proc. Interop \u201894","author":"Albrightson","key":"ref1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.876179"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.665092"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/581771.581775"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/75247.75269"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.17487\/RFC8966"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13193-6_6"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9623-9"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.17487\/rfc3626","article-title":"Optimized Link State Routing Protocol (OLSR)","volume-title":"RFC 3626, IETF","author":"Clausen"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/WiMOB.2011.6085374"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2017.06.025"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2000.896311"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30850-5_12"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1981.1094876"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/90.222913"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/49.464710"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/90.554729"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.1998.723725"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/FNWF55208.2022.00112"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.17487\/rfc1058"},{"journal-title":"International Standard ISO\/IEC 10589:2002(E)","year":"2002","key":"ref21"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1982.1095632"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-585-29603-6_5"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-73117-9_24"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1544012.1544080"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.17487\/rfc2453"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1980.1094721"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1979.1094552"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.17487\/rfc2328"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-19195-9_7"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN.1999.805497"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1997.631180"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-585-29603-6_6"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/MCSA.1999.749281"},{"article-title":"A New Responsive Distributed Shortest-Path Routing Algorithm","volume-title":"Proc. ACM SIGCOMM \u201889","author":"Rajagopalan","key":"ref35"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2025374"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.17487\/RFC1771"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.17487\/rfc7868"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/2535372.2535374"},{"article-title":"Sequence Numbers Do Not Guarantee Loop Freedom-AODV Can Yield Routing Loops","volume-title":"Proc. ACM MSWiM \u201813","author":"Van Glabbeek","key":"ref40"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.21236\/ADA461850"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916780"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.17487\/rfc6550"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/115994.115997"},{"key":"ref45","article-title":"System for Maintaining Multiple Loop-Free Paths between Source Node and Destination Node in Computer Network","volume-title":"U.S. Patent","author":"Zaumen","year":"1999"}],"event":{"name":"2024 IEEE International Performance, Computing, and Communications Conference (IPCCC)","start":{"date-parts":[[2024,11,22]]},"location":"Orlando, FL, USA","end":{"date-parts":[[2024,11,24]]}},"container-title":["2024 IEEE International Performance, Computing, and Communications Conference (IPCCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10849998\/10850006\/10850473.pdf?arnumber=10850473","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,28]],"date-time":"2025-01-28T06:30:38Z","timestamp":1738045838000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10850473\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,22]]},"references-count":45,"URL":"https:\/\/doi.org\/10.1109\/ipccc59868.2024.10850473","relation":{},"subject":[],"published":{"date-parts":[[2024,11,22]]}}}