Garsia Solution
Garsia Solution
=e
-1
Any attempt to decrease the proportion of empty slots below e is counterproductive as this action will
push the throughput below its maximum value.
13. Consider four stations that are all attached to two different bus cables. The stations exchange fixed-size frames
of length 1 second. Time is divided into slots of 1 second. When a station has a frame to transmit, the station
chooses either bus with equal probability and transmits at the beginning of the next slot with probability p. Find the
value of p that maximizes the rate at which frames are successfully transmitted.
Solution:
To maximize the successful transmission rate is to maximize the probability of successful
transmission.
P(success) = (number of stations) P(one station transmits on one bus) P(no other station transmit
on the same bus)
)(
)(
15. A channel using random access protocols has three stations on a bus with end-to-end propagation delay .
Station A is located at one end of the bus, and stations B and C are together located at the other end of the bus.
Frames arrive at the three stations and are ready to be transmitted at stations A, B, and C at the respective times tA
= 0, tB = /2, and tC = 3/2. Frames require transmission times of 4. In appropriate figures, with time as the
horizontal axis, show the transmission activity of each of the three stations for Frame arrival times:
A: tA = 0
B: tB = /2
C: tC = 3 /2 = 1.5
tp = and X = 4
Solution:
18. m terminals are attached by a dedicated pair of lines to a hub in a star topology. The distance from each
terminal to the hub is d meters, the speed of the transmission lines is R bits/second, all frames are of length 12500
8
bytes, and the signal propagates on the line at a speed of 2.5 (10 ) meters/second. For the four combinations of the
following parameters {d = 25 meters or d = 2500 meters; R = 10 Mbps or R = 10 Gbps}, compare the maximum
network throughput achievable when the hub is implementing: Slotted ALOHA; CSMA/CD.
Solution:
8
2x2500
1.00E+07
2E-05
2E-03
1.00E+10
2E-02
2E+00
2x2500
1.00E+07
0.367879
0.367879
1.00E+10
0.367879
0.367879
R/d
2x25
2x2500
1.00E+07
0.999872
0.98736
1.00E+10
0.886525
0.07246
20. A wireless LAN uses polling to provide communications between M workstations and a central base station. The
system uses a channel operating at 25 Mbps. Assume that all stations are 100 meters from the base station and that
polling messages are 64 bytes long. Assume that frames are of constant length of 1250 bytes. Assume that stations
indicate that they have no frames to transmit with a 64-byte message.
Solutions follow questions:
d = 100 m between the base station and the stations
8
v = 3 x 10 m/sec
N = 10,
max = 97.4%
max = 0.788/4 = 243,700 frames/sec
21. A token-ring LAN network interconnects M stations using a star topology in the following way. All the input and
output lines of the token-ring station interfaces are connected to a cabinet where the actual ring is placed. Suppose
that the distance from each station to the cabinet is 100 meters and that the ring latency per station is eight bits.
Assume that frames are 1250 bytes and that the ring speed is 25 Mbps.
Solutions follow questions:
d = 100 m from each station to the cabinet
8
v = 2 x 10 m/sec
b = 8 bits
L = 1250 bytes = 10000 bits
R = 25 Mbps
a. What is the maximum possible arrival rate that can be supported if stations are allowed to transmit an unlimited
number of frames/token?
When all stations are allowed to transmit an unlimited number of frames/token, max = 1 and = X.
b. What is the maximum possible arrival rate that can be supported if stations are allowed to transmit 1 frame/token
using single-frame operation? Using multiple token operation?
Single-frame operation:
Multi-token operation:
c. Repeat parts (a) and (b) if the transmission speed is 2.5 Gbps.
R = 2.5 Gbps
Single-frame operation:
Multi-token operation:
27. Calculate the parameter "a" and the maximum throughput for a Gigabit Ethernet hub with stations at a 100meter distance and average frame size of 512 bytes; 1500 bytes; and 64,000 bytes.
Solution:
d = 100
Tprop = 0.0000005
R = 1.00E+09
512
1500
64000
0.12207
0.041667
0.000977
Throughput
0.56
0.788525
0.993754
43. Suppose that a 1 MHz channel can support a 1 Mbps transmission rate. The channel is to be shared by 10
stations. Each station receives frames with exponential inter-arrivals and rate =50 frames /second and frames are
constant length L = 1000 bits. Compare the total frame delay of a system that uses FDMA to a system that uses
TDMA.
Solution:
Given:
R = 1 Mbps
L = 1000 bits
M = 10 stations
X = L/R = (1000 bits)/(1000000 bits/sec) = 1x103 sec
= (/M)(X x M) = 50(10x103) = 0.5
For FDMA:
Total Packet Delay = [M/( 2(1-)) + M/2 + M] E[X]
= [(0.5)(10)/(2(1 0.5)) + 10/2 + 10][10-3]
= [20] [10-3] = 0.02
For TDMA:
Total Packet Delay = [M/(2(1 )) + M/2 + 1]E[X]
= [(0.5)(10)/(2(1 0.5)) + 10/2 + 1] [10-3]
-3
Solution:
10 Mbps LAN
R = 100 kbps
efficiency = 0.80
Bridge:
Each station is equally likely to transmit to any other stations in the extended LAN. Then R/2 traffic is
local.