Difference between revisions of "STP Instances"
From NesevoWiki
Jump to navigationJump to search| Line 1: | Line 1: | ||
| − | + | First STP is the shortform of '''S'''panning- '''T'''ree '''P'''rotocol. | |
<br/><br/> | <br/><br/> | ||
'''Define:''' | '''Define:''' | ||
Where two bridges are used to interconnect the same two computer network segments, spanning tree is a protocol that allows the bridges to exchange information so that only one of them will handle a given message that is being sent between two computers within the network. The spanning tree protocol prevents the condition known as a bridge loop. | Where two bridges are used to interconnect the same two computer network segments, spanning tree is a protocol that allows the bridges to exchange information so that only one of them will handle a given message that is being sent between two computers within the network. The spanning tree protocol prevents the condition known as a bridge loop. | ||
Latest revision as of 12:02, 1 October 2008
First STP is the shortform of Spanning- Tree Protocol.
Define:
Where two bridges are used to interconnect the same two computer network segments, spanning tree is a protocol that allows the bridges to exchange information so that only one of them will handle a given message that is being sent between two computers within the network. The spanning tree protocol prevents the condition known as a bridge loop.
