Page 151 - DCAP207_NETWORKS_DCAP406_COMPUTER_NETWORKS

Computer Networks/Networks

Notes Distance Vector Routing: It maintains a routing table and exchanges its routing table with each
of its neighbors so that their routing tables get updated.
Flow-based Routing: It takes into account the topology as well as the load.

Hierarchical Routing: It uses intra-domain routing and inter-domain routing.
Link State Routing: It enables each router in the network learns the network topology to creates
a routing table based on this topology.

Multicast: It is used for one or more network interfaces located on various subnets. It allows
one-to-many communication.
Multicast Routing: Refers to sending information to well-defined groups that have large
members but small compared to the network as a whole.
Non-adaptive Algorithms: They are independent of the volume of the current traffic and topology
and decide the route to which a datagram is to send off-line.
Optimality Principle: This defines the optimal path.
Routing Algorithms: They are software part of the router and decide which output line an
incoming packet should be transmitted on.

9.7 Review Questions

1. Discuss the role of network layer in the OSI model.
2. What are the main issues of concerns for the design of network layer?

3. Describe briefly how hierarchal algorithm works.
4. What is the main purpose of using router in a network?
5. Differentiate between:
(a) Connectionless and connection-oriented service
(b) Interior and Exterior Routing

(c) Link state and distance vector routing

Answers: Self Assessment

1. True 2. False
3. True 4. False
5. True 6. Dynamic

7. Shortest 8. RIP
9. Two 10. Interior

9.8 Further Readings

Books Achyut S Godbole and Atul Kahate, Web Technologies, Tata McGraw Hill.
Andrew S. Tanenbaum, Computer Networks, Prentice Hall.

144 LOVELY PROFESSIONAL UNIVERSITY