{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T05:23:56Z","timestamp":1750397036605,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1109\/lcn.2018.8638130","type":"proceedings-article","created":{"date-parts":[[2019,2,12]],"date-time":"2019-02-12T01:55:48Z","timestamp":1549936548000},"page":"409-412","source":"Crossref","is-referenced-by-count":5,"title":["Iterative Discovery of Multiple Disjoint Paths in Switched Networks with Multicast Frames"],"prefix":"10.1109","author":[{"given":"Diego","family":"Lopez-Pajares","sequence":"first","affiliation":[]},{"given":"Joaquin","family":"Alvarez-Horcajo","sequence":"additional","affiliation":[]},{"given":"Elisa","family":"Rojas","sequence":"additional","affiliation":[]},{"given":"Juan A.","family":"Carral","sequence":"additional","affiliation":[]},{"given":"Guillermo","family":"Ibanez","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/dac.612"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1994.337532"},{"key":"ref12","article-title":"Brite: Universal topology generation from a user’s perspective","author":"medina","year":"2001","journal-title":"Boston University Computer Science Department Tech Rep"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230040204"},{"key":"ref14","first-page":"1984","volume":"6","author":"suurballe","year":"0","journal-title":"A Method for Finding Shortest Pairs of Disjoint Paths"},{"first-page":"1","article-title":"Analysis of an Equal-Cost Multi-Path Algorithm RFC 2992","year":"2000","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24653-4_17"},{"article-title":"Multipath discovery in switched ethernet networks","year":"2012","author":"minkenberg","key":"ref17"},{"key":"ref4","first-page":"19","article-title":"Hedera: Dynamic Flow Scheduling for Data Center Networks","author":"al-fares","year":"2010","journal-title":"NSDI"},{"key":"ref3","first-page":"2","article-title":"Introduction to TRILL","volume":"14","author":"perlman","year":"2011","journal-title":"The Internet Protocol Journal"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2015.01.002"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01202792"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1594977.1592604"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(83)80012-2"},{"journal-title":"802 1aq - Shortest Path Bridging","year":"2006","key":"ref2"},{"key":"ref1","first-page":"1109","article-title":"Carrier sense aware multipath geographic routing protocol","volume":"16","author":"ismail","year":"0","journal-title":"Wireless Communications and Mobile Computing"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1921168.1921188"}],"event":{"name":"2018 IEEE 43rd Conference on Local Computer Networks (LCN)","start":{"date-parts":[[2018,10,1]]},"location":"Chicago, IL, USA","end":{"date-parts":[[2018,10,4]]}},"container-title":["2018 IEEE 43rd Conference on Local Computer Networks (LCN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8635823\/8638025\/08638130.pdf?arnumber=8638130","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T08:01:47Z","timestamp":1643270507000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8638130\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/lcn.2018.8638130","relation":{},"subject":[],"published":{"date-parts":[[2018,10]]}}}