{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:52:26Z","timestamp":1725587546672},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"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":[[2020,7]]},"DOI":"10.1109\/infocomwkshps50562.2020.9162745","type":"proceedings-article","created":{"date-parts":[[2020,8,10]],"date-time":"2020-08-10T21:55:09Z","timestamp":1597096509000},"page":"1284-1285","source":"Crossref","is-referenced-by-count":0,"title":["Demo Abstract: Loop Avoidance in Computer Networks Using a Meshed Tree Protocol"],"prefix":"10.1109","author":[{"given":"Peter","family":"Willis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nirmala","family":"Shenoy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hrishikesh B","family":"Acharya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/IEEESTD.2001.93287"},{"key":"ref3","first-page":"44","article-title":"An algorithm for distributed computation of a spanning tree in an extended Ian","author":"perlman","year":"0","journal-title":"Proceedings of the ninth symposium on Data communications  - SIGCOMM '85"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICCNC.2019.8685664"},{"year":"2011","author":"perlman","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/IEEESTD.2012.6231597"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.bjp.2013.12.037"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISWCS.2005.1547674"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/IEEESTD.2004.94569"},{"key":"ref9","first-page":"90","article-title":"Meshed tree protocol for faster convergence in switched networks","author":"sharma","year":"0","journal-title":"2014 IARIA International Conference on Networking and Services (ICNS)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/IEEESTD.2018.8457469"}],"event":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","start":{"date-parts":[[2020,7,6]]},"location":"Toronto, ON, Canada","end":{"date-parts":[[2020,7,9]]}},"container-title":["IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9146478\/9162584\/09162745.pdf?arnumber=9162745","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T21:58:09Z","timestamp":1656453489000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9162745\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/infocomwkshps50562.2020.9162745","relation":{},"subject":[],"published":{"date-parts":[[2020,7]]}}}