Routing Strategies

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/operating-systems/distributed-systems/routing-connectivity/asset-routing-strategies after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Ability: Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Age Problems, Number System, Divisibility Rules, HCF LCM, Algebra, Permutation and Combination, Probability, Data Interpretation, Logarithm, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Speed Mathematics and Basic Mathematics
  2. Logical Reasoning: Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Data Sufficiency, Venn Diagram, Inequality, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Subject Verb Agreement (Verb Noun Agreement), Tenses, Articles, Preposition, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Facts, Inference and Judgements
  4. Programming Fundamentals (Technical): C Fundamentals
  5. Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  7. OOPs (Technical): Object Oriented Programming (OOPS)
  8. DBMS (Technical): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  9. SQL (Technical): SQL
  10. Operating Systems (Technical): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  11. Computer Networks (Technical): 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
  12. Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Coding/Automata Round: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir, Pseudo Codes
  14. Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
  15. Writing Assessment: English Writing Ability
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video presents a lecture on routing strategies in computer networks, covering three main types: fixed, virtual, and dynamic routing. The instructor explains that fixed routing involves a pre-determined path from source A to destination B, which is only changed in case of a hardware failure, and is efficient for minimizing communication costs. Virtual routing establishes a fixed path for the duration of a single session, allowing different sessions to use different paths, which is a partial solution to load changes. Dynamic routing is the most adaptive, where the path is chosen only when a message is sent, typically selecting the least used link to balance the load. The lecture also covers the role of a router as a communication processor with at least two network connections, which uses routing tables to determine the destination. It distinguishes between static routing, where the table is updated manually, and dynamic routing, where the table is updated via a routing protocol. The instructor uses on-screen text and hand-drawn diagrams to illustrate the concepts.

Chapters

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

    The video begins with a slide titled 'Routing Strategies' which introduces fixed routing. The text defines it as a path from A to B specified in advance, with changes only if a hardware failure occurs. It notes that the shortest path is usually chosen to minimize communication costs and that this method ensures messages are delivered in the order they were sent. The slide then introduces virtual routing, where a path is fixed for the duration of one session, allowing different sessions to have different paths, which is a partial remedy to load changes. The instructor draws a diagram of a path from A to B and writes 'updates' on it. The slide continues to describe dynamic routing, where the path is chosen only when a message is sent, and it usually selects the link least used at that time. This method adapts to load changes by avoiding heavily used paths but can result in messages arriving out of order. The problem of out-of-order delivery can be remedied by appending a sequence number to each message. The slide concludes by stating that dynamic routing is the most complex to set up. The instructor writes 'dynamic' on the slide.

  2. 2:00 – 2:22 02:00-02:22

    The video transitions to a new slide titled 'Routing Strategies (Cont.)'. The instructor explains that a router is a communications processor responsible for routing messages and must have at least two network connections. It checks its tables to determine the destination host and where to send messages. The slide differentiates between static routing, where the table is only changed manually, and dynamic routing, where the table is changed via a routing protocol. The instructor writes 'Routing Algorithms' on the slide and draws an arrow from it to the term 'routing protocol' to emphasize the connection. The instructor also mentions that a router may have a special purpose or just a function running on the host.

The lecture systematically progresses from the most static to the most dynamic routing strategies. It begins with fixed routing, which is simple and efficient but inflexible. It then introduces virtual routing as a compromise, offering session-level adaptability. Finally, it presents dynamic routing as the most sophisticated method, capable of real-time load balancing at the cost of complexity and potential message reordering. The lesson concludes by defining the router's role and the fundamental difference between static and dynamic routing table management, providing a comprehensive overview of how networks determine the path for data transmission.

Loading lesson…