15. A 1 Mbyte file is to be transmitted over a 1 Mbps communication line that has a bit error rate of p = 106.

Q3 Solutions follow questions: The file length n = 8 x 106 bits, the transmission rate R = 1 Mbps, and p = 10-6. a. What is the probability that the entire file is transmitted without errors? Note for n large and p very small, (1 p)n enp. P[no error in the entire file] = (1 p)n enp , for n >> 1, p << 1 = e-8 = 3.35 x 10-4 We conclude that it is extremely unlikely that the file will arrive error free. b. The file is broken up into N equal-sized blocks that are transmitted separately. What is the probability that all the blocks arrive correctly without error? Does dividing the file into blocks help?

A subblock of length n/N is received without error with probability: P[no error in subblock] = (1 p)n/N

A block has no errors if all subblocks have no errors, so P[no error in block] = P[no errors in subblock]N =((1 p)n/N)N = (1 p)n So simply dividing the blocks does not help. c. Suppose the propagation delay is negligible, explain how Stop-and-Wait ARQ can help deliver the file in error-free form. On the average how long does it take to deliver the file if the ARQ transmits the entire file each time?

Refer to the following figure for the discussion.

tf tACK

ACK/NAK

We assume the following: t0 = basic time to send a frame and receive the ACK/NAK ttimeout ttotal = total transmission time until success nf = number of bits/frame na = number of bits per ACK nt = number of transmissions Pf = probability of frame transmission error t0 = tf + tACK = nf /R + na /R (tprop 0).

P[nt = i ] = P[one success after i 1 failure] = (1 Pf) Pf i 1 ttotal | i transmissions = i.t0 E[ttotal] =

it0 P[nt = i ] = t0 (1 Pf ) iPf

i =1 i =1

i 1

= t 0 (1 Pf ) / (1 Pf ) =t 0 / (1 Pf )
2

Here, nf = n >> na thus t0 tf = n/R ; and Pf = 1 P[ no error] = 1 enp E[total] = n/R (1 Pf) = n/[Renp] = 8 / (3.35 x 104) = 23,847 seconds = 6.62 hours! The file gets through, but only after many retransmissions. d. Now consider breaking up the file into N blocks. (Neglect the overhead for the header and CRC bits.) On the average how long does it take to deliver the file if the ARQ transmits the blocks one at a time? Evaluate your answer for N = 80, 800, and 8000.

For 1 block Pf = 1 Pb = 1 (1 p)n/N and nf = n/N if tprop 0 and na << n/N : t0b = nf/R = n/NR

Tb = E[ttotalb] = t0b / (1 Pf) = n(1 p)n/N /NR average time to transmit one block T = E[ttotal] = N Tb = n(1 p)n/N /R = 8 (1 p) n/N = 8 enp/N if n/N >> 1, p << 1 N = 80 T 8 e0.1 = 8.84 sec N = 800 T 8 e0.01 = 8.08 sec N = 8000 T 8 e0.001 = 8.008 sec

Each subblock has a higher probability of arriving without errors, and so requires fewer retransmissions to deliver error free. The overall delay is reduced dramatically. e. Explain qualitatively what happens to the answer in part (d) when the overhead is taken into account.

As N increases, the effect of overhead becomes more significant because the headers constitute a bigger fraction of each subblock.

5. Let G be the total rate at which frames are transmitted in a slotted ALOHA system. What proportion of slots Q4 goes empty in this system? What proportion of slots go empty when the system is operating at its maximum throughput? Can observations about channel activity be used to determine when stations should transmit? Solution: Proportion of empty slots = P[0 transmission] = [G0/0!]eG = eG Maximum throughput = 0.368; Gmt = 1 Proportion of empty slots at maximum throughput = e1 = 0.368 Any attempt to decrease the proportion of empty slots below e-1 is counterproductive as this action will push the throughput below its maximum value.

Q5 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) =

1 1 1 4( p)( 1 p)3 = 2 p( 1 p)3 2 2 2

Take the derivative with respect to p,

P( success) 1 1 = 2(1 p)3 (3 p)(1 p) 2 p 2 2

set it to 0 and find the value of

p that maximizes P(success).

p=

1 2

Q6 10. 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 1/2 tp = and X = 4 a. ALOHA
collision
A 0 1 2 3 4 5 6 7 8

No ACK; A times out, reschedules collision

B 0 1 2 3 4 5 6 7 8

No ACK; B times out, reschedules

collision
C 0 1 2 3 4 5 6 7

No ACK; C times out, 8 reschedules

b.

Non-persistent CSMA
collision

A 0 1 2 3 4 5 6 7 8

No ACK; A times out, reschedules collision

B 0 1 2 3 4 5 6 7 8

No ACK; B times out, reschedules

C 0 1 2 3 4 5 6 7 8

Station C senses channel busy and backs off

c.

Non-persistent CSMA-CD.
collision
A 0 1 2 3 4 5 6 7 8

A detects collision, aborts collision

B 0 1 2 3 4 5 6 7 8

B detects collision, aborts

C 0 1 2 3 4 5 6 7 8

Station C senses channel busy and backs off