1

Problem 1
 Each station of a local computer network has an average input rate of
0.25 messages per second. Messages are 𝟏𝟎𝟒 bits in length with no
overhead, no retransmissions, and no transmission errors. The
channel of the network has a bit rate of 1 Mbps.
(a) How many stations in the network will generate a steady state un
normalized throughput of 10 messages per second?
(b) What is the normalized throughput S that corresponds to 10
messages per second?
 2

Answer
 Input rate 𝝀 =0.25 msg/sec

 Packet Length L=𝟏𝟎𝟒 bit

 Channel Capacity C=1Mpbs=𝟏𝟎𝟔 bps

------------------------------------------------------------------

a) M=1 𝝀 =0.25 msg/sec

M=?? 𝝀 =10 msg/sec

1∗10
M= =40 device
0.25

-------------------------------------------------------------

b)Throughput S= 𝜆X 𝝀 =10 msg/sec

X Transmission time =L/c =10^4/10^6=0. 01

S=0.01*10=0.1 msg
 3

Problem 2
Consider the following two different transmission schemes under error-free
conditions.

 Scheme 1: Fifty overhead bits are used for error-correction in each 250-
bit packet; the remaining 200 bits carry data. Packets are transmitted in a
continuous sequence.

 Scheme 2: Ten overhead bits are used for error-correction in each 250-
bit packet, the remaining 240 bits carry data. When each packet is
received, a 5-bit acknowledgement message is sent back to the sending
station. A new packet is then transmitted after receipt of the
acknowledgement.

 Calculate the transmission efficiency for the two schemes

 4

Channel Utilization or Efficiency

▪ Channel utilization is defined as the fraction of time a channel is

busy transmitting packets.
The symbol 𝜌 is used for channel utilization.
If D is the number of data bits in the packet
H is the number of overhead bits in the packet,
channel utilization is given by

𝐷
𝜌= S (2)
𝐷+𝐻
In many applications, when the number of overhead bits is much
smaller than the number of data bits, the throughput and channel
utilization are assumed to be equal.
 5

Answer
𝐷
 𝜌= S
𝐷+𝐻

200
 Schem1: 𝜌= 1 = 0.8
200+50

---------------------------------------------------------------------------------

 Schem2:

 a 5-bit acknowledgement message is sent back to the sending station

 Overhead H=5+10=15
 D=250-15=235
235
 𝜌= 1 = 0.96
235+15
 6

Problem 3
 A local area network uses a 10 Mbps bus for transmission
medium. Access to the bus is a fixed assignment protocol. Each
station has a Poisson input with a rate of 5 packets per
second. The packet length is 1000 bits. There are 500
stations on the network.

Calculate

(a) The mean transfer delay for a FDMA protocol and

(b) The mean transfer delay for a TDMA protocol.

 7

Answer
 The mean transfer delay for a FDMA protocol
𝑀(2 − 𝑆)
𝑇෠ =
2(1 − 𝑆)
 M number of devices
 S Throughput S= 𝜆 MX
-------------------------------------------------------------------
 𝜆= 5 packets per second
 L= 1000 bits
 C=10Mpbs=10*𝟏𝟎𝟔
 M=500

 X =L/c =1000/107 =0. 0001

 S= 𝜆 MX
 S=5*0.0001*500=0.25
𝑀(2−𝑆) 500(2−0.25)
𝑇෠ = 2(1−𝑆) = 2(1−0.25) = 583.33 s
 8

Time-Division Multiple Access.

▪ The average transfer delay 𝑇 is the sum of the average
synchronization delay, the average waiting time W in the buffer,
and the packet transmission time, so that

(11)

▪ Dividing this expression by 𝑋ത gives the normalized transfer

delay
(12)

▪ By comparison of (8) and (12), we see that

 9

Answer
 The mean transfer delay for a TDMA protocol

𝑀 500
෠=
𝑇 +1= +1 = 334.33s
2(1−𝑆) 2(1−0.25)
 10

Problem 4
 A local area network supports a number of stations, each of
which has a Poisson input with a rate of 0.2 messages per
second. Messages are 2000 bits in length. All stations share a
common channel of bit rate 1 Mbps. If the average transfer
delay on the network is limited to 0.1 seconds, what is the
maximum number of stations that the network can support by
using (a) a FDMA protocol, and (b) a TDMA protocol.
 11

 The mean transfer delay for a FDMA protocol

𝑀(2 − 𝑆)
𝑇෠ =
2(1 − 𝑆)
-------------------------------------------------------------------
 𝜆= 0.2 packets per second
 L= 2000 bits
 C=1Mpbs=𝟏𝟎𝟔
 M=??
 ෠
𝑇=0.1 s

 X =L/c =2000/106 =0.002

 S= 𝜆 MX
 S=0.002*0.2=0.0004
𝑀(2−𝑆) 500(2−0.25)
0.1= = = 583.33 station
2(1−𝑆) 2(1−0.25)
 12

Problem 5
 An idealized central control network with 100 stations is constructed with a
line of bit rate C = 1 Mbps.
 (a) At a throughput of S = 0.4, what is the average message delay for 1000-
bit messages?
 (b) What is the average waiting time in the buffer?
ANSWER

 C=1Mpbs=𝟏𝟎𝟔 M=100 L=1000.

 X=L\C=1000\𝟏𝟎𝟔 =0.001
 S= 𝜆 MX=0.4= 𝜆*100*0.001
2−𝑆
𝑇෠ = 2(1−𝑆)=1.33 ms
 0.4=0.1* 𝜆 𝜆=4
෠
b) the average waiting time in the buffer =C-𝑇=1-1.33=0.33 ms
 13

Problem 6
 A random access network uses the ALOHA access protocol. The
average input rate to each of the 150 stations is 1 packet per
second and the packet is of constant length of 1000 bits. The
channel capacity is 1 Mbps.

(a) If the network is operated at this given throughput, what is the

total traffic offered to the network per packet transmission time?

 (b) What is the average rate of retransmission per station?

 (c) What is the average number of retransmissions per

 successful transmission?

 (d) What is the average transfer delay if the backoff strategy

 is to select an integer from the set {0, 1, 2, • • • , 19}

 with equal probabilities?

 14

Problem 7
 A slotted ALOHA network has the throughput 𝑆 = 𝐺𝑒 −𝐺

Let the state of the network be defined by the number of stations with a

collided packet waiting for retransmission. Assume that stations with a

collided packet can not generate new packets. When the network is in state

k, the throughput is equal to S=(𝑀 − 𝑘)𝜎 where 𝜎 is the probability that an

idle station generates a new packet and M is the number ofstations.

1
Suppose that we choose 𝜎 = 𝑀𝑒 and that a station with a collided packet

1
will transmit with probability P= 𝑀 The average number of attempted

transmissions in a slot when the network is in state k is

 15

Thank You !