Designing subnets for CIDR

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/RPSC-PROGRAMMER/paper-1-data-communication-network/net-layer-ip-addressing/cidr-vlsm/asset-designing-subnets-for-cidr after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Paper 1 | Reasoning Test: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Puzzle Solving (Puzzles), Venn Diagram, Analogy, Ranking, Order and Sequence, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Selection Decision Table (Decision Making), Logical Sequence Of Words, Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning), Calendar, Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Direction Sense, Algebra, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Profit, Loss and Discount, Constraint Puzzles, Speed, Time and Distance, Traverse Surveying, Ratio and Proportion, Time and Work, Mensuration, Permutations and Combinations, Clocks and Calendars, Data Interpretation, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Blood Relations, Data Sufficiency
  2. Paper 1 | Numerical Analysis: Number System, HCF LCM, Percentage, Ratio and Proportion (Ratios), Average, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Algebra, Statistics, Data Interpretation, Mental Ability, Arithmetic, Logarithm, Profit and Loss, Simple Interest and Compound Interest, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Permutation and Combination, Probability, Sequences and Series, Powers, Surds and Logarithms, Subject-Verb Agreement, Sentence Completion, Geometry, Sentence Structure and Correction, Data Sufficiency, Trigonometry, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Probability, Statistics, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Graph Theory, Combinatorics
  3. Paper 1 | General Knowledge: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge, Polity, Indian Economy
  4. Paper 1 | DBMS: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Transaction Management, Concurrency Control, Relational Calculus, Database Security & Authorization, Database Recovery
  5. Paper 1 | Data Communication & Network: 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, Network Security, Security in Mobile and Wireless Computing, Input Output Organisation, File Management, Hardware Basics, Terms & Abbreviations, Protocols & Services, Network Access Technologies, Cyber Safety and Security, Basics of COA
  6. Paper 2 | System Analysis & Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Security, Risk Management & Maintenance, extras
  7. Paper 2 | Programming Language (Java): Java Fundamentals, OOPS with Java, Array, String, IO & References, Generic & Collections, Multithreading, Java, Miscellaneous, Control Flow, OOPS with C++, Stack, C Fundamentals, Arrays & Pointers, Object Oriented Technology, Control Flow & Looping, Introduction to Python
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…