Computer Networks
Computer Networks
Tanenbaum)
Routing
Static Routing:
• Routes are manually configured.
Dynamic Routing:
• Adapts to network changes using protocols like RIP and OSPF.
Algorithms:
1. Shortest Path (Dijkstra): Finds the shortest path based on link weights.
2. Distance Vector (Bellman-Ford): Routes based on distance vectors
shared among neighbors.
Congestion Control
Definition:
• Congestion occurs when the network is overloaded with data, leading to
performance degradation.
Methods:
1. Open Loop:
o Prevent congestion before it happens (e.g., admission control).
2. Closed Loop:
o Detect and alleviate congestion after it occurs (e.g., packet
discarding).
Internetworking - TCP/IP
TCP/IP Model:
• 4 layers: Application, Transport, Internet, and Network Interface.
IP Packet:
• Header fields include Source IP, Destination IP, TTL, Protocol, and
Checksum.
IP Addressing:
• IPv4: 32-bit addresses (e.g., 192.168.1.1).
• IPv6: 128-bit addresses, designed to address IPv4 exhaustion.
This document provides detailed explanations of all units and subtopics for
your Computer Networks course. Let me know if specific areas need further
expansion!