Professional Documents
Culture Documents
09/23
Presenter:
Fatemah Panahi
Outline
• Client-Server code
• Project overview
• Review from last session
• Spanning Tree Algorithm
Review
• Shared medium vs. Point to point links
• Ethernet as a shared medium link
• LAN is a Local Area Network, Usually based on
the Ethernet technology
• Ethernet limitation: Cable length, Host number
Extending LANs
• Repeaters: A device that forwards signals, just like
an amplifier
• Hub: A multi-way repeater; Usually used when
you cannot attach a host directly to a thin cable.
• No notion of frames
• Broadcast: Everybody can get the message that
someone sends.
Bridges = LAN switches
• Switch: multi-input, multi-output device which transfers
packets from an input to one or more outputs
• Using repeaters to extend a LAN has its own limits:
– Total number of repeaters
– Total length
• Alternative: Have a node between 2 Ethernet segments to
forward frames
– Isolates collision domains if used carefully
– Increases total bandwidth of the network
Learning Bridges
• It is inefficient to always broadcast message to all
Ethernet segments
• How do we know on which port a host is?
– Manual table
– Learning mechanism
• Learning:
– Inspect the source address of each frame
– Each table entry has a timeout
– Not sure what to do? Broadcast
Spanning Tree
CS 640 7
Each LAN segment can have many
bridges
• More complex topologies can provide redundancy.
– But can also create loops.
• E.g. What happens when there is no table entry?
– Multiple copies of data
Could crash the network has happened often!
Bridge Bridge
B5 1
• Each bridge finds shortest path to the
1 B7
root. 1 B2
– Remembers port that is on the shortest
path
– Used to forward packets
B1
• Select for each LAN a designated
bridge that will forward frames to root
– Has the shortest path to the root.
– Identifier as tie-breaker B6 1 1 B4
Spanning Tree Algorithm
• Each node sends configuration message to all neighbors.
– Identifier of the sender
– Id of the presumed root
– Distance to the presumed root
• 2 B3
Initially each bridge thinks it is the root.
– B5 sends (B5, B5, 0)
B5 1
• When B receive a message, it decide whether the 1 B7
solution is better than their local solution. 1 B2
– A root with a lower identifier?
– Same root but lower distance?
– Same root, distance but sender has lower identifier?
B6 1 1 B4