Basics of Routing and Flooding
Duration: 6 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- General Intelligence & Reasoning: Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Logical Sequence Of Words, Syllogisms, Venn Diagram, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Data Sufficiency, Puzzle Solving (Puzzles), Data Arrangement, Cubes & Dices, Calendar, Clock, Arithmetic, Number System, HCF LCM, Verbal Analogy (Word Based Analogy), Visual Recognition and Figure Completion, Paper Folding and Cutting, Transformation of Shapes, Clocks and Calendars, Direction Sense, Cubes and Dice, Patterns in Two-Dimensional Figures, Seating Arrangements, Analogy and Classification, Logical Deduction and Induction, Alphabet and Word Tests, Mathematical Operations, Series Completion, Simplification and Approximation, Coding and Decoding, Numerical Reasoning, Assembling and Grouping of Shapes, Three-Dimensional Patterns and Visualization, Vocabulary, Number System, Averages, Mixtures and Alligation, Simple and Compound Interest, Percentages, Algebra, Speed, Time and Distance, Seating and Arrangement Puzzles, Traverse Surveying, Order, Ranking and Sequence, Constraint Puzzles, Syllogisms and Venn Diagrams, Reading Comprehension, Critical Reasoning, Permutations and Combinations, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Ratio and Proportion, Time and Work, Mensuration, Data Interpretation, Powers, Surds and Logarithms, Sequences and Series, Articles and Determiners, Sentence Completion, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Mixture and Alligation, Sequence and Series (Series), Speed Time and Distance, Algebra, Profit and Loss, Powers and Exponents (Surds and Indices), Permutation and Combination
- General Awareness: Physics, Chemistry, Biology, History, Geography, Polity, Indian Economy, Environment, Static General Knowledge, GK- Current Affairs, Artificial Intelligence, MS Office Applications, Terms & Abbreviations, Keyboard Shortcuts, Evolution of Indian Banking (Banking & Financial Awareness), Emerging Tech Trends
- Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics
- Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Number Systems and Codes, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Waveform Generators and Timer Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Latches and Flip-Flops, Finite State Machines, Sequential Circuits and State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Latches and Flip-Flops, Number Systems and Codes, Registers and Counters
- Computer Organisation & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Register Transfer and Microoperations, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output, Registers and Counters
- Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, HTML Basics, OOPS with C++, Java, Object Oriented Technology
- Databases: 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, Database Security & Authorization
- Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Theory of Computation: 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
- 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
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Security, Windows OS, Distributed Systems, Unix OS, Linux OS
- Computer Networks: Introduction to CN, 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, Data Communication, Website, Browser & Services, Web Design & Development, Network Security, Cyber Threats and Malware Attacks, Cyber Safety and Security
- Full Length Mock Tests:
- Sectional Tests:
- Paper 2 - Full-length Mock Tests:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The lecture introduces routing and flooding in IP networks. It begins by defining the core problem: when a router receives an IP packet with a destination address, it must decide which interface to send the packet out of. This decision is made using a routing table. The instructor distinguishes between 'routing,' which refers to designing or building the routing table, and 'switching,' which is the act of forwarding a packet along a selected path. The lecture then transitions to an alternative approach called flooding, which asks whether a packet can reach its destination without any routing table. The answer is yes: instead of identifying the shortest path, the packet can be sent to all possible paths. This guarantees that at least one copy of the packet will reach the destination, making flooding highly reliable and independent of any routing algorithm. The advantages of flooding listed on screen include no routing algorithm requirement, shortest path guarantee (in the sense that all paths are explored), and high reliability.
Chapters
0:00 – 2:00 00:00-02:00
The instructor presents a slide titled 'Problem' with a red underline. The first bullet states: 'Here problem is when a router receives an IP packet with destination address then how can it decide to interface send this packet.' The second bullet explains that 'This decision at the router, is taken with the help of a routing table.' The third bullet clarifies that designing a routing table is called 'routing,' while sending a packet along a path is 'switching.' The instructor gestures and points to the slide text while explaining these foundational concepts.
2:00 – 5:00 02:00-05:00
The lecture continues with the 'Problem' slide, reinforcing that a router uses a routing table to decide which interface to forward an IP packet out of. The instructor emphasizes the distinction between routing (table design) and switching (packet forwarding). Around 185 seconds, the topic shifts to flooding: the instructor asks whether a packet can reach its destination without a routing table. The slide text reads: 'One question, is it possible that a packet reaches its destination without routing table, actually yes…' and 'That is instead of trying to identify the shortest path, we can send it to all possible way and then we can be sure…' The phrase 'at least one packet will reach the destination' is underlined, highlighting flooding's reliability.
5:00 – 6:02 05:00-06:02
The final segment focuses on the advantages of flooding. A slide titled 'Flooding Advantage' lists three key benefits: 'No Routing Algorithm is required,' 'Shortest Path is guaranteed,' and 'Highly Reliable.' The instructor points to each advantage while explaining that flooding eliminates the need for complex routing algorithms and ensures delivery by sending packets along every possible path. The underlined text from the previous slide remains visible, reinforcing that flooding guarantees at least one packet reaches the destination.
The lecture progresses from defining the routing problem to introducing flooding as an alternative. First, it establishes that routers use routing tables to make forwarding decisions, distinguishing routing (table construction) from switching (packet forwarding). Then it introduces flooding as a method that bypasses routing tables entirely by sending packets to all possible paths, guaranteeing delivery. The key takeaway is that flooding trades efficiency for simplicity and reliability, requiring no routing algorithm but ensuring the destination is reached.

