ClassLess Interdomain Routing - CIDR With Example
Duration: 4 min
This video lesson is available to enrolled students.
AI Summary
An AI-generated summary of this video lecture.
This educational video lecture focuses on networking concepts, specifically calculating properties of a Classless Inter-Domain Routing (CIDR) block. The instructor addresses a specific problem involving the IP address 167.199.170.82/27. The lesson covers determining the total number of addresses within the block, identifying the first address (network address), and the last address (broadcast address). The teaching progression moves from a direct calculation method to a more formal approach using bitwise operations and address masks, providing students with two distinct methods to solve similar networking problems.
Chapters
0:00 – 2:00 00:00-02:00
The instructor begins by presenting a specific problem on the screen: "Find the Number of addresses, first and last address of the CIDR block to which Address: 167.199.170.82/27 belongs to". He writes the binary representation of the IP address on the whiteboard: 10100111 11000111 10101010 01010010. He explains that the /27 notation indicates the prefix length. To find the number of addresses, he calculates the remaining host bits as 32 - 27 = 5, leading to a block size of 2^5 = 32. He then manually determines the range, writing 167.199.170.64 as the first address and 167.199.170.95 as the last address on the board, demonstrating a quick mental calculation technique before transitioning to a formal method.
2:00 – 4:15 02:00-04:15
The lecture shifts to a formal method using the "Address Mask" concept, displayed on a slide. The slide defines the address mask as a 32-bit number where the n leftmost bits are set to 1s and the rest are 0s. The instructor highlights three key formulas using bitwise operations: 1. Number of addresses in the block N = NOT(mask) + 1, 2. First address in the block = (Any address in the block) AND (mask), and 3. Last address in the block = (Any address in the block) OR (NOT mask). He demonstrates the binary mask for /27 as 11111111 11111111 11111111 11100000. He explains how applying the AND operation with the mask isolates the network portion for the first address, while the OR operation with the inverted mask sets the host bits to 1 for the last address.
The video effectively bridges intuitive calculation with formal bitwise logic. By first solving the problem manually to establish the answer, the instructor validates the subsequent formal method. The introduction of the address mask provides a systematic way to handle CIDR calculations, ensuring accuracy for any prefix length. This dual approach reinforces understanding by showing that the mask is essentially a tool to automate the process of finding the network and broadcast boundaries.