Performance of Meshed Tree Protocols for Loop Avoidance in Switched Networks Kuhu Sharma
Total Page:16
File Type:pdf, Size:1020Kb
Rochester Institute of Technology RIT Scholar Works Articles 2014 Performance of Meshed Tree Protocols for Loop Avoidance in Switched Networks Kuhu Sharma Bill Stackpole Daryl Johnson Nirmala Shenoy Bruce Hartpence Follow this and additional works at: http://scholarworks.rit.edu/article Recommended Citation Sharma, Kuhu; Stackpole, Bill; Johnson, Daryl; Shenoy, Nirmala; and Hartpence, Bruce, "Performance of Meshed Tree Protocols for Loop Avoidance in Switched Networks" (2014). The International Journal on Advances in Networks and Services, 7 (3&4), 228-239. Accessed from http://scholarworks.rit.edu/article/1806 This Article is brought to you for free and open access by RIT Scholar Works. It has been accepted for inclusion in Articles by an authorized administrator of RIT Scholar Works. For more information, please contact [email protected]. Performance of Meshed Tree Protocols for Loop Avoidance in Switched Networks Kuhu Sharma, Bill Stackpole, Daryl Johnson, Nirmala Shenoy and Bruce Hartpence College of Computing and Information Sciences Rochester Institute of Technology, Rochester, NY, USA [email protected], [email protected], [email protected], [email protected], [email protected] Abstract—Loop free frame forwarding in layer 2 switched through the root and a second is the root re-election on networks that use meshed topologies to provision for link and topology changes. Radia Perlman then proposed path redundancy is a continuing challenge. The challenge is Transparent Interconnection of Lots of Links (TRILL) on addressed through special protocols at layer 2 that build RBridges (router bridges) to overcome the disadvantages of logical trees over the physically meshed topologies, along which STA-based loop avoidance. This came at the cost of frames can be forwarded. The first such protocol was based on the spanning tree. The spanning tree protocol (STP) had high processing overhead and implementation complexity as convergence times subsequent to topology changes. Rapid STP TRILL used the Intermediate System to Intermediate and IETF RFC 5556 Transparent Interconnection of Lots of System (IS-IS) routing protocol at layer 2. The goal was to Links (TRILL) on Router Bridges (RBridges) were then use optimal paths for frame forwarding between pairs of developed to reduce the convergence times. RSTP continued to switches and also avoid root election. IS-IS is a link state use the spanning tree while TRILL adopted link state routing routing protocol that can operate independently of the to support a tree from every switch. TRILL introduces high network layer. The TRILL protocol was implemented above processing complexity into layer 2 networks. In this article a layer 2 and used special headers to encapsulate the TRILL new meshed tree algorithm (MTA) and a loop avoidance and IS-IS related link state routing messages. The bridges protocol based on the MTA, namely the meshed tree protocol (MTP) are discussed. The MTA allows constructing several were called RBridges as they implemented routing overlapping trees from a single root switch. This speeds up protocols. TRILL on RBridges is currently an Internet convergence to link failures. The MTP proposes a simple Engineering Task Force (IETF) draft [2]. Shortest Path numbering scheme to implement meshed trees – thus, the Bridging (SPB) was developed along similar lines by IEEE processing complexity is low. The specification for the MTP is 802.1aq, also adopting the IS-IS routing protocol at layer 2. currently an ongoing IEEE standard Project 1910.1. In this TRILL is considered as superior to RSTP due to the article the operational details of MTP are presented and its redundant links that are established. Shortest Path Bridging performance evaluated and compared with RSTP. (SPB) based loop avoidance primarily targets high switching speeds as required in service provider and Keywords- Loop Avoidance, Switched Networks, Meshed Trees Protocol, Link Failure and Recovery backbone provider networks. Thus, two versions of SPB have been specified, SPBV (SPB with VLAN Ids) and I. INTRODUCTION SPBM (SPB with MAC addresses) [3] for service provider Loop free forwarding is a continuing challenge in layer networks and backbone provider networks, respectively. 2 switched networks. The need for link and path redundancy The premise for the loop avoidance solutions discussed to provide a continuous communications path between pairs above is that a single logical tree from a root switch that of end switches in the event of switch or link failure requires operationally eliminates physical loops is necessary to a physical network topology that is meshed. However, the resolve the conflicting requirements of physical link physical loops in a mesh topology cause broadcast storms redundancy and loop free frame forwarding. Under this when forwarding broadcast frames. Hence, it is important to approach, in the event of link failure, the tree has to be have a logical tree topology overlaid on the physical meshed recomputed. While spanning tree is a single tree constructed topology to forward broadcast frames. The first such logical from a single elected root switch, the Dijkstra algorithm loop-free forwarding solution was based on the Spanning used in IS-IS based routing builds a tree from every switch. Tree. Radia Perlman [1] proposed the specifications of a The operation of IS-IS requires link state information in the protocol called the Spanning Tree protocol (STP) based on entire network to be disseminated to every switch so that the Spanning Tree Algorithm (STA). A spanning tree in a each switch can compute its own tree by running the switched network was constructed by logically blocking Dijkstra algorithm on the connectivity information that it some of the switch’s ports from forwarding frames. The collects and stores in a Link State database. On topology basic STP had high convergence times during topology changes, link state information must again be disseminated changes. Rapid Spanning Tree Protocol (RSTP) was to all switches and the Link State database should be stable developed to reduce the convergence times in the basic STP. for some time before the Dijsktra algorithm can be run. However, RSTP still retained some of the inefficiencies of During this period the frame forwarding information is spanning trees, one of which is forwarding all frames unstable. TRILL on RBridges uses a hop count to avoid looping of frames. In [4], a novel meshed tree algorithm (MTA) and the of the MTP also provides advantages over complex Link associated Meshed Tree Protocol (MTP) was introduced. Its State solutions. MT loop free forwarding at layer 2 is performance was evaluated and compared with RSTP. currently an IEEE project (1910.1) under the IEEE 1910 Unlike the trees discussed above the MTA allows working group [11] lead by the authors. The rest of the construction of multiple trees from a single root by using the paper is organized as follows. Section II discusses related multiple paths provisioned by the meshed topology. Loop- work in the context of STP and Link State based solutions free frame forwarding can happen using any one of the highlighting the comparable features of MT based solutions. multiple trees. The MTP based on the MTA allows for In Section III, operational details of the MTP are presented. creation and maintenance of multiple overlapping tree Section IV describes the optimized unicast frame branches from one root switch. The multiple branches mesh forwarding schema adopted in the MTP. Section V provides at the switches, and thus on the failure of a link (or branch) the link failure handling mechanism adopted in the MTP. the switch can fall back on another branch without waiting Section VI provides the simulation details and performance for re-computation of the tree. Frame forwarding can results. Section VII follows with conclusions. continue while the broken branch is pruned. This eliminates temporary inconsistent topologies and latencies resulting II. RELATED WORK from tree reconstruction. The premise of the MTP is to In this section, we discuss the two primary techniques leverage the multiplicity of connections in a meshed proposed for loop resolution in layer 2 switched networks. topology by constructing and maintaining several trees from The first of these is based on the Spanning Tree Protocols a single root concurrently [5-9]. Thus, the MTA addresses (STP and RSTP) and the second is based on Link State (LS) the convergence issues facing STA based protocols and also Routing namely the TRILL on RBridges. This article does avoids the complexity of IS-IS based loop avoidance not describe all the operational details as such information is solutions. In addition, there can be multiple root switches, publicly available [12-14]. where each root supports its own meshed trees. This extends A. Protocols Based on Spanning Tree Algorithm the MTA to Multi Meshed Trees (MMT), which can be used to introduce redundancy in the event of root failure. This Both the STP and RSTP are based on the STA. To feature of MTP is not covered in this article. avoid loops in the network while maintaining access to all The novel feature of the MTA is implemented through a the network segments, the bridges compute a spanning tree simple numbering scheme. Meshed Tree Virtual IDs after collectively electing a root bridge. For root election (MT_VIDs) are allocated to each switch in the network. The bridgeIDs are used. In (R)STP, each bridge first assumes MT_VID acquired by a switch defines a tree branch or that it is the root and announces its bridgeID. Upon logical frame-forwarding path from the root switch to that receiving the bridgeID, neighbors compare it with their switch. A switch can acquire multiple MT_VIDs based on bridgeID and allow the bridge with a lower bridgeID to the MT_VIDs advertised by its neighboring switches and continue as a root. The unique bridgeID is a combination of thus join multiple tree branches providing a switch with a bridge priority and the bridge’s medium access control several paths to the root switch.