This example shows the configuration of a root device with no vlans. In a small network with one or two switches, the spanning tree protocol stp. Pages in category spanning tree the following 35 pages are in this category, out of 35 total. Spanning tree protocol networks networking standards. Spanning tree protocol network switch network topology. In this example, we order the nodes in their numbered order, i. The loopbreaking algorithm now runs at the instance level instead of at the individual vlan level. Spanning tree protocol free download as powerpoint presentation. Spanning tree protocol is layer 2 protocol that defined by ieee 802. Pdf the stp spanning tree protocol which is standardized as ieee 802.
A port can never be both a designated port and a root port. The stp spanning tree protocol which is standardized as ieee 802. Spanningtree protocols user guide techlibrary juniper. Pvst, rapid spanning tree protocolrstp and multi spanning tree protocol mstp. In this study the correctness of stp algorithm is formally verified using extended rebeca. For example, the thickened edges shown in figure 4.
Spanningtree protocol is a link manage ment protocol that provides path redundancy while preventing undesirable. Pdf spanning tree protocol simulation based on software. In this paper we propose a formal specification of. Formal specification of spanning tree protocol using acp. Stp is a layer 2 link management protocol that provides path redundancy.
Pdf formal specification of spanning tree protocol using acp. This algorithm tries to eliminate loops in bridged networks. Verification of a typical example is discussed in section 4. Many routing protocols in wsn use a breadthfirst spanningtree algorithm to broadcast routing updates 7,44. An algorithm that runs in network bridges and switches to prevent loops, in which packets keep going around in circles. Ports on the root bridge are never placed in a blocking state. Spanning tree protocol stp determines the least cost path from the root bridge to other nodes in the networks. The spanning tree algorithm designates one switch as the root bridge, and uses it. Spanning tree protocol and the spanning tree algorithm.
1324 828 433 1354 147 178 1057 1464 181 824 520 1247 1309 205 1302 963 1241 998 90 1335 67 107 31 167 1644 966 932 1150 1478 1171 1326 407 186 15 383 507 425 282 982 1176 871 229 47 1195