Intra-Domain Vs Inter-Domain Routing

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/computer-networks/net-layerrouting-protocol/routing-basics-flooding/asset-intra-domain-vs-inter-domain-routing 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, 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.

This lecture introduces intra-domain and interdomain routing, explaining that large internets are divided into autonomous systems (AS) because one routing protocol cannot update all routers. An AS is defined as networks and routers under a single administration, with internal routing called intradomain routing. A diagram shows AS A, B, and C connected by interdomain links using BGP. The lecture then classifies routing protocols into intradomain (distance vector like RIP, link state like OSPF) and interdomain (path vector like BGP). It contrasts routing metrics: RIP uses hop counts treating networks as equal, while OSPF allows variable cost assignments.

Chapters

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

    The video introduces intra-domain and interdomain routing. The slide titled 'Intra-domain and Interdomain Routing' explains that an internet is divided into autonomous systems (AS) because a single routing protocol cannot handle updating all routers. An AS is defined as 'a group of networks and routers under the authority of a single administration,' with internal routing called intradomain routing. A diagram illustrates multiple ASes (A, B, and C) connected by interdomain links using BGP routing. Red hand-drawn circles act as teaching cues, first enclosing AS C and later enclosing AS A and AS B. The legend identifies 'Interdomain link,' 'Intradomain link,' and 'Router.'

  2. 2:00 – 4:25 02:00-04:25

    The lecture classifies routing protocols into intradomain and interdomain categories using a hierarchical diagram. The 'Intradomain' branch splits into 'Distance vector' (RIP) and 'Link state' (OSPF), while the 'Interdomain' branch links to 'Path vector' (BGP). Red arrows and checkmarks emphasize these nodes. The slide transitions to routing metrics, explaining that RIP uses hop counts treating all networks as equal, while OSPF allows for different cost assignments based on service requirements. The text contrasts how these protocols determine optimum pathways.

The lecture progresses from defining autonomous systems to classifying routing protocols. It establishes that internets are divided into ASes due to scalability limits of single routing protocols. The core distinction is between intradomain routing (within an AS) and interdomain routing (between ASes). The protocol classification tree maps RIP to distance vector, OSPF to link state, and BGP to path vector. The final segment contrasts metrics: RIP's hop count versus OSPF's variable cost, highlighting how different protocols evaluate path optimality. This provides a foundational framework for understanding routing protocol selection and behavior.

Loading lesson…