0% found this document useful (0 votes)
9 views

STP Report

Uploaded by

kimia
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
9 views

STP Report

Uploaded by

kimia
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

August / 2024

Report by: Kimia Omrani

Spanning Tree
Protocol
How to prevent Loops in Ethernet networks

What Are Loops? ROAD MAP

A network loop happens when there are multiple active


paths between two or more network devices; In Ethernet
DEFENITION OF LOOPS
networks, this can cause frames to be forwarded
Different circumstances for forming,
indefinitely in a circular fashion, leading to several Types and reasons
problems.
HOW TO PREVENT
1. Bro ad cas t S tor ms : Bro ad cas t f ra m es wi ll b e r e p li cat ed b y
s wi tch ed in loop an d ca u s e ex c es s iv e t ra ff ic an d con s u m e h u g e Some solutions for avoiding harmful
amo u n t o f b an d wid th . loops

2. Mu lt ip l e Fr a me C op i es : D u p l ica te d F ra m es L ea d to d a ta STP PROTOCOL


in co n s is t en ce an d er ro r in ap p li cat ion ( wh i ch ex p ec t ed s in gl e
d el iv ery ). Definition, Math bases, different
types and Pros-cons
3. MA C Ad d r es s Ta b l e In s tab il ity : s wi tch b ri d g e tab l e wi ll
con s ta n tly u p d at e wh ich cau s e i n co rr e ct for w ar d in g d e cis ion s .
Why Loops Form / How Deep About STP-
to Prevent? Pros and Cons
If by purpose, Loops form mainly due to the
redundancy built into network designs to provide
fault tolerance and reliability but it can be a
conclusion of Misco nfiguration, L ack of Loop
preventio n mechanism or Human error.

A primary feature LAN switches is loop prev ention,


as implemented by Spanning Tree Protocol. Without
STP, any flooded fram e would loop for an indefinite The result is good! Frames do not
period of time in Ethernet Networks. loop and LAN is usable. However,
STP has negative features as well ,
This can be useful with creating a loop -free including the fact that it takes
logical topology as followed: some work to balance traffic across
the redundant alternate links.
1. Root B rid g e E l e cti on : Dis s o lv e h eav y s wi tch in g tr af f ic .
A simple example for STP is for
2.P ath Cos t C al cu la tio n : Pr e fe rr in g p ath to r ea c h root unknown unicast /broadcast frames
b rid ge .
if the destination is turned off.
3. Po rt Rol es an d Stat es : As s ign ro le to ea ch p or t (r oot, Having the links that are redundant
d es i gn at ed , b l ock ed ) without STP cause frame to loop
forever between switches because
4. Con v er g en ce : Tr an s it i on th r ou gh s tat es t o en s u re
s tab l e l oop - fr e e to p ol og y
none has destination MAC address
in their table.

STP causes each interface on a


switch to settle into either a
blocking state or a forwarding
state. Blocking means that the
interface cannot forward or receive
data frames, while forwarding
means that the interface can send
and receive data frames. If a
correct subset of the interfaces is
blocked, only a single currently
active logical path exists between
each pair of LANs.

Spanning Tree The Phrase Spanning-Tree itself has a mathematical concept. It is s a connected graph using all vertices in which
there are no circuits. In other words, there is a path from any vertex to any other vertex, but no circuits.
Graph
Radia Perlman invented the Spanning Tree Protocol (STP) in 1984 while working at Digital Equipment Corporation.
By David Lippman

You might also like