Performance Evaluation of Spanning Tree Protocol and Rapid Spanning Tree Protocol in Computer Networks |
Author(s): |
| Amit Kumar , GNDEC, BIDAR; Bhavana Bidarkar, GNDEC, BIDAR |
Keywords: |
| RSTP, MAC, MSTP, BPDU |
Abstract |
|
A computer network is a self-configuring network of hosts connected by links which together form a random topology. Spanning Tree protocol enabled switches go over a root election procedure grounded on Bridge Protocol Data Unit (BPDU). All supplementary switches then figure the shortest, lower cost path to the root switch and block ports that are not lengthwise these shortest paths, ensuing in a loop-free, tree-based topology. Deprived of a protocol such as Spanning Tree, Layer 2 bridged networks are vulnerable to broadcast/multicast and/or unidentified unicast storms. Rapid spanning tree protocol is extended version of original spanning tree protocol but little more features as compared to spanning tree. In this we have discussed the overall features of spanning tree and Rapid spanning tree protocol. |
Other Details |
|
Paper ID: IJSRDV7I60153 Published in: Volume : 7, Issue : 6 Publication Date: 01/09/2019 Page(s): 214-217 |
Article Preview |
|
|
|
|
