Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
13 views2 pages

Network Layer Notes

The document outlines the services and functions of the Network Layer, including packet delivery and routing. It discusses various routing algorithms such as static, dynamic, and shortest path routing, along with congestion control methods. Additionally, it compares IP protocols IPv4 and IPv6, highlighting their address spaces and header features.

Uploaded by

justicealoo891
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
13 views2 pages

Network Layer Notes

The document outlines the services and functions of the Network Layer, including packet delivery and routing. It discusses various routing algorithms such as static, dynamic, and shortest path routing, along with congestion control methods. Additionally, it compares IP protocols IPv4 and IPv6, highlighting their address spaces and header features.

Uploaded by

justicealoo891
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/ 2

Network Layer Notes

Network Layer Services:

- Responsible for delivering packets from source to destination across multiple networks.

- Main services: Packet forwarding, routing, addressing, internetworking.

Routing Algorithms:

1. Optimality Principle:

- States that if router J is on the optimal path from I to K, then the optimal path from J to K is also

part of the optimal path from I to K.

2. Static Routing Algorithms:

- Routes are manually configured and do not change.

- Simple but not flexible in changing network conditions.

3. Shortest Path Routing:

- Uses algorithms like Dijkstra's to find the shortest path between nodes.

- Metric could be hop count, bandwidth, delay, etc.

4. Flooding:

- Each incoming packet is sent out on every outgoing line except the one it arrived on.

- Guarantees delivery but creates excessive traffic.

5. Dynamic Routing Algorithms:

a) Distance Vector Routing:

- Each router maintains a table (vector) of minimum distance to every other node.

- Uses Bellman-Ford algorithm.


- Periodic updates sent to neighbors.

b) Link State Routing:

- Each router has a map of the entire network topology.

- Routers exchange link state information.

- Dijkstra's algorithm is used to compute shortest path.

Congestion Control Algorithms:

- Principles: Avoid overload, react to congestion, fair allocation of resources.

- Policies: Admission control, traffic shaping, load shedding.

- Algorithms: Leaky Bucket, Token Bucket, Choke packets, RED (Random Early Detection).

IP Protocols:

1. IPv4:

- 32-bit address space.

- Header includes checksum, fragmentation fields.

- Limited number of addresses.

2. IPv6:

- 128-bit address space.

- Simplified header for faster processing.

- No checksum, supports extension headers.

- Vastly increased address space.

You might also like