Assignment 2

MCA I

Q1. Give three examples of protocol parameters that might be negotiated when a connection
is set up.
Q2. “A datagram cannot be larger than the MTU of a network over which it is sent.” Is the
statement true or false? Explain with the help of a suitable example.
Q3. Explain Three-Way Handshake Mechanism used by TCP to terminate a Session reliably.
Q4. The byte-counting variant of the leaky bucket algorithm is used in a particular system.
The rule is that one 1024-byte packet, or two 512-byte packets, etc., may be sent on each
tick. Give a serious restriction of this system that was not mentioned in the text.
Q5. Suppose nodes A, B, and C each attach to the same broadcast LAN (through their
adapters). If A sends thousands of frames to B with each frame addressed to the LAN
address of B, will C's adapter process these frames? If so, will C's adapter pass the IP
datagram’s in these frames to C (i.e., the adapter's parent node)? How will your answers
change if A sends frames with the LAN broadcast address?
Q6. A large number of consecutive IP address are available starting at 192.16.0.0. Suppose
that four organizations, A, B, C, and D, request 4000, 2000, 500, 1000 and 7000
addresses, respectively, and in that order. For each of these, give the first IP address
assigned, the last IP address assigned, and the mask in the w.x.y.z/s notation.
Q7. Suppose there are three routers between a source host and destination host. Ignore
fragmentation. An IP datagram sent from the source host to the destination host will
travel over how many interfaces? How many forwarding table will be indexed to move
the datagram from the source to destination?
Q8. A router has just received the following new IP addresses: 57.6.96.0/21, 57.6.104.0/21,
57.6.112.0/21, and 57.6.120.0/21. If all of them use the same outgoing line, can they be
aggregated? If so, to what? If not, why not?
Q9. How could you change the IP datagram format to support high-speed packet switching
at router? Considering the fact that a router must recompute a header checksum after
decrementing the time-to-live field.
Q10. Consider sending a 2400-byte datagram into a link that has an MTU of 700 bytes.
Suppose the original datagram is stamped with the identification number 422. How many
fragments are generated? What are the values in the various fields in the IP datagram(s)
generated related to fragmentation?
Q11. Most IP datagram reassembly algorithms have a timer to avoid having a lost fragment tie
up reassembly buffers forever. Suppose that a datagram is fragmented into four
fragments. The first three fragments arrive, but the last one is delayed. Eventually, the
timer goes off and the three fragments in the receiver's memory are discarded. A little
later, the last fragment stumbles in. What should be done with it?
Q12. What is the fastest line speed at which a host can blast out 1500-byte TCP payloads
with a 120-sec maximum packet lifetime without having the sequence numbers wrap
around? Take TCP, IP, and Ethernet overhead into consideration. Assume that Ethernet
frames may be sent continuously.
Q13. When the IPv6 protocol is introduced, does the ARP protocol have to be changed? If so,
are the changes conceptual or technical?
Q14. Suppose Host A sends two TCP segments back to back to Host B over a TCP connection.
The first segment has sequence 100; the second segment has sequence number 1025.
a. How much data is there in the first segment?
b. Suppose that the first segment is lost but the second segment arrives at B. In the
acknowledgement that Host B send to Host A, what will be the acknowledgement
number?
Q15. Consider the effect of using slow start on a line with a 10-msec round-trip time and no
congestion. The receive window is 24 KB and the maximum segment size is 2 KB. How
long does it take before the first full window can be sent?
Q16. Explain with the help of diagram the TCP connection management and Window
management policy using proper flags.
Q17. Consider a TCP connection between Host A and Host B. Suppose that the TCP segments
traveling from Host A to Host B have source port number x and destination port number
y. What are the source and destination port numbers for the segments traveling from Host
B to Host A?
Q18. Describe why an application developer might choose to run an application over UDP
rather than TCP.
Q19. One of your classmates, Sumit, has pointed out that it is wasteful to end each frame with a flag
byte and then begin the next one with a second flag byte. One flag byte could do the job as
well, and a byte saved is a byte earned. Do you agree?
Q20. A bit string, 0111101111101111110, needs to be transmitted at the data link layer. What is the
string actually transmitted after bit stuffing?
Q21. When bit stuffing is used, is it possible for the loss, insertion, or modification of a single bit to
cause an error not detected by the checksum? If not, why not? If so, how? Does the checksum
length play a role here?
Q22. Frames of 1000 bits are sent over a 1-Mbps channel using a geostationary satellite whose
propagation time from the earth is 270 msec. Acknowledgements are always piggybacked onto
data frames. The headers are very short. Three-bit sequence numbers are used. What is the
maximum achievable channel utilization for
1. Stop-and-wait. b. GoBack N. c. Selective Repeat.
Q23. For this problem, use a formula from this chapter, but first state the formula. Frames arrive
randomly at a 100-Mbps channel for transmission. If the channel is busy when a frame arrives,
it waits its turn in a queue. Frame length is exponentially distributed with a mean of 10,000
bits/frame. For each of the following frame arrival rates, give the delay experienced by the
average frame, including both queueing time and transmission time.
1. 90 frames/sec. b. 900 frames/sec. c. 9000 frames/sec.
Q24. A group of N stations share a 56-kbps pure ALOHA channel. Each station outputs a 1000-bit
frame on an average of once every 100 sec, even if the previous one has not yet been sent (e.g.,
the stations can buffer outgoing frames). What is the maximum value of N?
Q25. Consider the delay of pure ALOHA versus slotted ALOHA at low load. Which one is less?
Explain your answer.
Q26. Ten thousand airline reservation stations are competing for the use of a single slotted ALOHA
channel. The average station makes 18 requests/hour. A slot is 125 µsec. What is the
approximate total channel load?
Q27. A large population of ALOHA users manages to generate 50 requests/sec, including both
originals and retransmissions. Time is slotted in units of 40 msec.
1. (a) What is the chance of success on the first attempt?
2. (b) What is the probability of exactly k collisions and then a success?
3. (c) What is the expected number of transmission attempts needed?
Q28. Measurements of a slotted ALOHA channel with an infinite number of users show that 10
percent of the slots are idle.
1. (a) What is the channel load, G?
2. (b) What is the throughput?
3. (c) Is the channel underloaded or overloaded?
Q29. In an infinite-population slotted ALOHA system, the mean number of slots a station waits
between a collision and its retransmission is 4. Plot the delay versus throughput curve for this
system.
Q30. How long does a station, s, have to wait in the worst case before it can start transmitting its frame
over a LAN that uses the basic bit-map protocol?
Q31. A LAN uses Mok and Ward's 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?
Q32. Sixteen stations, numbered 1 through 16, are contending for the use of a shared channel by using
the adaptive tree walk protocol. If all the stations whose addresses are prime numbers suddenly
become ready at once, how many bit slots are needed to resolve the contention?
Q33. A collection of 2n stations uses the adaptive tree walk protocol to arbitrate access to a shared
cable. At a certain instant, two of them become ready. What are the minimum, maximum, and
mean number of slots to walk the tree if 2n -1?
Q34. The wireless LANs that we studied used protocols such as MACA instead of using
CSMA/CD. Under what conditions, if any, would it be possible to use CSMA/CD
instead?