Basics of Routing and Flooding

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/HEXAWARE-PREPARATION/computer-networks/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. Quantitative Ability: Speed Mathematics and Basic Mathematics, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Speed Time and Distance, Number System, HCF LCM, Data Interpretation, Age Problems, Mixture and Alligation, Partnership, Algebra, Sequence and Series (Series), Mensuration and Geometry, Arithmetic
  2. Reasoning Ability: Puzzle Solving (Puzzles), Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Syllogisms, Data Sufficiency, Ranking, Order and Sequence, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Calendar, Clock, Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning), Data Arrangement, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning)
  3. Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Vocabulary, Sentence Completion (Fill in the blanks), Active Passive Voice (Voice), Direct and Indirect Speech, Subject Verb Agreement (Verb Noun Agreement), Tenses, Preposition, Articles, Sentence Correction (Error Correction)
  4. Programming Basics (MCQs + Interview): C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir
  5. OOPs (MCQs + Interview): Object Oriented Programming (OOPS)
  6. DBMS (MCQs + Interview): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Transaction Management, Decomposition Properties & 4NF, Concurrency Control, Database Recovery, File Organization & Indexing, Relational Algebra, Database Security & Authorization
  7. SQL (MCQs + Interview): SQL
  8. Operating Systems (MCQs + Interview): Introduction to OS, Process Management, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Process Synchronization, Disc Scheduling, File Management, Security
  9. Computer Networks (MCQs + Interview): 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, Network Security, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
  10. Coding: Coding Questions by Yash Sir
  11. HR Interview: MR & HR Interview Preparation
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…