You are on page 1of 8

Universitt Stuttgart

Institut fr Nachrichtenvermittlung und Datenverarbeitung


Prof. Dr.-Ing. Dr. h. c. mult. P. J. Khn

Communication Networks II
Exercise 1

Part 1

Ethernet

LAN-Interworking using Ethernet Repeaters and Bridges

Consider the LAN depicted in Figure 1. Three identical stations are connected to a
common bus.
Station C

Station A

Station B
Figure 1:

LAN with a common bus

The main characteristics of the network are the following:


Bus length: l = 1000 m
Propagation speed: c = 200 000 km/s
Mean frame length: L = 1000 bit
Transmission rate: r = 10 Mbps
First, the Ethernet MAC protocol CSMA/CD shall be considered.
Question 1

a) Why is the spatial extention of an Ethernet LAN segment limited?


b) Calculate an upper bound for the bus length l for a minimum frame
length Lmin = 64 octets.

Communication Networks II

Page 1

Exercise 1

Ethernet

A corporate network consists of several Ethernet segments, which are interconnected


by repeaters (see Figure 2).
Segment 3

A
Repeater 1

Repeater 2

Segment 1

Segment 2

Figure 2:
Question 2

LAN topology with repeaters

Name reasons why the repeaters might have been installed, as opposed to using only one (longer) segment.

In an alternative LAN structure one multiport bridge (or "Ethernet Layer-2 Switch")
interconnects all LAN segments, as shown in Figure 3.
Segment 3

Port identifier

B1
1

Segment 1

Figure 3:
Question 3

Segment 2

LAN topology with one multiport bridge B1

a) Explain why the Ethernet bridge splits the network into several independent CSMA/CD collision domains, but the repeaters did not.
What is the advantage of having several independent collision domains?
b) What is the advantage of an Interworking Unit (IWU) that knows the
topological location of the stations (e. g., the bridge), as opposed to
an IWU that does not (e. g., the repeaters)?
c) Draw the basic structure of an Ethernet frame (MAC-layer PDU).
d) Explain why the field "Source Address" in the Ethernet PDU is useful and how it is processed.

Communication Networks II

Page 2

Exercise 1

Ethernet

Part 2

Forwarding Loops and Spanning Tree Algorithm for Ethernet


Bridges

Consider the Ethernet LAN topology with multiport bridges depicted in Figure 4. For
now, assume that the dashed link and the corresponding bridge ports are not there.
They will be added later. Furthermore, assume that all systems have been powered
up just now, i. e., the forwarding data bases of all bridges are empty.
1

B2

3
2

B1
1

1
2
4

C
Figure 4:

B3

B4
3

LAN topology with bridges and one optional link

Station A sends an Ethernet frame destined to station D.


Question 4

Describe how the frame is transmitted through the network. For each
traversed bridge describe the actions performed by the bridge upon reception of the frame. Sketch the forwarding data bases of all four bridges.

Now, a direct link between bridges B1 and B4 is added (dashed line in Figure 4).
Assume that after installing the additional link all systems have been reset, i. e., the
forwarding data bases of all bridges are empty again. For now, assume that the
"Spanning Tree Algorithm" is not in use. Station A sends another Ethernet frame destined to station D.
Question 5

a) What is the fundamental difference of the new topology compared


to the old one, in terms of graph theory?
b) Describe how the frame is transmitted through the net. For each traversed bridge describe the actions performed by the bridge upon reception of the frame. Sketch the forwarding data bases of all four
bridges.

Communication Networks II

Page 3

Exercise 1

Ethernet

Now, the Spanning Tree Algorithm is used to solve this problem.


Question 6

Describe the behaviour of the Spanning Tree Algorithm in the given


LAN topology. Assume that bridge B1 has a bridge identifier of 1, B2 of
2, etc. (in reality, these are 48 bit identifiers assigned by the device
manufacturers, according to a scheme that ensures global uniqueness). Assume that each LAN has equal costs of 1. Sketch the resulting (logical) topology. For each bridge port give its state as the result
of the Spanning Tree Algorithm.

For bridge B3 all Ethernet cables are unplugged and reconnected in a different order,
i. e., the assignment of local port identifiers to the connected LAN segments changes
(see Figure 5).
1

B2

3
2

B1
1

Question 7

2
2
4

B4

C
Figure 5:

B3

LAN topology with permuted bridge ports

Describe the changes to the (logical) topology.

The link between bridges B2 and B3 is removed.


Question 8

Describe the changes to the (logical) topology.

Communication Networks II

Page 4

Communication Networks II

to output
ports ...

Therefore, the
bridge ... the
frame

Is destination
station known
in FDB?

is at port ...
( add to /
update FDB)

Therfore, the
bridge learns
that station ...

receives frame
on port ...

Bridge ...

Step

Exercise 1
Ethernet

Solution Sheets

(will be completed during the exercises)

Question 4

Question 5

Page 5

Exercise 1

Ethernet

Questions 6 .. 8
Port states: R = "Root Port", D = "Designated Port", B = "Blocked Port"
BPDU Format: (transmitting bridge ID, root bridge ID, root path cost)

Step ________

port 1: Bridge ID:

R Believed
D Root B.ID:
B R.P.Cost:

port 2:

port 2: Bridge ID:

R
D
B

R Believed
D Root B.ID:
B R.P.Cost:

port 3:

R
D
B

port 3:

port 1:

port 2:

port 2:

port 1: Bridge ID:

R Believed
D Root B.ID:
B R.P.Cost:
port 3:

port 4:

port 4: Bridge ID:

R
D
B

R Believed
D Root B.ID:
B R.P.Cost:

port 1:

port 3:

R
D
B
D

Step ________

port 1: Bridge ID:

R Believed
D Root B.ID:
B R.P.Cost:

port 2:

port 2: Bridge ID:

R
D
B

R Believed
D Root B.ID:
B R.P.Cost:

port 3:

R
D
B

port 3:

port 1:

port 2:

port 2:

port 1: Bridge ID:

R Believed
D Root B.ID:
B R.P.Cost:
port 3:

R
C

Communication Networks II

port 4:

port 4: Bridge ID:

R
D
B

R Believed
D Root B.ID:
B R.P.Cost:

port 1:

port 3:

R
D
B
D

Page 6

Exercise 1

Ethernet

Port states: R = "Root Port", D = "Designated Port", B = "Blocked Port"


BPDU Format: (transmitting bridge ID, root bridge ID, root path cost)

Step ________

port 1: Bridge ID:

R Believed
D Root B.ID:
B R.P.Cost:

port 2:

port 2: Bridge ID:

R
D
B

R Believed
D Root B.ID:
B R.P.Cost:

port 3:

R
D
B

port 3:

port 1:

port 2:

port 2:

port 1: Bridge ID:

R Believed
D Root B.ID:
B R.P.Cost:
port 3:

port 4:

port 4: Bridge ID:

R
D
B

R Believed
D Root B.ID:
B R.P.Cost:

port 1:

port 3:

R
D
B
D

Step ________

port 1: Bridge ID:

R Believed
D Root B.ID:
B R.P.Cost:

port 2:

port 2: Bridge ID:

R
D
B

R Believed
D Root B.ID:
B R.P.Cost:

port 3:

R
D
B

port 3:

port 1:

port 2:

port 2:

port 1: Bridge ID:

R Believed
D Root B.ID:
B R.P.Cost:
port 3:

R
C

Communication Networks II

port 4:

port 4: Bridge ID:

R
D
B

R Believed
D Root B.ID:
B R.P.Cost:

port 1:

port 3:

R
D
B
D

Page 7

Exercise 1

Ethernet

Port states: R = "Root Port", D = "Designated Port", B = "Blocked Port"


BPDU Format: (transmitting bridge ID, root bridge ID, root path cost)

Step ________

port 1: Bridge ID:

R Believed
D Root B.ID:
B R.P.Cost:

port 2:

port 2: Bridge ID:

R
D
B

R Believed
D Root B.ID:
B R.P.Cost:

port 3:

R
D
B

port 3:

port 1:

port 2:

port 2:

port 1: Bridge ID:

R Believed
D Root B.ID:
B R.P.Cost:
port 3:

port 4:

port 4: Bridge ID:

R
D
B

R Believed
D Root B.ID:
B R.P.Cost:

port 1:

port 3:

R
D
B
D

Step ________

port 1: Bridge ID:

R Believed
D Root B.ID:
B R.P.Cost:

port 2:

port 2: Bridge ID:

R
D
B

R Believed
D Root B.ID:
B R.P.Cost:

port 3:

R
D
B

port 3:

port 1:

port 2:

port 2:

port 1: Bridge ID:

R Believed
D Root B.ID:
B R.P.Cost:
port 3:

R
C

Communication Networks II

port 4:

port 4: Bridge ID:

R
D
B

R Believed
D Root B.ID:
B R.P.Cost:

port 1:

port 3:

R
D
B
D

Page 8

You might also like