Home>IEEE standards>IEEE Std 1910.1-2020 pdf free

IEEE Std 1910.1-2020 pdf free

IEEE Std 1910.1-2020 pdf free.IEEE Standard for Meshed Tree Bridging with Loop-Free Forwarding.
5. Mesh tree algorithm and the protocol
The MTA allows construction of logically meshed .uhtrees from a single root bridge in a distributed manner using local information shared among neighbor MTBs. The MTA is first described using a flowchart in Figure I. A root is preselected or designated. Preselection or designation does not impact the MTBP operation (see 7.2.4). Annex A provides formal deflnitions for meshed trees.
In MTBP, for the construction and maintenance of multiple subtrccs from a single root in a bridged network, virtual identifiers (VIDs) arc assigned to the communicating bridges. A single communicating non-root bridge can acquire multiple VIDs. The VID is henceforth called meshed tree VID (MT_VID). Each MT_VID derived in MTBP defines a non-looping path from the communicating bridge to the root bridge. This is true for all communicating bridges except the root bridge. The root bridge has a single MT_VID that shall be assigned to it, when it is predesignated to be the root bridge.
NOTE—For an implementation of MTIW, a root bridge is designated and assigned a VID.
6. Meshed tree algorithm
The MTA supports construction of multiple subirees from a single root, The flow chart for the MTA using a connected graph is given in Figure I. In this graph, a vertex is defined to be the root. The meshed tree construction starts with all vertices checking if they have the root status or not. The vertex that has this status sends out path invitations (P1) to its neighboring vcrticcs If a neighbor accepts the invitation, the root notes this neighbor as part of its meshed tree. Vertices that do not have the root status listen for Pis. When they receive a P1. they first perform a loop-check, and if the P1 does not result in loop formation with already accepted Pis, the vertex accepts the new P1. It then stores all PIs in a list and sorts them in order of hop count from the root. The extent of meshing among the subtrces can be restricted to i.e., a vertex can reside in a maximum of subtrees t’rom a root. After sorting its P1 list, a vertex checks if the length of the list is> Entries greater than are removed. A vertex that has Pis now offers Pls to its neighbors. The vertex also continues to listen to PIs in their neighborhood and update their P1 list. Thus, all vertices are a part of the multiple subtrees originating from the root.
To implement the PIs and allow each node in a bridged network to reside on multiple subirees and carry this information without conflict, the specified numbering scheme is used in the MTBP. This numbering scheme uses MT VIDs, which are used for creating the PIs. An MT_VID provides a path from a non-root bridge to the root bridge. The use of MT_V lDs in the protocol is explained next. Meshed tree construction from a designated root in a bridged network is covered in 7,3.
In this option. an administrator designates multiple root bridges and assigns them the role of primary root. secondary root, and tertiary root and so on. These root bridges shall be assigned unique MT VIDs such as ‘I’ for the primary root bridge. ‘2’ for the secondary root bridge, ‘3’ for tertiary root bridge, and so on. Meshed trees shall be constructed from each root and maintained in readiness as a failback in the event the primary root bridge fails or the primary and secondary root bridges fail. The sUpport for multiple root bridges and their meshed trees is covered by the mufti-rneshe1 tree algorühms (MMTA) and is discussed in .4.l5.
7.2.4 Designated root bridge
It is required that the bridge with best processing capacity be the root bridge. This is because the root bridge carries more traffic and has higher operational overhead than other bridges. It is common in algorithms used for root bridge elections, to set bridge priorities during the configuration of the bridges in the network, to bias the root election process such that the bridge with the best processing capacity gels elected as the root bridge. Biasing a bridge to win the root election and then proceeding with root election is redundarn. Hence, in MTBP a root bridge is designated and this avoids root election delays. In the event of failure of the root bridge, options discussed in 7.7.7 or 7.2.3 will handle the failure. These options provide faster recovery on root bridge failure than root bridge re-election.
rhen a bridge is designated to be a root bridge, it shall be assigned a unique MT_VID. The MT_VID for a root bridge shall be unique as there may be multiple root bridges as specified in 7.2. I and 72.2, The root bridge MT_VII) is the first value in the MT_VlDs associated with the multiple suhtrees originating from this root bridge. Because of the way in which MT_VIDs for non-root bridges are constructed, the MT_VID for the non-root bridges describe a path that connects the non-root bridge to the root bridge. In a physical meshed topology of bridges, a bridge can acquire more than one MT_VID. and thus it can reside on multiple subtrees and have multiple non-looping paths to the root bridge.
A meshed tree from a single root can prescribe all possible paths from the root bridge to each non-root bridge in the meshed topology. In a looped topology this will allow for more than one path from each non- root bridge to the root bridge to coexist. However, constructing meshed trees using all possible paths from non-root bridges to the root bridge is not optimal in terms of operational overhead. The number of subtrccs on which a non-root bridge resides can be optimized based on the desired redundancy and the probability of failures of bridges or links between bridges and acceptable failure recovery time.
To understand meshed trees and their construction in a bridged network, consider the 3-bridge single loop topology in Imgur 2. To prevent traffic from looping, any one of the three logical tree topologies shown by the arrows can be imposed. On the left, the topology is optimized for transmissions associated with bridges directly connected to the root. But in the middle and right, the topology is optimized for nodes connected to bridges B and A, respectively. By themselves, each of these three logical topologies do not provide redundancy and each one is inefficient for some traffic forwarding. MTIIP allows all three trees to be constructed and maintained to support redundancy in trees and tree paths.IEEE Std 1910.1 pdf download.

Related PowerPoint Templates

Template Categories