COMMUNICATION NETWORKS

NETW 501
TUTORIAL 5

Presented by:
Eng. Hana Hesham
Eng. Mohamed Atef
LAN Extension
 For Multiple Users to be connected within the same Network they
may suffer from some problems such as:
1) Extension range problems: When some users are connected to
other users which are far away.
2) Traffic problems: These problems can arise from one of two
reasons:
a) Many users exist in the same LAN
b) The traffic generated per user increases
Mainly LANs use Random Access MAC protocols (ALOHA – CSMA,
…etc.)
These protocols can handle a maximum level of traffic and then it
saturates and the performance can degrade dramatically
LAN Extension
LAN Extension
 Solution LAN Extension

Large Distance
Station A Station B (Problem) Station C Station D

Hub
(Repeater)

Station A Station B Station C Station D

 LAN Extension
 Solution LAN Extension

Station A Station B Station C Station D Station E Station F

High Traffic Load, Thus lots of collisions and low efficiency
(Problem)

Bridge
(Switch)

Station A Station B Station C Station D Station E Station F

Interconnecting LANs

There are several ways of interconnecting Networks:

1) When two or more networks are interconnected in the

physical layer, the device is called (Repeater - Hub)
(solving distance extension problem)

2) When two or more networks are interconnected in the Data

Link layer, the device is called (Bridge - Switch)
(solving the traffic and collision problems)

3) When two or more networks are interconnected in the

Network layer, the device is called (Router)
(solving higher scalability problems with higher efficiency and
lower delays)
 Collision Domains

Station A Station B Station C Station D Station E Station F

Number of Collision Domains = 1

Hub
(Repater)

Station A Station B Station C Station D Station E Station F

Number of Collision Domains = 1
 Collision Domains

Bridge

Station A Station B Station C Station D Station E Station F

Number of Collision Domains = 2

Bridge
(Switch)

Station A Station B Station E Station F

Station C Station D
Number of Collision Domains = 3
Sheet 7 Problem 1
 Suppose N stations are connected to an extended Ethernet LAN, as shown
below operating at rate of 10 Mbps. Given that the efficiency of the
network is about 80% and the required transmission rate of each station is
Rs =100 Kbps. Find the maximum number if stations N.
 Repeat if a hub is used instead of bridge.
Sheet 7 Problem 1
Sheet 7 Problem 1

Hub
Transparent Bridges
There are two main types of Bridges:

1) Transparent bridges 2) Source routing bridges (out of scope)

• The term transparent refers to the fact that the stations are
completely unaware of the presence of the bridge in the network.
Thus introducing the bridge to the network doesn’t require the
stations to be configured.

• Transparent Bridges has 3 basic functions:

 Learns where the stations are attached (Bridge Learning)

 Controls the forwards of frames from one LAN to another
(Filtering)
 Prevents loops in the topology (Spanning Tree Algorithm)
Bridge Learning: Sheet 7 Problem 2
 Six stations (S1-S6) are connected to an extended LAN through
transparent bridges (B1 and B2), as shown in the figure below.
Initially, the forwarding tables are empty.
Bridge Learning: Sheet 7 Problem 2
Bridge Learning: Sheet 7 Problem 2
1) S2 to S1

B1 B2
Station Port Station Port
S2 1 S2 2
Bridge Learning: Sheet 7 Problem 2
2) S5 to S4

B1 B2
Station Port Station Port
S2 1 S2 2
S5 2 S5 1
Bridge Learning: Sheet 7 Problem 2
3) S3 to S5

B1 B2
Station Port Station Port
S2 1 S2 2
S5 2 S5 1
S3 2 S3 2
Bridge Learning: Sheet 7 Problem 2
4) S1 to S2

B1 B2
Station Port Station Port
S2 1 S2 2
S5 2 S5 1
S3 2 S3 2
S1 1
Bridge Learning: Sheet 7 Problem 2
5) S4 to S3

B1 B2
Station Port Station Port
S2 1 S2 2
S5 2 S5 1
S3 2 S3 2
S1 1 S4 2
S4 3
Bridge Learning: Sheet 7 Problem 2
6) S6 to S5

B1 B2
Station Port Station Port
S2 1 S2 2
S5 2 S5 1
S3 2 S3 2
S1 1 S4 2
S4 3 S6 1
Bridge Learning: Sheet 7 Problem 2
Bridge Learning: Sheet 7 Problem 2
ii) S1 to S2

B1
Station Port B2
S2 1 Station Port
S5 2 S2 2
S3 2 S5 1
S1 1 Delete This S3 2
S4 3 S4 2
S1 3 S6 1
Bridge Loops and solution: Spanning
Tree
 Spanning Tree Algorithm Steps
1) Choose Root Bridge:
bridge with the lowest bridge ID
2) Choose Root Ports:
The other bridges ports with the least cost path (Least number of
LANs) to the root bridge. If more than one have the same cost,
select the minimum port number.
3) Choose Designated Bridge:
For each LAN, it’s the bridge that offers minimum cost (Least
number of LANs) to the root bridge. If the same, select the
minimum bridge ID. Designated ports connects the designated
bridge to LANs
For no looping, remove links that are not with Root or Destined ports !
Sheet 7 Problem 3 (Spanning Tree)
 Generate the spanning tree to avoid looping in the following network,
given that the cost is the number of LAN’s in the path to the root
bridge.
Step 1: Choose the root bridge
LAN 1

(1)
B5 (1)
(2) (3)
LAN 2
B4
(1)
(3) (2)
B3
(2)
LAN 3
(2)
(1)
B2 Root
B1
Bridge
(1) (2)
LAN 4
Step 2: Choose the root ports
LAN 1

(1) R
B5 (1)
(2) (3)
LAN 2
B4
(1)
(3) (2)
B3
R
R (2)
LAN 3
(2)
(1)
B2 Root
B1
Bridge
(1) R (2)
LAN 4
Step 3: Choose the Designated bridges

LAN 1

(1) R
B5 (1)
(2) (3)
LAN 2
B4
(1)
(3) (2)
B3
R
R (2)
LAN 3
(2)
(1)
B2 Root
B1
Bridge
(1) R (2)
LAN 4
Step 4: Assign the Designated ports
LAN 1

(1) R
B5 (1)
(2) (3)
LAN 2
B4
(1)
(3) D (2)
B3
R
R (2)
LAN 3
D
(2)
D (1)
B2 Root
B1
Bridge
(1) R (2)
D LAN 4
Step 5: Remove the unused links
LAN 1

(1) R
B5 (1)
(2) (3)
LAN 2
B4
(1)
(3) D (2)
B3
R
R (2)
LAN 3
D
(2)
D (1)
B2 Root
B1
Bridge
(1) R (2)
D LAN 4
Step 6: Remove Useless Bridges
LAN 1

(1) R
B5
LAN 2
B4
(3) D (2)
B3
R
R (2)
LAN 3
D
(2)
D (1)
B2 Root
B1
Bridge
(1) R (2)
D LAN 4
Step 7: Redraw the Network
LAN 1

LAN 2
D (3)
B3
R (2)
LAN 3
D
(2)
D (1)
B2 Root
B1
Bridge
(1) R (2)
D LAN 4