RR410402-COMPUTER-NETWORKS - Code No: RR410402 Set No. 1 IV...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Code No: RR410402 Set No. 1 IV B.Tech I Semester Supplimentary Examinations, November 2008 COMPUTER NETWORKS ( Common to Electronics & Communication Engineering, Electronics & Instrumentation Engineering, Bio-Medical Engineering and Electronics & Telematics) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ⋆ ⋆ ⋆ ⋆ ⋆ 1. (a) With a neat diagram, explain the functionality of layers, protocols and inter- faces. (b) Two networks each provide a reliable connection oriented service. One of them offers a reliable byte stream and other offers a reliable message stream. Are they identical? If so, why is distinction made? If not give an example of how they differ? [8+8] 2. (a) If the bit string 0111101111101111110 is bit stuffed. What is the output of the string? (b) What is the reminder obtained by dividing x 7 + x 5 +1 by the generator x 3 +1. [8+8] 3. (a) What is collision free protocols? Explain Binary count down protocol. (b) Explain in detail, Adaptive free walk protocol. [8+8] 4. (a) For hierarchical routing with 4800 routers, what region and cluster sizes should be chosen to minimize the size of the routing table for a three-layer hierarchy? (b) A computer on a 6-Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 1Mbps. It is initially filled to capacity with 8 megabits. How long can the computer transmit at the full 6 Mbps? (c) An ATM network uses a token bucket scheme for traffic shaping. A new token is put into the bucket every 5 μ sec. What is the maximum sustainable net data rate (i.e., excluding header bits)? [4+6+6] 5. (a) Imagine a generalized n-army problem, in which the agreement of any two of the armies is sufficient for victory. Does a protocol exist that allows blue to win? (b) Suppose that the clock-driven scheme for generating initial sequence numbers is used with a 15-bit wide clock counter. The clock ticks once every 100msec, and the maximum packet lifetime is 60sec. How often need resynchronization take place i. in the worst case? ii. when the data consumes 240 sequence numbers/min?...
View Full Document

Page1 / 7

RR410402-COMPUTER-NETWORKS - Code No: RR410402 Set No. 1 IV...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online