Scribd
Upload
19 views17 pages

Network Layer

Uploaded by

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

Network Layer

Uploaded by

vanshikatiwari135
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 17

NETWORK LAYER

Network Layer in OSI Model


•
Data is transmitted in the form of packets via various logical network pathways
between various devices. It offers routes for data packet transfers across the
network. The network layer is also responsible for organizing and controlling the
available paths for data transfer.
•

•
•

•
•

•
How Does the Network Layer Work?
•

•
Routing Algorithms
•

•
•
•
• 1. Static Routing (Manual Routing)
• Routes are manually configured and do not change unless updated
by the network admin.
• Suitable for small, simple networks.
• Advantages: Simple, predictable.
• Disadvantages: No fault tolerance, no adaptability to network changes.
• Example: Home routers with fixed routing tables.

• 2. Dynamic Routing
• Routers automatically adjust paths based on network conditions
(congestion, link failure, etc.).
• Uses routing protocols to exchange routing information.
• Advantages: Adaptive, scalable.
• Disadvantages: More complex, consumes CPU and bandwidth.
• 🔸 A. Distance Vector Routing
• Each router shares information only with its immediate neighbors.
• Based on hop count (number of routers to reach the destination).
• Uses algorithms like Bellman-Ford.
• Slow convergence, prone to routing loops.
• 📌 Example Protocols: RIP (Routing Information Protocol)

• 🔸 B. Link State Routing


• Routers have complete knowledge of the network topology.
• Use Dijkstra’s algorithm to calculate shortest paths.
• Fast convergence, more accurate but resource-intensive.
• 📌 Example Protocols: OSPF (Open Shortest Path First), IS-IS

• 🔸 C. Path Vector Routing


• Used mainly in inter-domain routing (between organizations or ISPs).
• Maintains the entire path to a destination instead of just the next hop.
• Avoids routing loops by tracking the full path.
• 📌 Example Protocol: BGP (Border Gateway Protocol)
1. What is a routing algorithm?
• Answer:
A routing algorithm is a set of rules used by routers to
determine the best path for forwarding data packets from
a source to a destination in a network.
2. What is the difference between static and dynamic routing?
Static Routing Dynamic Routing
Automatically updated using routing
Manually configured
protocols
Adapts to network changes like
Not adaptable to changes
failures
Low overhead Higher overhead
Suitable for small networks Suitable for large networks
•
•

•
•
Ipv4(Internet Protocol version 4)
•
•
•
•
•
• →
•
•
•
Ipv6(Internet Protocol version 6)
•
•

•
•

•
•
•
•
•
Classful Addressing (IPv4 Only)
Default
Class Starting Bits Range Use
Subnet Mask
1.0.0.0 to Large
A 0 255.0.0.0
126.0.0.0 networks
128.0.0.0 to Medium
B 10 255.255.0.0
191.255.0.0 networks
192.0.0.0 to Small
C 110 255.255.255.0
223.255.255.0 networks
224.0.0.0 to
D 1110 239.255.255.2 — Multicast
55
240.0.0.0 to
E 1111 255.255.255.2 — Experimental
55
5. Classless Addressing (CIDR - Classless Inter-Domain
Routing)
•

•
•
•
•

•
•
•

•
•
•
•
•
•
•

•
•

•
• →
•
Supernetting
•
•

•
•
•
•
•
•

•
•
•
•
•
•
• →
Thank you

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy