Key Topics Covered in Computer Networks Unit 3

Overview of Unit 3
 Unit 3 is extensive, covering 15 topics related to computer networks,
including theory and numerical problems from the past three years of
exams 1.
Importance of Unit 3
 This unit is crucial, as approximately 50-60% of exam questions come
from Units 2 and 3. Mastering these units can significantly ease exam
preparation 2.
Network Layer Functions
 The Network Layer handles service requests from the Transport Layer,
translating logical addresses to physical addresses and managing traffic
problems such as switching and routing 3.
Routing and Traffic Management
 The Network Layer determines the best route from source to destination,
addressing traffic issues like congestion control and routing algorithms 4.
Congestion Control
 Congestion occurs when data exceeds node capacity, and the Network
Layer implements control mechanisms to manage this 5.
Routing Algorithms
 The unit covers various routing algorithms, emphasizing Distance Vector
Routing (DVR), which has been frequently tested in recent exams 6.
Logical Addressing
 Logical addressing is essential for global communication across networks,
with IP addresses serving as the logical address in the Network Layer of
the TCP/IP protocol 7.
IP Addressing
 IPv4 addresses are 32-bit unique identifiers for devices on the internet,
while IPv6 addresses are 128-bit, accommodating a larger number of
devices 8.
Subnetting
 Subnetting divides a large network into smaller, manageable sub-
networks, improving security and maintenance. It can be fixed-length or
variable-length 9.
Subnetting Example
 An example of fixed-length subnetting involves dividing a given IP address
into equal parts, while variable-length subnetting allows for unequal
divisions based on network needs 10.
IP Address Classes
 IP addresses are categorized into classes (A, B, C, D, E) based on their
leading bits and purpose, with specific ranges for each class 11.
Header Structure of IPv4
 The IPv4 header consists of 13 fields, with the first 12 being mandatory
and the 13th optional. The header length can vary from 20 to 60 bytes 12.
Conclusion
 Understanding these concepts is vital for navigating computer networks
effectively, especially for exam preparation and practical applications in
networking.
Key Topics Covered in the Video
1. Data Gram Structure
 Services: Defines priority and special demands like delay, throughput,
and reliability 13.
 Total Length: Indicates the length of the header plus the data 13.
 Identification: Used to identify the data gram 13.
2. Fragmentation and Flags
 Flags: Indicates whether to fragment the data gram or not, with options
like "Do Not Fragment" and "More Fragments" 14.
 Fragmentation Offset: Specifies how many bits precede the current
packet in case of fragmentation 15.
3. Time to Live (TTL)
 TTL: Limits the number of routers a data gram can pass through before
being discarded 16. For example, if TTL is set to 5, it decrements with
each router until it reaches zero, at which point the data gram is
discarded 17.
4. Protocols and Addressing
 Protocol: Indicates the protocol being used for the data 18.
 Source and Destination Addresses: Defines the IP addresses of the
sender and receiver 19.
5. IPv4 and IPv6
 IPv4: The most common version of the Internet Protocol, with a limited
address space 20.
 IPv6: The updated version designed to address the limitations of IPv4,
featuring a larger address space and improved routing 21.
6. Advantages of IPv6 over IPv4
  Larger Address Space: IPv6 uses 128-bit addresses compared to 32-bit
in IPv4 22.
 Improved Routing Efficiency: IPv6 simplifies routing and enhances
security features 23.
7. Address Resolution Protocols
 ARP (Address Resolution Protocol): Resolves IP addresses to MAC
addresses 24.
 RARP (Reverse ARP): Resolves MAC addresses to IP addresses 25.
8. Dynamic Host Configuration Protocol (DHCP)
 DHCP: Automatically assigns IP addresses to devices on a network 26.
9. Internet Control Message Protocol (ICMP)
 ICMP: Used for error reporting and diagnostics in network
communication 27.
10. Routing and Forwarding
 Routing: The process of selecting paths for data transfer 28.
 Forwarding: The action taken by routers to send packets to their next
destination 29.
11. Delivery Methods
 Direct Delivery: The packet reaches the final destination directly 30.
 Indirect Delivery: The packet passes through intermediate routers
before reaching the destination 31.
12. Routing Algorithms
 Static vs. Dynamic Routing: Static routing requires manual
configuration, while dynamic routing adjusts automatically based on
network conditions 32.
This summary encapsulates the key concepts and findings of the video,
providing a comprehensive overview of networking protocols and mechanisms.
Key Topics Covered in the Video
Shortest Path Algorithm
 The shortest path algorithm is used to determine the minimum distance
from a starting node to a destination node in a graph.
 Example: From node F, if we add 3 to the existing value of 6, we get 9 33.
Flooding Technique
 Flooding involves sending data through all possible paths except the one
from which it was received.
 Each incoming path sends data over all outgoing lines except one 34.
Duplicate Packet Elimination
 To prevent duplicate packets, methods like hop counters and sequence
numbers are used.
 Hop counters decrement at each router, and if it reaches zero, the packet
is discarded 35.
Distance Vector Routing (DVR)
 DVR uses the Bellman-Ford algorithm to find the shortest path by
advertising the distance to neighboring nodes.
 Each node knows the distance to its neighbors and updates its routing
table based on received vectors 36.
Link State Routing
 This protocol discovers its neighbors and learns their network addresses,
setting distance metrics to each neighbor.
 It constructs packets to inform all other routers about the network
state 37.
Quality of Service (QoS)
 QoS measures network performance based on reliability, delay, jitter, and
bandwidth.
 Reliability ensures data is sent and received accurately, while delay
measures the time taken for data to travel from source to destination 38.
Congestion Control
 Congestion occurs when the network load exceeds its capacity, leading to
delays and packet loss.
 Techniques include open-loop (preventive) and closed-loop (reactive)
methods to manage congestion 39.
Leaky Bucket and Token Bucket Algorithms
 The leaky bucket algorithm controls congestion by allowing packets to be
sent at a constant rate, preventing overflow 40.
 The token bucket algorithm allows for bursts of data transmission, where
tokens are generated at regular intervals to control the flow 41.