Supernetting CIDR

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/UP-LT-GRADE-ASSISTANT-TEACHER-2025/cs-08-computer-networks/net-layer-ip-addressing/supernetting-spl-ips/asset-supernetting-cidr after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. CS | 01 | Digital Logic and Circuits and Discrete Mathematical Structures: Digital Systems & Boolean Basics, Number System, Number Representation, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Permutation and Combination
  3. CS | 02 | Computer Organization and Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Multiprocessors
  4. CS | 03 | Data Structures and Algorithm: 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, Complexity Theory, Advanced Algorithms
  5. CS | 04 | Problem Solving through C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. CS | 05 | Object Oriented Techniques: Object Oriented Technology, Java
  7. CS | 06 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Unix OS
  8. CS | 07 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Query Processing & Optimization, File Organization & Indexing
  9. CS | 08 | 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
  10. CS | 09 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. CS | 10 | Internet Technology, Web Design and Web Technology: Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, JavaScript-Basics, HTML Basics
  12. CS | 11 | System Analysis And Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance
  13. CS | 12 | Information Security and Cyber Laws: Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security
  14. CS | 13 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  15. GS Paper | 01 | Indian and World Geography: Geography
  16. GS Paper | 02 | History: History
  17. GS Paper | 03 | Indian Economy & Social Development: Indian Economy
  18. GS Paper | 04 | General Science: Biology, Chemistry, वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research
  19. GS Paper | 05 | Elementary Maths: संख्या पद्धति / Number System, Divisibility Rules, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, प्रतिशत / Percentage, लाभ, हानि और बट्टा / Profit, Loss and Discount, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, समय और कार्य / Time and Work, समय, चाल और दूरी / Time, Speed and Distance, Algebra, घन क्षेत्रमिति / Solid Mensuration, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, Statistics, Probability, Sequence and Series (Series), मिश्रण और एलिगेशन / Mixture and Alligation, Calculus, Trigonometry, Vectors, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, यूक्लिडीय ज्यामिति और क्षेत्रमिति / Euclidean Geometry and Mensuration, सांख्यिकी और प्रायिकता / Statistics and Probability, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers, समतल क्षेत्रमिति / Plane Mensuration, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics
  20. GS Paper | 06 | Indian Polity and Governance: Polity
  21. GS Paper | 07 | Current Events: समसामयिकी / Current Affairs
  22. UPLT Live Classes Notes: UPLT Live Classes
  23. UPLT Full Mock Tests Tier 1:
  24. UPLT Full Mock Tests Tier 2:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture provides a detailed tutorial on supernetting within the context of Classless Inter-Domain Routing (CIDR). The instructor presents a specific problem where four /24 networks must be merged into a single supernet. He begins by listing the specific IP addresses involved and then outlines the critical rules that must be satisfied for supernetting to work correctly. The lecture progresses through a step-by-step calculation, converting decimal IP addresses to binary to identify the common prefix bits, ultimately determining the correct supernet address and subnet mask for the aggregated block.

Chapters

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

    The instructor introduces the problem statement displayed on the slide, which lists four IP networks: 200.1.0.0/24, 200.1.1.0/24, 200.1.2.0/24, and 200.1.2.0/24. He explicitly reads out the 'Rules for Super netting in CIDR' written below the list. These rules state that 'All network should be contiguous' and the 'first net id should be divisible by size of the block.' He emphasizes that these conditions are prerequisites for successful aggregation, ensuring that the networks can be logically grouped together without gaps.

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

    The instructor begins the technical analysis by writing down the third octet of the IP addresses in decimal and binary formats on the whiteboard. He writes 200.1.0.0, 200.1.1.0, 200.1.2.0, and 200.1.2.0 (noting the likely typo in the slide for the last entry, as he proceeds to treat it as a block of 4 contiguous networks). He converts the third octet values (0, 1, 2, 3 implied) into binary, writing 00000000 and 00000011. He identifies that the first six bits of the third octet are identical across the block. He calculates the new prefix length by adding the first two octets (8 + 8) to the common bits in the third octet (6), resulting in a /22 mask. He writes 200.1.00000000 and 200.1.00000011 to visualize the range. He explains that since the block size is 4, the last two bits must change, allowing for 4 distinct subnets within the supernet.

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

    The instructor finalizes the solution by writing the final supernet address 200.1.0.0/22 on the board. He draws a visual representation of the block, showing how the 4 individual /24 networks fit together under the single /22 supernet. He circles the /22 notation to highlight the final answer. He reinforces the concept that the block size of 4 requires the last two bits of the third octet to vary, while the first six remain constant, effectively summarizing the aggregation process. He emphasizes that the resulting network covers the range from 200.1.0.0 to 200.1.3.255.

The lecture effectively demonstrates the practical application of supernetting rules. By moving from the abstract rules of contiguity and divisibility to concrete binary calculations, the instructor shows how to derive a /22 mask from four /24 networks. The key takeaway is identifying the common prefix bits to determine the new subnet mask, ensuring efficient IP address allocation and routing table optimization.

Loading lesson…