{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T21:10:02Z","timestamp":1725397802637},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1109\/hpsr.2012.6260854","type":"proceedings-article","created":{"date-parts":[[2012,8,8]],"date-time":"2012-08-08T13:10:31Z","timestamp":1344431431000},"page":"223-228","source":"Crossref","is-referenced-by-count":2,"title":["RSTP-SP: Shortest path extensions to RSTP"],"prefix":"10.1109","author":[{"given":"Eduard","family":"Bonada","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dolors","family":"Sala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"15","DOI":"10.1109\/ACCESSNETS.2007.4447112"},{"key":"16","article-title":"All pairs shortest paths performance measurements","author":"chiabaut","year":"2008","journal-title":"IEEE 802 1 Documents"},{"key":"13","article-title":"On the theoretical bounds of the Spanning Tree Algorithm","author":"bonada","year":"2008","journal-title":"Proceedings of Jornadas Telecom I+D Bilbao"},{"key":"14","article-title":"RSTP-Conf: Efficiently avoiding count-toinfinity in RSTP","author":"bonada","year":"2012","journal-title":"preparation"},{"year":"0","key":"11"},{"key":"12","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/318951.319004","article-title":"An algorithm for distributed computation of a spanning tree in an extended LAN","author":"perlman","year":"1985","journal-title":"ACM SIGCOMM CCR"},{"year":"0","key":"3"},{"year":"2000","author":"perlman","journal-title":"Interconnections Bridges Routers Switches and Internetworking Protocols","key":"2"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1109\/MCOM.2004.1273777"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1109\/HPSR.2011.5986000"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1109\/LCN.2007.88"},{"year":"0","key":"6"},{"key":"5","article-title":"Characterizing the convergence time of RSTP","author":"bonada","year":"2012","journal-title":"Proceedings of MIC-CSP 2012"},{"year":"0","key":"4"},{"doi-asserted-by":"publisher","key":"9","DOI":"10.1109\/LCN.2004.15"},{"doi-asserted-by":"publisher","key":"8","DOI":"10.1109\/INFCOM.2004.1354651"}],"event":{"name":"2012 IEEE 13th International Conference on High Performance Switching and Routing (HPSR)","start":{"date-parts":[[2012,6,24]]},"location":"Belgrade, Serbia","end":{"date-parts":[[2012,6,27]]}},"container-title":["2012 IEEE 13th International Conference on High Performance Switching and Routing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6249799\/6260814\/06260854.pdf?arnumber=6260854","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T18:37:09Z","timestamp":1497983829000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6260854\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/hpsr.2012.6260854","relation":{},"subject":[],"published":{"date-parts":[[2012,6]]}}}