Designing subnets for CIDR

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/computer-networks/net-layer-ip-addressing/cidr-vlsm/asset-designing-subnets-for-cidr after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware Basics, Network Security
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture focuses on the technical process of designing subnets using CIDR (Classless Inter-Domain Routing) notations. It begins by establishing the mathematical assumptions required for subnetting, such as total address counts and prefix lengths. The instructor then details the rules for calculating subnet prefixes and ensuring address blocks are valid powers of 2. The lecture transitions to discuss the drawbacks of traditional subnetting, specifically regarding address waste and routing complexity. Finally, it introduces supernetting as a strategic solution to aggregate smaller blocks and mitigate the limitations of Class C addressing and large routing tables.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The session opens with a slide titled "Designing subnets for CIDR Notations". The instructor lists key assumptions: the total number of addresses granted to an organization is N with a prefix length of n, while the assigned number of addresses for each sub-network is N_sub with a prefix length of n_sub. He emphasizes that the number of addresses in each sub-network must be a power of 2. A crucial formula is displayed: n_sub = 32 - log2(N_sub). To visualize this, the instructor draws a 32-bit IP address structure, dividing it into four 8-bit octets. He circles the last octet and writes binary numbers (00, 01, 10, 11) to explain how bits are allocated for subnetting, demonstrating the binary logic behind address division.

  2. 2:00 – 5:00 02:00-05:00

    The instructor elaborates on the rules, stating that the starting address in each sub-network must be divisible by the number of addresses in that sub-network, recommending that larger sub-networks be assigned first. He then moves to a slide on "Disadvantages of Subnetting". He highlights the "Loss of IP Addresses," circling the text "two IP addresses are lost" which are used for the network address and broadcast address (DBA). Other disadvantages include "Increased Complexity" in communication and "Increased Routing Table Size," which complicates management. He also points out the "Limitations of Class C Blocks," noting a maximum of 256 addresses is often insufficient. He draws a diagram showing a 24-bit Network ID and 8-bit Host ID to illustrate Class C structures.

  3. 5:00 – 5:19 05:00-05:19

    The final section introduces "Supernetting" as a counter idea and solution. The slide text explains that supernetting (aggregation of smaller blocks) was introduced to address issues of larger routing tables and address limitations. The instructor circles "Supernetting as a Solution" and draws a diagram of overlapping circles to represent the aggregation process. This visual aid helps explain how smaller blocks are combined to form a larger, more efficient network block, solving the scalability issues inherent in the previous subnetting methods discussed.

The lecture systematically guides students from the theoretical foundations of CIDR subnetting to its practical limitations. By first establishing the mathematical rules for prefix lengths and address allocation, it sets a clear baseline. The discussion then shifts to the operational downsides, such as wasted addresses and routing table bloat, before presenting supernetting as the necessary architectural evolution. This progression effectively connects the "how-to" of subnet design with the "why" of network optimization strategies.

Loading lesson…