Assignment #3, Fall 2010 CSci 5211 (Due on November 17, 2010), 10 points each question 1.

CSMA/CD: Suppose a CSMA/CD network is running at 10 Mbps over a 1-km cable with no repeaters. The signal speed in the cable is 200,000 km/sec. Compute the following. a) End-to-end propagation delay [2pt].

cable length / signal speed = 1 km / 2 105 km/s = 5 10-6 sec

b) Worst-case collision detection time [2pt].

round trip time = 2 end-to-end propagation delay = 10 10-6 sec

c) Minimum frame size [2pt].

bandwidth worst-case collision detection time = (10 106) (10 10-6)= 100 bits
Suppose we increase the bandwidth from 10 Mbps to 100 Mbps, how does it affect the above three values? [4pt]

This does not affect both end-to-end propagation delay and work-case collision detection time.
Instead minimum frame size = (100 106) (10 10-6) = 1000 bits

2. Token ring: Compare the performance of release after transmission and release after reception strategies under the following conditions. You can ignore the time taken to transmit the token itself.

Throughput = Efficiency Bandwidth. Let T: token holding time, D: ring latency, N: number of
stations on the ring. Then, in case of Release After Transmission (RAT) protocol, a station releases its token after it finishes transmitting the packet. So, its Efficiency ERAT = 1/(1+D/NT), whereas, in case of Release After Reception (RAR) protocol, a station waits until the packet it transmitted comes back to the station before releasing its token. Thus, its Efficiency ERAR = 1/(1+D/T). a) What is the maximum throughput achievable with a token ring of 50 stations having a ring latency of 100 s and a bandwidth of 10 Mbps. Assume that each station is allowed to hold the token for a period sufficient to transmit a packet of size 1 KB [3pt].

T = (1000 8)/10 106 = 0.0008 sec, D = 100 10-6 sec, N = 50

RAT: E = 1/(1+(100 10-6)/(8 10-4 50))=400/401=0.9975. Throughput= 0.9975 10Mbps = 9.975Mbps RAR: E = 1/(1+(100 10-6)/(8 10-4)) = 8/9 = 0.8889. Throughput = 0.8889 10Mbps = 8.889Mbps b) Suppose the bandwidth is increased to 100 Mbps, number of stations to 500 and the ring latency to 200 s, what will be its effect on the performance? [3pt]

 T = (1000 8)/100 106 = 0.008 sec, D = 200 10-6 sec, N = 500

RAT: E = 200/201 = 0.995. Throughput = 0.995 100Mbps = 99.5Mbps RAR: E = 2/7 = 0.2857. Throughput = 0.2857 100Mbps = 28.57Mbps c) Suppose the token holding time per station is fixed at 500 s instead of one packet transmission time. How would it affect the maximum throughput achievable under the above two scenarios? [4pt]

T = 500 10-6
RATa : E = 250/251 = 0.996. Throughput = 9.96Mbps RATb : E =1250/1251 = 0.9992. Throughput = 99.92Mbps RARa : E = 5/6 = 0.8333. Throughput = 8.333Mbps RARb : E = 5/7 = 0.7142. Throughput = 71.42Mbps

3. Adaptive tree walk: Suppose sixteen stations (numbered 1 to 16) are contending for the use of a shared channel using the adaptive tree walk protocol. a) If stations numbered 1,5,6,10,13,15 become ready at once, how many slots are needed for each of the ready stations to transmit a frame successfully? Please specify the slot number, range of stations allowed to transmit in that slot and whether the result is a success/collision/idle slot [4pt].

13 slots are needed.

Slot# 1 2 3 4 5 6 7 8 9 10 11 12 13 Range 1 to 16 1 to 8 1 to 4 5 to 8 5 to 6 5 6 7 to 8 9 to 16 9 to 12 13 to 16 13 to 14 15 to 16 Result Collision (1, 5, 6, 10, 13, 15) Collision (1, 5, 6) Success (1) Collision (5, 6) Collision (5, 6) Success (5) Success (6) Idle (7, 8) Collision (10, 13, 15) Success (10) Collision (13, 15) Success (13) Success (15)

b) Suppose only one of the sixteen stations is ready to transmit, how many slots are needed to complete the transmission? What if all the stations have frames to transmit? [3pt]

 Just 1 slot is needed since the station can transmit at the first slot for range 1 to 16. If all the stations
have frames to transmit, 31 slots are needed because we have to traverse all nodes. c) At a certain instant two of the sixteen stations become ready. What is the minimum number of slots needed for those two stations to complete their transmissions? What is the maximum number of slots needed? Give an example scenario (identifiers of ready stations) for each of these two cases. [3pt]

Minimum (ex. Stations 1 and 9): 3 slots, Maximum (ex. Stations 15 and 16): 9 slots (1-16, 1 -8, 9-16,
9 -12, 13-16, 13-14, 15-16, 15, 16) or 6 slots with optimization (1 -16, 1 -8, 9-12, 13-14, 15, 16).

4. Explain why the hidden terminal problem can be solved by CSMA/CA protocol [10pt].

A hidden station problem occurs in a wireless LAN if we use CSMA access protocol. Suppose each
station A, B, C and D aligns in a line from left to right. Assuming station A is transmitting from to B, however, station C cannot sense the transmission signal because it is out of range of A, it falsely assumes that it is safe to transmit to B. This will cause a collision at station B, which called a hidden station problem since the competitor is too far away to be detected. The main reason to cause this problem is that the sender doesnt have a correct knowledge about the receivers activity. CSMA can only tell whether there is an activity around. However, by using CSMA/CA protocol, the sender can get the receivers status through the handshaking. For instance, station C can receive the stations Bs CTS and know how long the station A will take to transmit data. It will stop its transmission request before station A completes.

5. What is the priority scheme for IEEE 802.4 protocol? [5pt] Did priority 6 packets always get transmitted before priority 4 packets? If not, why? [5pt]

In IEEE 802.4, each station maintains four classes of priority, 0, 2, 4 and 6 for its outgoing packets,
with class 0 the lowest and 6 the highest. As a result, each station has four priority queues for outgoing message. When a station obtains a token and has packets ready, it will send its packets starting from higher priority queue to lower priority queue until it runs out of time or has sent all ready packets. From this scheme, priority 6 packets are not always get transmitted before priority 4 packets. For example, if the priority 6 packets could not be transmitted within the THT and there exist some priority 4 packets to be transmitted, the priority 4 packets can get transmitted before priority 6 packets.