Scribd
Upload
4 views2 pages

Network Layer Routing

Network Layer routing optimizes packet paths from source to destination using algorithms in routers, distinguishing it from the Data Link Layer's single-hop focus. Routing algorithms are classified into static and dynamic types, with further distinctions based on computation methods. Key dynamic algorithms include Distance Vector, Link State, and Path Vector, each with specific characteristics and use cases.

Uploaded by

kanishkgoyal336
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
4 views2 pages

Network Layer Routing

Network Layer routing optimizes packet paths from source to destination using algorithms in routers, distinguishing it from the Data Link Layer's single-hop focus. Routing algorithms are classified into static and dynamic types, with further distinctions based on computation methods. Key dynamic algorithms include Distance Vector, Link State, and Path Vector, each with specific characteristics and use cases.

Uploaded by

kanishkgoyal336
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Network Layer Routing

Network Layer routing determines optimal paths for packets from source to destination
across multiple hops using routing algorithms embedded in routers. These algorithms
compute forwarding tables based on network topology, metrics like cost/hops, and
dynamic changes, distinguishing from Data Link Layer's single-hop focus. [1][2]

Routing Algorithm Classification

Algorithms divide into static (non-adaptive): Manually configured routes by admins,


fixed until changed—simple, secure, low overhead but no auto-failover (e.g., small office
router default gateway); dynamic (adaptive): Auto-update via protocols, adapting to
failures/load—complex but scalable for enterprises.[3][4][5]

Further by computation: Centralized (one controller computes all routes using global
view, e.g., data centers); Isolated (local info only); Distributed (routers share info
iteratively, common in internet).[3]

The diagram shows routers using header-based forwarding tables (e.g., packet '011' at
router 3 picks output link 2).[5]

Key Dynamic Algorithms

 Distance Vector (DV): Routers share distance tables with neighbors periodically
(e.g., RIP uses hop count); Bellman-Ford relaxes paths iteratively. Issues: Count-to-
infinity (slow convergence), solved by split horizon/poison reverse. Example: Small
LANs, RIP updates every 30s.[1][2]

 Link State (LS): Routers flood Link State Advertisements (LSAs) of


neighbors/costs; each builds topology map, runs Dijkstra's SPF for shortest paths
(e.g., OSPF). Fast convergence, accurate, CPU-heavy. Example: OSPF in campuses
computes paths via bandwidth-delay metrics.[6][1]

 Path Vector: Like DV but shares full paths (e.g., BGP for internet AS routing,
avoids loops by path attributes).[1]
 Others: Flooding (broadcast all, hop limit prevents loops); Hierarchical
(summarizes routes by area).[7]

Routing Goals and Metrics

Optimize for shortest path (hops, delay), load balancing, fault tolerance. Metrics: Hop
count (simple), cost (bandwidth inverse), queueing delay. Example: Dijkstra on graph—
nodes as routers, edges weighted by 1/bandwidth; computes min-cost tree from source.
[2][6]

1. [Link]

2. [Link]

3. [Link]

4. [Link]

5. [Link]
routing/

6. [Link]

7. [Link]

8. [Link]

9. [Link]

10. [Link]

You might also like