Q1. Datagram fragmentation and reassembly is handled through IP, and is invisible to the TCP. Does this mean that the TCP doesn’t encompass to worry regarding data arriving to it?
Q2. Derive the effectiveness of Go-Back-N ARQ with error if window size is Ws and Pf is probability of the frame received with error.
Q3. A bit stream 10011101 is transmitted by using standard CRC method. The generator polynomial is x3 + 1. Illustrate that the actual bit string are transmitted. Assume that the third bit from the left is inverted throughout transmission. Illustrate that this error is detected at receiver’s end.
Q4. By using Differential Manchester encoding scheme, draw the time versus amplitude graphs for the bit stream 0101101001.
Q5. A channel of 1 Mbps with propagation delay of 270 ms transmits frames of size 1000 bits. Illustrate the maximum link utilization for stop-and-wait and sliding window having window size 7?
Q6. Describe the Checksum method for the error detection with the help of an illustration.
Q7. Describe the ATM networks in short.
Q8. Write down the format of Token Ethernet frame and describe the meaning of each and every field in the frame.