Unit -1 PACKET SWITCHING NETWORKS-I

1. Explain packet switching network with external view and internal view.
2. Define the two types of network services and distinguish between both.
3. Explain with a neat diagram the service offered by the network and its internal
operation?
4. State and explain end to end argument for system design.
5. Compare the operations of the layer 3 entities in the end systems and in the
routers inside the network.
6. Explain with an example how oversubscription is used to access portion of packet
switching networks and to optimize the use of bandwidth resources.
7. With reference to Campus network, explain how LANs Provide access to packet
switching networks in many environments.
8. Differentiate between intra domains and inter domain networks.
9. What are datagram and virtual circuits? Distinguish between them.
10. State and explain Message switching with diagram.
11. Explain and derive delays in Datagram packet switching and compare it with
message switching
12. Why is packet switching more suitable than message switching for interactive
applications? Compare the delays in datagram packet switching and message
switching.
13. Explain the minimum delay incurred when message is transmitted over a path that
involves two intermediate switches.
14. State and explain datagram packet switching with diagram.
15. Explain the minimum delay incurred when message is broken into three separate
packets.
16. What are VCIs? Explain virtual circuit packet switching with a diagram.
17. Explain connectionless packet switching. Show how the minimum delay incurred
when a message transmitted is 3+3T
18. Explain cut through packet switching.
19. Explain in detail the structure of a packet switch with diagrams.
20. Explain 8x8 banyan switching.
21. What are the goals of routing algorithms?
22. Differentiate between switch, router and switch-router.
23. Classify the routing algorithms with brief explanation.
24. Explain routing tables for both virtual packet switching and datagram switching
with an example
25. Explain hierarchical routing with example.
26. State and explain how flooding occurs when initiated from one node say node 1 as
example.
27. Explain the concept of deflection routing.
Page 1

28. Explain shortest path routing with an example. What metrics can be used to assign
cost to each link?
29. Explain with an example the working principle of Bellman-Ford algorithm with
an example.
30. Explain recomputing the minimum cost after the failure of a link using the
Bellman-Ford algorithm.
31. Describe count to infinity problem with an example. Explain how to overcome the
count to infinity problem.
32. Compare between circuit switching, packet switching and message switching.

Unit -2 PACKET SWITCHING NETWORKS-II

1. Explain Dijkstras Algorithm with an example.
2. Consider the network given below in figure .

Page 2

a. Use the Dijkstras Algorithm to find the shortest path from source node 5
to all other destination node.
b. Find the shortest path tree from node 5 to other nodes.
c. Find the set of associated routing table entries
3. Compare Bellman-Ford Algorithm and DijKstras algorithm for finding the
4.
5.
6.
7.

shortest paths from a source node to all other nodes in the network.
Compare source routing versus Hop-by-Hop routing.
Compare link-state routing versus distance vector routing.
What is the meaning of traffic management?
Explain the FIFO and priority queue scheduling for managing traffic at packet

level.
8. Explain head-of-line priority queuing.
9. Explain fair queuing, fluid flow and packet by packet fair queuing.
10. Explain how to compute the finish tag.
11. Write in brief about weighted fair queuing.
12. Write a note on random early detection.
13. What are the strategies used in the internet to provide Qos at flow level.
14. Explain the Leaky bucket algorithm for policing the traffic at flow level.
15. Explain how Traffic shaping can be realized.
16. Write a note on closed loop control.
17. Discuss how traffic is mapped on the network topology. Or write a short note on
traffic engineering or traffic management at flow aggregate level.
18. Explain implicit vs. explicit feedback.
19. Distinguish between implicit and explicit feedback.
20. Give the differences between leaky bucket and token bucket algorithm

Page 3