Abstract
The Spanning Tree Protocol (STP) is known to have stability problems and poor convergence intervals. Several protocols and variants exist targeting the replacement of STP variants, most of them proprietary and with limited scope of operation. The recent protocols, IETF TRILL and IEEE SPB, target mainly data center networks, are based on complex concepts, require great processing power from switches and huge investment in new gear.
In this paper we propose Self-Configurable Switches Protocol (SCS) as an alternative to all these protocols. It has the following advantages: it is configuration-free, thus less vulnerable to human mistakes; it enhances the network stability and performance when comparing with STP; and it is suitable to the range of equipment and networks that typically run STP variants, minimizing the need for potential large investments required by TRILL and SPB. This paper describes the main characteristics, processes and mechanisms of SCS, presents some lab and simulation experiments with STP and SCS, and provides demonstrations that SCS provides a more reliable service than STP variants, and a more cost effective alternative to TRILL and SPB network dependability.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
IEEE Standard for Local and Metropolitan Area Networks: Bridges and Virtual Bridged Local Area Networks – Amendment 9: Shortest Path Bridging. P802.1aq/Draft D4.6 (C/LM) (March 2012)
IEEE Standard for Local and metropolitan area networks: Media Access Control (MAC) Bridges. IEEE Std 802.1D (June 2004)
Atif, S.M.: DRSTP: A Simple Technique for Preventing Count-to-Infinity in RSTP Controlled Switched Ethernet Networks. Int. Journal of Computer Networks 2(6), 278–296 (2011)
Atif, S.M.: RRSTP: A Spanning Tree Protocol for Obviating Count-to-Infinity from Switched Ethernet Networks. Int. Journal of Computer Networks 3(1), 17–36 (2011)
Barnard, A.: Got paper? Beth Israel Deaconess copes with a massive computer crash (November 26, 2002)
Callon, R.: Use of OSI IS-IS for routing in TCP/IP and dual environments. RFC 1195 (December 1990)
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)
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–13 (April 2006)
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 17(1), 186–199 (2009)
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)
Lopes, J.P.P.O.: Self-Configurable Switches. Master’s thesis, University of Aveiro, Aveiro, Portugal (July 2012)
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)
Perlman, R., Eastlake III, D., Dutt, D., Gai, S., Ghanwani, A.: Routing Bridges (RBridges): Base Protocol Specification. RFC 6325 (July 2011)
Perlman, R.: An algorithm for distributed computation of a spanning tree in an extended LAN. SIGCOMM Computer Communication Review 15(4), 44–53 (1985)
Touch, J., Perlman, R.: Transparent Interconnection of Lots of Links (TRILL): Problem and Applicability Statement. RFC 5556 (May 2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lopes, J., Sargento, S., Zúquete, A. (2013). A Dependable Alternative to the Spanning Tree Protocol. In: Vieira, M., Cunha, J.C. (eds) Dependable Computing. EWDC 2013. Lecture Notes in Computer Science, vol 7869. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38789-0_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-38789-0_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38788-3
Online ISBN: 978-3-642-38789-0
eBook Packages: Computer ScienceComputer Science (R0)