You are on page 1of 48

Tutorial for Chapter 4

CEN 444 – Computer Networks

Dr. Mostafa Dahshan


Department of Computer Engineering
College of Computer and Information Sciences
King Saud University
mdahshan@ksu.edu.sa

Last update: 30/12/2015


Tutorial for Chapter 4 Problem 1

Problem 1
Frames arrive randomly at a 100-Mbps channel for transmission. If the channel is
busy when a frame arrives, it waits its turn in a queue. Frame length is exponentially
distributed with a mean of 10,000 bits/frame. For each of the following frame arrival
rates, give the delay experienced by the average frame, including both queueing time
and transmission time.

(a) 90 frames/sec.
(b) 900 frames/sec.
(c) 9000 frames/sec.

M. Dahshan CEN444 – Computer Networks Page 2 of 48


Tutorial for Chapter 4 Problem 1

Solution
The delay is calculated using the formula: 𝑇 = 1/(𝜇𝐶 − 𝜆).

Data rate 𝐶 = 100 × 106 = 108 bits/sec.


1 1
Mean frame length = 10000 bits/frame. Thus 𝜇 = = 10−4 frames/bit.
𝜇 10000

Mean service rate 𝜇𝐶 = 10−4 frames/bit × 108 bits/sec = 10000 frames/sec


1 1
(a) Arrival rate 𝜆 = 90 frames/sec. 𝑇 = = = 0.0001009 ≈ 0.1 msec
𝜇𝐶−𝜆 10000−90

1 1
(b) Arrival rate 𝜆 = 900 frames/sec. 𝑇 = = = 0.000109 ≈ 0.11 msec
𝜇𝐶−𝜆 10000−900

1 1
(c) Arrival rate 𝜆 = 9000 frames/sec. 𝑇 = = = 0.001 = 1 msec
𝜇𝐶−𝜆 10000−9000

M. Dahshan CEN444 – Computer Networks Page 3 of 48


Tutorial for Chapter 4 Problem 2

Problem 2
A group of 𝑁 stations share a 56-kbps pure ALOHA channel. Each station outputs a
1000-bit frame on average once every 100 sec, even if the previous one has not yet
been sent (e.g., the stations can buffer outgoing frames). What is the maximum value
of 𝑁?

M. Dahshan CEN444 – Computer Networks Page 4 of 48


Tutorial for Chapter 4 Problem 2

Solution
In pure ALOHA, the maximum throughput is 0.184.

Maximum usable bandwidth = 0.184 × 56000 bits/sec = 10300 bits/sec.


1000 bits
Each station requires = 10 bits/sec.
100 sec

10300
So, 𝑁 = = 1030 stations.
10

M. Dahshan CEN444 – Computer Networks Page 5 of 48


Tutorial for Chapter 4 Problem 3

Problem 3
A large population of ALOHA users manages to generate 50 requests/sec, including
both originals and retransmissions. Time is slotted in units of 40 msec.

(a) What is the chance of success on the first attempt?

(b) What is the probability of exactly 5 collisions and then a success?

(c) What is the expected number of transmission attempts needed?

M. Dahshan CEN444 – Computer Networks Page 6 of 48


Tutorial for Chapter 4 Problem 3

Solution
(a) 𝐺 = number of transmission + retransmissions per frame (slot) time
1
Slot time = 40 msec = 0.04 sec/slot. Number of slots per sec = = 25 slots/sec.
0.04

50 frames/sec
Frames transmissions = 50 frames/sec. 𝐺 = = 2 frames/slot.
25 slots/sec

Chance of success on first attempt 𝑃0 = 𝑒 −𝐺 = 𝑒 −2 = 0.135.

(b) The probability of a transmission requiring 𝑘 − 1 collisions followed by success is:

𝑃𝑘 = 𝑒 −𝐺 (1 − 𝑒 −𝐺 )𝑘 −1

In this case, 𝑘 − 1 = 5

𝑃6 = 𝑒 −2 (1 − 𝑒 −2 )5 = 0.0654

(c) The expected number of attempts = 𝑒 𝐺 = 𝑒 2 = 7.389

M. Dahshan CEN444 – Computer Networks Page 7 of 48


Tutorial for Chapter 4 Problem 4

Problem 4
What is the length of a contention slot in CSMA/CD for:

(a) a 2-km cable (signal propagation speed is 82% of the speed in vacuum)?

(b) a 40-km multimode fiber optic cable (speed is 65% speed in vacuum)?

M. Dahshan CEN444 – Computer Networks Page 8 of 48


Tutorial for Chapter 4 Problem 4

Solution
(a) Signal propagation speed = 0.82 × 3 × 108 = 2.46 × 108 m/sec.
Distance 2000 m
Propagation time = 𝜏 = = = 8.13 × 10−6 sec.
Speed 2.46×108 m/sec

Length of contention slot = 2𝜏 = 2 × 8.13 × 10−6 = 16.26 × 10−6 sec.

(b) Signal propagation speed = 0.65 × 3 × 108 = 1.95 × 108 m/sec.


Distance 40000 m
Propagation time = 𝜏 = = = 205.128 × 10−6 sec.
Speed 1.95×108 m/sec

Length of contention slot = 2𝜏 = 2 × 205.128 × 10−6 = 410.256 × 10−6 sec.

M. Dahshan CEN444 – Computer Networks Page 9 of 48


Tutorial for Chapter 4 Problem 5

Problem 5
Consider the following the token passing protocol: When a host receives the token, the
host may transmit for at most 1 ms duration at the rate of 100 Mbps, and then pass the
token to the next host. Suppose that the time required to pass the token between
adjacent hosts is 0.05 ms. Assume that the token ring consists of 10 hosts.

a. Estimate the maximum aggregate (‫ )إجمالي‬throughput achievable using the above


protocol.

b. Suppose that only one of the hosts on the token ring has a backlog (‫)عمل متراكم‬, and
no other host has any data to transmit. Determine the maximum throughput
achieved by the backlogged host.

M. Dahshan CEN444 – Computer Networks Page 10 of 48


Tutorial for Chapter 4 Problem 5

Solution
a. Time for token to circulate around the ring is:

Token hold time × no. of stations with data + Station transmit time × no. of stations

= 1 ms × 10 + 0.05 ms × 10 = 10.5 ms

To maximize the aggregate throughput, each host should maximally utilize 1 ms for
transmission.

The aggregate number of bits that can be transmitted during this 10.5 ms period is:

1 ms × 100Mbps × 10 = 106bits.

The aggregate throughput = total number of bits / total transmission time

= 106 bits / 10.5 ms = 95.23 Mbps.

M. Dahshan CEN444 – Computer Networks Page 11 of 48


Tutorial for Chapter 4 Problem 5

b. Since only one host is backlogged, only one host has data to transmit.

Time for token to circulate around the ring is:

Token hold time × no. of stations with data + Station transmit time × no. of stations

= 1 ms × 1 + 0.05 ms × 10 = 1.5 ms

The aggregate number of bits that can be transmitted during this period is:

1 ms × 100Mbps = 105bits.

The aggregate throughput = total number of bits / total transmission time

= 105 bits / 1.5 ms = 66.67Mbps.

M. Dahshan CEN444 – Computer Networks Page 12 of 48


Tutorial for Chapter 4 Problem 6

Problem 6
Consider five wireless stations, A, B, C, D, and E. Station A can communicate with all
other stations. B can communicate with A, C and E. C can communicate with A, B and
D. D can communicate with A, C and E. E can communicate A, D and B.

Show the steps of the MACA protocol until the frame is successfully transmitted.
Indicate which nodes must be silent during each step.

(a) When A sends a frame to B.

(b) When B sends a frame to A.

(c) When B sends a frame to C.

M. Dahshan CEN444 – Computer Networks Page 13 of 48


Tutorial for Chapter 4 Problem 6

Solution
(a) A B C D E
A x x x x
1. A sends RTS to B.
B x x x
All stations hear the RTS, so they must stay silent until CTS C x x x
comes back. D x x x
E x x x
2. B sends CTS to A.
C and E will hear the CTS, so they must remain silent during the transmission of the
upcoming data frame.
D doesn’t hear the CTS.

3. A sends data frame to B.


C and E are silent. D can transmit.

M. Dahshan CEN444 – Computer Networks Page 14 of 48


Tutorial for Chapter 4 Problem 6

(b)

1. B sends RTS to A.

C and E hear the RTS, so they must remain silent until CTS comes back.

2. A sends CTS to B.

All stations hear the CTS, so they must remain silent during the transmission of the
upcoming data frame.

3. B sends data frame to A.


All stations are silent.

M. Dahshan CEN444 – Computer Networks Page 15 of 48


Tutorial for Chapter 4 Problem 6

(c)

1. B sends RTS to C.

A and E will hear the RTS, so they must remain silent until CTS comes back.

2. C sends CTS to B.

A and D hear the CTS, so they must remain silent during the transmission of the
upcoming data frame.

E doesn’t hear the CTS.

3. B sends data frame to C.


A and D are silent. E can transmit.

M. Dahshan CEN444 – Computer Networks Page 16 of 48


Tutorial for Chapter 4 Problem 7

Problem 7
Six stations, A through F, communicate using the MACA protocol. Is it possible for
two transmissions to take place simultaneously? Explain your answer.

M. Dahshan CEN444 – Computer Networks Page 17 of 48


Tutorial for Chapter 4 Problem 7

Solution

A B C D E F

If they are in a straight line and that each station can reach only its nearest neighbors.
Then A can send to B while E is sending to F. So, the answer is Yes.

M. Dahshan CEN444 – Computer Networks Page 18 of 48


Tutorial for Chapter 4 Problem 8

Problem 8
A 1-km-long, 10-Mbps CSMA/CD LAN (not 802.3) has a propagation speed of 200
m/μsec. Repeaters are not allowed in this system. Data frames are 256 bits long,
including 32 bits of header, checksum, and other overhead. The first bit slot after a
successful transmission is reserved for the receiver to capture the channel in order to
send a 32-bit acknowledgement frame. What is the effective data rate, excluding
overhead, assuming that there are no collisions?

M. Dahshan CEN444 – Computer Networks Page 19 of 48


Tutorial for Chapter 4 Problem 8

Solution
data length without headers
The effective data rate is calculated as:
total time required to complete transmission

cable length 1000 m


The one-way propagation delay 𝜏 = = = 5 × 10−6 sec
signal speed 200 m/10−6 sec

The round-trip propagation time of the cable =2𝜏

A complete transmission has six phases:

1. Transmitter seizes cable:

Required time is 2𝜏 = 10 × 10−6 sec

2. Transmit data:
frame length 256
Required time is = = 25.6 × 10−6 sec
data rate 10×106

M. Dahshan CEN444 – Computer Networks Page 20 of 48


Tutorial for Chapter 4 Problem 8

3. Delay for last bit to get to the end:

Required time is 𝜏 = 5 × 10−6 sec

4. Receiver seizes cable:

Required time is 2𝜏 = 10 × 10−6 μsec

5. Acknowledgement sent:
ack length 32
Required time is = = 3.2 × 10−6 sec
data rate 10×106

6. Delay for last bit to get to the end:

Required time is 𝜏 = 5 × 10−6 sec

Total time required = (10 + 25.6 + 5 + 10 + 3.2 + 5) × 10−6 = 58.8 × 10−6 sec
256−32
Effective data rate = = 3862068.96 ≈ 3.8 × 106 bps
58.8×10−6

M. Dahshan CEN444 – Computer Networks Page 21 of 48


Tutorial for Chapter 4 Problem 9

Problem 9
A switch designed for use with fast Ethernet has a backplane that can move 1 Gbps.
How many frames/sec can it handle in the worst case?

M. Dahshan CEN444 – Computer Networks Page 22 of 48


Tutorial for Chapter 4 Problem 9

Solution
The worst case is an endless stream of 64-byte (512bit) frames.

The backplane can handle 109 bps

The number of frames it can handle is:

109
= 1953125 frames/sec
512

M. Dahshan CEN444 – Computer Networks Page 23 of 48


Tutorial for Chapter 4 Problem 10

Problem 10
In the following figure, four stations, A, B, C, and D, are shown. Which of the last two
stations do you think is closest to A and why?

M. Dahshan CEN444 – Computer Networks Page 24 of 48


Tutorial for Chapter 4 Problem 10

Solution
Station C heard the RTS and responded to it by asserting its NAV signal.

D did not respond.

Thus, C is the closest to A.

D must be outside A’s range.

M. Dahshan CEN444 – Computer Networks Page 25 of 48


Tutorial for Chapter 4 Problem 11

Problem 11
Suppose that an 11-Mbps 802.11b LAN is transmitting 64-byte frames back-to-back
over a radio channel with a bit error rate of 10−7 . How many frames per second will
be damaged on average?

M. Dahshan CEN444 – Computer Networks Page 26 of 48


Tutorial for Chapter 4 Problem 11

Solution
Let error probability per bit 𝑝 = 10−7

Probability of an 𝑛-bit frame arriving correctly is 𝐴 = (1 − 𝑝)𝑛

Thus, probability of a frame arriving correctly is (1 − 10−7 )64×8 = 0.9999488

Probability of frame being damaged is (1 − 𝐴) = (1 − 0.9999488) = 5.12 × 10−5

Data rate of 802.11b is 11 × 106 bits/sec


11×106 bits/sec
Number of frames transmitted per second is = 21484.375 frames/sec
64×8 bits/frame

No. of damaged frames/second = No. of frames/sec × probability of frame damaged

= 21484.375 × 5.11986918 × 10−5 = 1.0999 ≈ 1.1 frames/sec

M. Dahshan CEN444 – Computer Networks Page 27 of 48


Tutorial for Chapter 4 Problem 12

Problem 12
Consider an 802.11 wireless LAN with the following parameters:

Physical layer data rate = 54Mbps MAC layer data payload = 1452 bytes
MAC header = 28 bytes ACK Frame size = 14 bytes
RTS length = 20 bytes CTS length = 14 bytes
DIFS time = 34μs SIFS Time = 16μs

MAC layer throughput is defined as the number of bits sent by the MAC layer in a
given period of time. Assuming that there are two stations exchanging a data frame
using 802.11 DCF and that the two stations are using RTS/CTS transaction.

M. Dahshan CEN444 – Computer Networks Page 28 of 48


Tutorial for Chapter 4 Problem 12

a. Draw a timeline diagram describing this communication.

b. Calculate the required time for this communication.

c. Calculate the MAC layer throughput.

M. Dahshan CEN444 – Computer Networks Page 29 of 48


Tutorial for Chapter 4 Problem 12

Solution
a.

M. Dahshan CEN444 – Computer Networks Page 30 of 48


Tutorial for Chapter 4 Problem 12

b.

Total frame size = data size+ header size = 1452+28 = 1480 bytes
1480×8 bits
Data frame transmission time = = 219.25 μs
54 Mbps

14×8 bits
ACK frame transmission time = = 2.07 μs
54 Mbps

20×8
RTS frame transmission time = = 2.96 μs
54

14×8
CTS frame transmission time = = 2.07 μs
54

Total time required for transmission of one frame is:

Time of DIFS + RTS + SIFS + CTS +SIFS + Data + SIFS + ACK

34 + 2.96 + 16 + 2.07 + 16 + 219.25 + 16 + 2.07 = 308.35 μs

M. Dahshan CEN444 – Computer Networks Page 31 of 48


Tutorial for Chapter 4 Problem 12

c.

We are using 308.35 μs to transmit 1452 bytes

MAC layer throughput is:


1452 × 8 bits
= 37.67 Mbps
308.35 μs

M. Dahshan CEN444 – Computer Networks Page 32 of 48


Tutorial for Chapter 4 Problem 13

Problem 13
In the previous problem, suppose that RTS/CTS transaction is not used.

a. Draw a timeline diagram describing this communication.

b. Calculate the required time for this communication.

c. Calculate the MAC layer throughput.

M. Dahshan CEN444 – Computer Networks Page 33 of 48


Tutorial for Chapter 4 Problem 13

Solution
a.

M. Dahshan CEN444 – Computer Networks Page 34 of 48


Tutorial for Chapter 4 Problem 13

b.

Total frame size = data size+ header size = 1452+28 = 1480 bytes
1480×8 bits
Data frame transmission time = = 219.25 μs
54 Mbps

14×8 bits
ACK frame transmission time = = 2.07 μs
54 Mbps

Total time required for transmission of one frame is:

Time of DIFS + Data + SIFS + ACK

34 + 219.25 + 16 + 2.07 = 271.32 μs

M. Dahshan CEN444 – Computer Networks Page 35 of 48


Tutorial for Chapter 4 Problem 13

c.

We are using 308.35 μs to transmit 1452 bytes

MAC layer throughput is:


1452 × 8 bits
= 42.81 Mbps
271.32 μs

M. Dahshan CEN444 – Computer Networks Page 36 of 48


Tutorial for Chapter 4 Problem 14

Problem 14
Consider an 802.11 wireless LAN using DCF operation with the following parameters:

SIFS = 1 slot, DIFS = 3 slots, ACK = 1 slot, CWmin = 8, All Data frames = 4 slots.

There are four stations, S1, S2, S3 and S4.

At T = 0, S2 starts transmitting a Data frame to S3.

At T = 2, S1 has a Data frame to transmit to S4.

At T = 3, S3 has a Data frame to transmit to S2.

At T = 14, S4 has a Data frame to transmit to S2.

Assume backoff values, of S1 = 6, S3 = 3 and S4 = 1.

Draw a timeline diagram describing this communication. RTS/CTS are not used.

M. Dahshan CEN444 – Computer Networks Page 37 of 48


Tutorial for Chapter 4 Problem 14

Solution

M. Dahshan CEN444 – Computer Networks Page 38 of 48


Tutorial for Chapter 4 Problem 15

Problem 15
Store-and-forward switches have an advantage over cut-through switches with respect
to damaged frames. Explain what it is.

M. Dahshan CEN444 – Computer Networks Page 39 of 48


Tutorial for Chapter 4 Problem 15

Solution
Store-and-forward switches store entire frames before forwarding them.

After a frame comes in, checksum can be verified.

If the frame is damaged, it is discarded immediately.

With cut-through, damaged frames cannot be discarded by the switch because by the
time the error is detected, the frame is already gone.

M. Dahshan CEN444 – Computer Networks Page 40 of 48


Tutorial for Chapter 4 Problem 16

Problem 16
Consider the extended LAN connected using bridges B1 and B2 in the figure. Suppose
the hash tables in the two bridges are empty. List all ports on which a packet will be
forwarded and hash table updates for the following sequence of data transmissions:

(a) A sends a packet to C. (b) E sends a packet to F.

(c) F sends a packet to E. (d) G sends a packet to E.

(e) D sends a packet to A. (f) B sends a packet to F.

M. Dahshan CEN444 – Computer Networks Page 41 of 48


Tutorial for Chapter 4 Problem 16

Solution
Initially, the hash tables are empty.

Switches don’t know which address is associated with which port.

B1 B2
Address Port Address Port
- - - -

M. Dahshan CEN444 – Computer Networks Page 42 of 48


Tutorial for Chapter 4 Problem 16

(a) B1 will forward this packet on ports 2, 3, and 4. B2 will forward it on 1, 2 and 3.

Switch B1 B2
From To Port 1 2 3 4 1 2 3 4
A C X X X X X X

Updated hash tables:

B1 B2
Address Port Address Port
A 1 A 4

M. Dahshan CEN444 – Computer Networks Page 43 of 48


Tutorial for Chapter 4 Problem 16

(b) B2 will forward this packet on ports 1, 3, and 4. B1 will forward it on 1, 2 and 3.

Switch B1 B2
From To Port 1 2 3 4 1 2 3 4
E F X X X X X X

Hash tables are updated as follows:

B1 B2
Address Port Address Port
A 1 A 4
E 4 E 2

M. Dahshan CEN444 – Computer Networks Page 44 of 48


Tutorial for Chapter 4 Problem 16

(c) B2 will not forward this packet on any of its ports, and B1 will not see it.

Switch B1 B2
From To Port 1 2 3 4 1 2 3 4
F E

Hash tables are updated as follows:

B1 B2
Address Port Address Port
A 1 A 4
E 4 E 2
F 2

M. Dahshan CEN444 – Computer Networks Page 45 of 48


Tutorial for Chapter 4 Problem 16

(d) B2 will forward this packet on port 2. B1 will not see it.

Switch B1 B2
From To Port 1 2 3 4 1 2 3 4
G E X

Hash tables are updated as follows:

B1 B2
Address Port Address Port
A 1 A 4
E 4 E 2
F 2
G 3

M. Dahshan CEN444 – Computer Networks Page 46 of 48


Tutorial for Chapter 4 Problem 16

(e) B2 will forward this packet on port 4 and B1 will forward it on port 1.

Switch B1 B2
From To Port 1 2 3 4 1 2 3 4
D A X X

Hash tables are updated as follows:

B1 B2
Address Port Address Port
A 1 A 4
E 4 E 2
D 4 F 2
G 3
D 1

M. Dahshan CEN444 – Computer Networks Page 47 of 48


Tutorial for Chapter 4 Problem 16

(f) B1 will forward this packet on ports 1, 3 and 4. B2 will forward it on port 2.

Switch B1 B2
From To Port 1 2 3 4 1 2 3 4
B F X X X X

Hash tables are updated as follows:

B1 B2
Address Port Address Port
A 1 A 4
E 4 E 2
D 4 F 2
B 2 G 3
D 1
B 2

M. Dahshan CEN444 – Computer Networks Page 48 of 48

You might also like