Network Routing and Switching
Network Routing and Switching
Mandal’s
MARATHWADA INSTITUTE OF TECHNOLOGY, AURANGABAD
Department of Computer Science and Engineering
Year 2017-18 (Part-2)
Class: TE (CSE)
Subject: Computer Networks-II (CN-II)
Question Bank
UNIT-1:
1) What is classful and classless addressing? Explain with suitable example.
2) What is CIDR? Explain concept of subnet, supernet and subnet mask.
3) Discuss the properties of Routing algorithm and briefly describe any two of the adaptive routing technique
with suitable example.
1) Explain circuit, packet and hybrid switching.
4) What is circuit switching and packet switching? Why is packet switching more suitable for computer
networks?
5) What is hierarchical routing? Discuss its advantages and disadvantages. What is the optimal number of
hierarchy levels for a subnet with N-numbers of IMPs? What is corresponding number of table entries per
IMP?
6) State the principle of optimality with regards to routing.
7) Is the path-vector routing algorithm closer to the distance-vector routing algorithm or to the link-state
routing algorithm? Explain.
8) What is adaptive routing? With the help of an example explain flow based routing?
9) Explain centralized routing algorithm with suitable example.
10) What is the difference between flooding and broadcasting? Explain with neat diagram link state routing
algorithm and all issues related to this algorithm
11) Explain the shortest path algorithm for routing. What are the matrices used for computing the shortest path?
For the figure shown, show how the Dijkstra algorithm works for shortest path computing from node X to
node Y.
12) How is a packet sent to a node when the computers are connected to a broadcast medium?
13) What is IP protocol? Give and explain its header format. Give address formats of IP.
14) An organization is granted the block 211.17.180.0/24. The administrator wants to create 32 subnets.
UNIT-2:
1) What is congestion? How is it caused? What are the factors that contribute to congestion? Describe any one
congestion control method with its advantages and disadvantages.
2) Enlist congestion control open loop and closed loop policies.
3) Explain following methods used for congestion control.
a. preallocation of buffers
b. choke packets
c. isarithmic congestion control
4) Explain various techniques to achieve good quality of service.
5) Explain leaky bucket algorithm.
6) Compare leaky bucket and token leaky bucket algorithm.
7) Explain RSVP protocol in detail
8) Write short note on:
a. Integrated service b. Differential service
UNIT-3:
1) Which are the two header formats of ATM? Explain with diagram.
2) Discuss the architecture of ATM network.
3) What is LAN emulsion.
4) Explain mixed LAN architecture.
UNIT-4:
1) What are the various parameters of quality of service offered by the transport layer? Discuss their
significance.
2) Explain transport primitives and give some valid sequence of OSI transport primitives.
3) Enlist the elements used by the transport layer protocol. And explain the connection establishment and
connection release done by this layer.
4) What is the advantage of Go-back-n protocol? How is the parameter ‘n’ determined? Explain how the
protocol works at transport layer in case of errors, lost packet or Acks?
5) In a network, the size of the receive window is 1 packet. Which of the sliding window protocol is being
used by the network? Justify your answer.
6) Give a potential disadvantage when Nagle’s algorithm is used on a badly congested network.
UNIT-6:
1) What is SNMP protocol? Explain in detail.
2) Explain functions of Network management protocol.
3) With a neat diagram explain H.323 protocol.