{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T05:23:40Z","timestamp":1750397020730},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387883"},{"type":"electronic","value":"9783642387890"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38789-0_13","type":"book-chapter","created":{"date-parts":[[2013,5,2]],"date-time":"2013-05-02T17:40:19Z","timestamp":1367516419000},"page":"148-164","source":"Crossref","is-referenced-by-count":3,"title":["A Dependable Alternative to the Spanning Tree Protocol"],"prefix":"10.1007","author":[{"given":"Jo\u00e3o","family":"Lopes","sequence":"first","affiliation":[]},{"given":"Susana","family":"Sargento","sequence":"additional","affiliation":[]},{"given":"Andr\u00e9","family":"Z\u00faquete","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"IEEE Standard for Local and Metropolitan Area Networks: Bridges and Virtual Bridged Local Area Networks \u2013 Amendment 9: Shortest Path Bridging. P802.1aq\/Draft D4.6 (C\/LM) (March 2012)"},{"key":"13_CR2","unstructured":"IEEE Standard for Local and metropolitan area networks: Media Access Control (MAC) Bridges. IEEE Std 802.1D (June 2004)"},{"issue":"6","key":"13_CR3","first-page":"278","volume":"2","author":"S.M. Atif","year":"2011","unstructured":"Atif, S.M.: DRSTP: A Simple Technique for Preventing Count-to-Infinity in RSTP Controlled Switched Ethernet Networks. Int. Journal of Computer Networks\u00a02(6), 278\u2013296 (2011)","journal-title":"Int. Journal of Computer Networks"},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.5121\/ijcnc.2011.3102","volume":"3","author":"S.M. Atif","year":"2011","unstructured":"Atif, S.M.: RRSTP: A Spanning Tree Protocol for Obviating Count-to-Infinity from Switched Ethernet Networks. Int. Journal of Computer Networks\u00a03(1), 17\u201336 (2011)","journal-title":"Int. Journal of Computer Networks"},{"key":"13_CR5","unstructured":"Barnard, A.: Got paper? Beth Israel Deaconess copes with a massive computer crash (November 26, 2002)"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Callon, R.: Use of OSI IS-IS for routing in TCP\/IP and dual environments. RFC 1195 (December 1990)","DOI":"10.17487\/rfc1195"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Eastlake, D., Banerjee, A., Dutt, D., Perlman, R., Ghanwani, A.: Transparent Interconnection of Lots of Links (TRILL) Use of IS-IS. RFC 6326 (July 2011)","DOI":"10.17487\/rfc6326"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Elmeleegy, K., Cox, A.L., Ng, T.S.E.: On Count-to-Infinity Induced Forwarding Loops Ethernet Networks. In: Proc. of the 25th IEEE Int. Conf. on Computer Communications, INFOCOM 2006, pp. 1\u201313 (April 2006)","DOI":"10.1109\/INFOCOM.2006.229"},{"issue":"1","key":"13_CR9","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1109\/TNET.2008.920874","volume":"17","author":"K. Elmeleegy","year":"2009","unstructured":"Elmeleegy, K., Cox, A.L., Ng, T.S.E.: Understanding and Mitigating the Effects of Count to Infinity in Ethernet Networks. IEEE\/ACM Transactions on Networking\u00a017(1), 186\u2013199 (2009)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"13_CR10","unstructured":"Fedyk, D., Ashwood-Smith, P., Allan, D., Bragg, A., Unbehagen, P.: IS-IS Extensions Supporting IEEE 802.1aq Shortest Path Bridging. RFC 6329 (April 2012)"},{"key":"13_CR11","unstructured":"Lopes, J.P.P.O.: Self-Configurable Switches. Master\u2019s thesis, University of Aveiro, Aveiro, Portugal (July 2012)"},{"key":"13_CR12","unstructured":"Myers, A., Ng, T.S.E., Zhang, H.: Rethinking the Service Model: Scaling Ethernet to a Million Nodes. In: Third Works. on Hot Topics in Networks (HotNets-III), San Diego, CA, USA (November 2004)"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Perlman, R., Eastlake III, D., Dutt, D., Gai, S., Ghanwani, A.: Routing Bridges (RBridges): Base Protocol Specification. RFC 6325 (July 2011)","DOI":"10.17487\/rfc6325"},{"issue":"4","key":"13_CR14","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/318951.319004","volume":"15","author":"R. Perlman","year":"1985","unstructured":"Perlman, R.: An algorithm for distributed computation of a spanning tree in an extended LAN. SIGCOMM Computer Communication Review\u00a015(4), 44\u201353 (1985)","journal-title":"SIGCOMM Computer Communication Review"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Touch, J., Perlman, R.: Transparent Interconnection of Lots of Links (TRILL): Problem and Applicability Statement. RFC 5556 (May 2009)","DOI":"10.17487\/rfc5556"}],"container-title":["Lecture Notes in Computer Science","Dependable Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38789-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T19:22:28Z","timestamp":1557688948000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38789-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387883","9783642387890"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38789-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}