Super Netting in ClassFul Addressing

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/TPSC-ASSISTANT-TECHNICAL-OFFICER/computer-networks/net-layer-ip-addressing/supernetting-spl-ips/asset-super-netting-in-classful-addressing after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Paper 2 | Computer Organization And Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Control Unit Design, Instr Formats & Modes, Programming the Basic Computer
  4. Paper 2 | Analog And Digital Communication: Introduction to Communication Systems & Random Signals, Analog Communication Systems, Information Theory & Digital Communication Fundamentals, Digital Modulation & Detection Techniques, Error Control, Synchronization & Multiple Access Techniques
  5. Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. Paper 2 | Data Structures And Programming: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  7. Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  8. Paper 2 | Compiler Design: 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
  9. Paper 2 | 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
  10. Paper 2 | Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  11. Paper 2 | Information Systems and Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Paper 2 | Computer Networks: 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
  13. Paper 2 | Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, CSS, XML, HTML5
  14. Paper 2 | Cyber Security And Emerging Technologies: Emerging Tech Trends
  15. Paper 2 | Cloud Technology: Cloud Computing
  16. Paper 2 | Probability and statistics: Probability, Statistics
  17. Paper-1 English: Vocabulary, Preposition, Articles, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage), Sentence Construction
  18. Paper 1 General Mental Ability & Logical reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Powers and Exponents (Surds and Indices), Algebra, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Arithmetic, Speed Mathematics and Basic Mathematics, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Analogy
  19. Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
  20. Full Length Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture introduces super netting in classful addressing as a method to combine multiple Class C blocks into a larger supernet, addressing the limitation that a single Class C block (256 addresses) is often insufficient for organizations. The instructor explains that super netting decreases the number of 1s in the subnet mask and contrasts it with subnetting, which increases routing table size. A hand-drawn diagram of four small circles enclosed by a larger circle illustrates the concept of combining blocks. The lecture then transitions to CIDR aggregation, presenting three rules: networks must be contiguous, all network sizes should be the same, and the first net ID should be divisible by the size of the block. A worked example performs CIDR aggregation on four /24 addresses (128.56.24.0/24 through 128.56.27.0/24). The instructor writes binary expansions of these addresses, identifies differing bits by drawing a vertical line and circling them, and begins deriving the aggregated prefix. The final visible result on the board is 128.56.24.0/32, though this appears to be an intermediate or partially visible step in the aggregation process.

Chapters

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

    The slide titled 'Super netting in Classful addressing' introduces the concept, noting that a Class C block with 256 addresses did not satisfy most organizations' needs. The instructor explains that an organization can apply for a set of Class C blocks instead of just one, forming a 'super network or a supernet.' A hand-drawn diagram appears showing four small circles enclosed by a larger circle, visually representing the combination of blocks. The slide also states that 'Super netting decreases the number of 1s in the mask,' which is underlined for emphasis.

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

    The instructor elaborates on the slide content, with red pen underlines added to key phrases such as 'increase size of routing table' and 'super netting.' The slide contrasts subnetting, which increases routing table size, with super netting as a counter idea. The instructor then transitions to a new slide titled 'Super netting / Aggregation with CIDR,' presenting three rules: all networks should be contiguous, the size of all networks should be the same, and the first net ID should be divisible by the size of the block. The instructor introduces a practical example asking to perform CIDR aggregation on four /24 IP addresses, beginning with '128.56.24.0/24' and '128.56.25.0/24.'

  3. 5:00 – 6:27 05:00-06:27

    The instructor writes binary expansions of the four listed /24 addresses (128.56.24.0/24, 128.56.25.0/24, 128.56.26.0/24, and 128.56.27.0/24) on the whiteboard. He draws a vertical line through the differing bits of each binary row and circles those bits, with an arrow pointing to the right, indicating where the prefix changes. At the bottom of the board, he writes '128.56.24.0/32' with a small red mark beside it, which appears to be part of the aggregation derivation process. The instructor gestures toward the binary rows with an open hand, emphasizing the bit-level analysis required for CIDR aggregation.

The lecture progresses from conceptual introduction to practical application. It begins by establishing the motivation for super netting: Class C blocks are too small for many organizations, so multiple blocks can be combined into a supernet. The key mechanism is reducing the number of 1s in the subnet mask, which expands the address range. The visual diagram of nested circles reinforces this idea. The lecture then formalizes the process through CIDR aggregation rules, ensuring that networks are contiguous, uniform in size, and properly aligned. The worked example demonstrates the bit-level analysis: by comparing binary representations of consecutive /24 addresses, the instructor identifies the common prefix and determines the aggregated network. The final visible result of 128.56.24.0/32 suggests the instructor is working through the prefix length determination, though the exact final aggregated prefix may not be fully visible in the sampled screenshots. The teaching flow moves from 'why' (organizational needs) to 'how' (CIDR rules and binary analysis), providing a structured approach to network aggregation.

Loading lesson…