Revision as of 23:46, 21 August 2005 edit LimoWreck (talk \| contribs) Extended confirmed users 3,849 edits m fixed header levels ← Previous edit		Revision as of 17:31, 24 August 2005 edit undo Guy Harris (talk \| contribs) Extended confirmed users 80,063 edits m If you're using the third person singular neutral pronoun, it's wrong to assume its possessive has an apostrophe. :-) Next edit →
Line 3: ==Protocol operation== ~~It's~~Its structure corresponds to that of the [[spanning tree (mathematics)\|spanning tree]] in [[graph theory]]. Networks must have only one path to any destination active at any one point in time to avoid the same [[frame (telecommunications)\|frame]] arriving at the destination multiple times, causing dysfunction. The [[minimum spanning tree]] algorithm ensures that if multiple paths exist to the same destination then all but one will be blocked. Redundant networks can be built in this way, however the latency of spanning tree decisions must be taken into account as by default the maximum time for recalculations of the minimum spanning tree is 30 seconds. During this time no network traffic will be able to pass through ports involved in the recalculations.

Spanning Tree Protocol: Difference between revisions