Professional Documents
Culture Documents
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.
Solution
The delay is calculated using the formula: 𝑇 = 1/(𝜇𝐶 − 𝜆).
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
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 𝑁?
Solution
In pure ALOHA, the maximum throughput is 0.184.
10300
So, 𝑁 = = 1030 stations.
10
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.
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
𝑃𝑘 = 𝑒 −𝐺 (1 − 𝑒 −𝐺 )𝑘 −1
In this case, 𝑘 − 1 = 5
𝑃6 = 𝑒 −2 (1 − 𝑒 −2 )5 = 0.0654
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)?
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
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.
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.
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.
b. Since only one host is backlogged, only one host has data to transmit.
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.
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.
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.
(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.
(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.
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.
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.
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?
Solution
data length without headers
The effective data rate is calculated as:
total time required to complete transmission
2. Transmit data:
frame length 256
Required time is = = 25.6 × 10−6 sec
data rate 10×106
5. Acknowledgement sent:
ack length 32
Required time is = = 3.2 × 10−6 sec
data rate 10×106
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
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?
Solution
The worst case is an endless stream of 64-byte (512bit) frames.
109
= 1953125 frames/sec
512
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?
Solution
Station C heard the RTS and responded to it by asserting its NAV signal.
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?
Solution
Let error probability per bit 𝑝 = 10−7
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.
Solution
a.
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
c.
Problem 13
In the previous problem, suppose that RTS/CTS transaction is not used.
Solution
a.
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
c.
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.
Draw a timeline diagram describing this communication. RTS/CTS are not used.
Solution
Problem 15
Store-and-forward switches have an advantage over cut-through switches with respect
to damaged frames. Explain what it is.
Solution
Store-and-forward switches store entire frames before forwarding them.
With cut-through, damaged frames cannot be discarded by the switch because by the
time the error is detected, the frame is already gone.
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:
Solution
Initially, the hash tables are empty.
B1 B2
Address Port Address Port
- - - -
(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
B1 B2
Address Port Address Port
A 1 A 4
(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
B1 B2
Address Port Address Port
A 1 A 4
E 4 E 2
(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
B1 B2
Address Port Address Port
A 1 A 4
E 4 E 2
F 2
(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
B1 B2
Address Port Address Port
A 1 A 4
E 4 E 2
F 2
G 3
(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
B1 B2
Address Port Address Port
A 1 A 4
E 4 E 2
D 4 F 2
G 3
D 1
(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
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