STUPIDSID
Answer any four questions briefly
1(a)
Compare Osi reference model and the TCP/IP reference model
5 M
1(b)
Explain the authentication protocols of PPP
5 M
1(c)
How does Token Bucket algorithm work?
5 M
1(d)
Explain 'bit stuffing' in bit oriented protocols.
5 M
2(a)
With a suitable sketch explain the transition/connection phases in Point to Point Protocol (PPP). Also explain the supported sets of protocols in the PPP stack.
10 M
2(b)
Distinguish between go Back N ARQ and Selective Reject ARQ.
Sketch the frame flow diagram for Go Back N ARQ and with 3 bit sequence number field and window size of 5, showing the following events:
i) Frame 0 is sent ; Frame 0 is acknowledged
ii) Frames 1 and 2 are sent ; Frames 1 and 2 are acknowledged
iii) Frames 3,4,5 are sent ; Frame 4 is damaged.
iv) timer for frame 5 expires.
Sketch the frame flow diagram for Go Back N ARQ and with 3 bit sequence number field and window size of 5, showing the following events:
i) Frame 0 is sent ; Frame 0 is acknowledged
ii) Frames 1 and 2 are sent ; Frames 1 and 2 are acknowledged
iii) Frames 3,4,5 are sent ; Frame 4 is damaged.
iv) timer for frame 5 expires.
10 M
5
3(a)
Explain the different classes of IP addresses. Identify the class of the following IP addresses and give their default subnet masks:
1) 227.56.83.0.2
1) 227.56.83.0.2
3 M
3(b)
Explain TCP connection establishment and release.
5 M
3(c)
Draw TST switch and three stage space division switch for N=20, n=5 and k=2 and estimate the number of crosspoints required for both cases.
If the above space division switch is to be made non-blocking, calculate the minimum number of crosspoints required.
If the above space division switch is to be made non-blocking, calculate the minimum number of crosspoints required.
10 M
4(a)
Explain ADSL with respect tp spectrum allocation and modulation technique
10 M
4(b)
What are the conditions to be satisfied by a good CRC generator polynomial?
For P=predetermined divisor = 110101(LSB) and D=k bit data block = 1010001101(LSB), find the CRC.
For P=predetermined divisor = 110101(LSB) and D=k bit data block = 1010001101(LSB), find the CRC.
10 M
5(a)
Apply Dijkstra's and Bellman Ford algorithm to the given network and find the least cost path between source node 1 to all other nodes
10 M
5(b)
Explain how TCP handles error control and flow control
10 M
Write short note on (Any TWO)
6(a)
Compare OSPF and BGP
10 M
6(b)
Berkeley socket
10 M
6(c)
HDLC
10 M
6(d)
CSMA/CD
10 M
More question papers from Computer Communication Networks