Basics of Routing and Flooding

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/computer-network-and-information-security/net-layerrouting-protocol/routing-basics-flooding/asset-basics-of-routing-and-flooding after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, 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. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. Paper 2 | 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
  13. 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
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. 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

  1. 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. 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.

  3. 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.

Loading lesson…