CSE 434 TTh 9:15 AM Homework #4 Sample Solution October 28, 2003

Please email Catherine (cwen@asu.edu) if you have questions.

(10 points for each question)

1. (4.9) A LAN uses Mok and Wards version of binary countdown. At a certain instant, the ten stations have the virtual station numbers 8, 2, 4, 5, 1, 7, 3, 6, 9, and 0. The next three stations to send are 4, 3, and 9, in that order. What are the new virtual station numbers after all three have finished their transmissions? 8245173690 8 3 0 5 2 7 4 6 9 1 After station 4 sends 8 0 1 5 3 7 4 6 9 2 After station 3 sends 9 1 2 6 4 8 5 7 0 3 After station 9 sends

2. (4.14 ) Six stations, A through F, communicate using the MACA protocol. Is it possible that two transmissions take place simultaneously? Explain your answer. MACA protocol: sender to stimulate the receiver into outputting a short frame, so stations neaby can detect this transmission and avoid transmitting for the duration of the upcoming data frame. Yes. Think about the case where all stations are in a straight line order in alphabetical order. So A is at your far left and F is at your far right. Each station can only reach its nearest neighbor. A can only reach B, B can reach A and C, etc. Therefore the case exists that A can send to B while E is sending to F.

3. (4.17) Sketch the Manchester encoding for the bit stream: 0001110101. 0 0 0 1 1 1 0 1 0 1

4. (5.6) Assuming that all routers and hosts are working properly and that all software in both is free of all errors, is there any chance, however small, that a packet will be delivered to the wrong destination?

Yes there is a chance that a packet would be delivered to the wrong destination. Take the case where the physical media that the data is transferred over has an error. If the destination address field of the packet gets error during transmission, and this error it not detected by the checksum, then the packet would be delivered to the incorrect destination.

(5.7)

Consider the network of Fig. 5-7, but ignore the weights on the lines. Suppose that it uses flooding as the routing algorithm. If a packet sent by A to D has a maximum hop count of 3, list all the routes it will take. Also tell how many hops worth of bandwidth it consumes. Flooding: every incoming packet is sent on every outgoing line except the one it arrived on. A B C D, A B C F, A B E F, A B E G, A G H D, A G H F, A G E F, A G E B

A B G

Counting the number of edges out from A gives you the number of bandwidth in hops that this packet consumes. The answer is 14.

5. (5.16) Compute a multicast spanning tree for router C in the following subnet for a group with members at routers A, B, C, D, E, F, I, and K.

One possible spanning tree is

C F

A E

(5.24) Give an argument why the leaky bucket algorithm should allow just one packet per tick, independent of how large the packet is. If you can send more than one packet per tick, independent of packet size, then eventually you might see a potential increase of processing going on at the nearest router by the leaky bucket. The more packets you are putting on the line per tick for the router to handle, the more time it has to give to handle multiple packets per clock tick. The router might get behind its work and become congested. Therefore, you would only want to put out one packet per clock tick.