Intra-Domain Vs Inter-Domain Routing
Duration: 4 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Paper 1 | Reasoning Test: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Puzzle Solving (Puzzles), Venn Diagram, Analogy, Ranking, Order and Sequence, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Selection Decision Table (Decision Making), Logical Sequence Of Words, Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning), Calendar, Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Direction Sense, Algebra, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Profit, Loss and Discount, Constraint Puzzles, Speed, Time and Distance, Traverse Surveying, Ratio and Proportion, Time and Work, Mensuration, Permutations and Combinations, Clocks and Calendars, Data Interpretation, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Blood Relations, Data Sufficiency
- Paper 1 | Numerical Analysis: Number System, HCF LCM, Percentage, Ratio and Proportion (Ratios), Average, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Algebra, Statistics, Data Interpretation, Mental Ability, Arithmetic, Logarithm, Profit and Loss, Simple Interest and Compound Interest, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Permutation and Combination, Probability, Sequences and Series, Powers, Surds and Logarithms, Subject-Verb Agreement, Sentence Completion, Geometry, Sentence Structure and Correction, Data Sufficiency, Trigonometry, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Probability, Statistics, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Graph Theory, Combinatorics
- Paper 1 | General Knowledge: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge, Polity, Indian Economy
- Paper 1 | DBMS: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Transaction Management, Concurrency Control, Relational Calculus, Database Security & Authorization, Database Recovery
- Paper 1 | Data Communication & Network: 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, Network Security, Security in Mobile and Wireless Computing, Input Output Organisation, File Management, Hardware Basics, Terms & Abbreviations, Protocols & Services, Network Access Technologies, Cyber Safety and Security, Basics of COA
- Paper 2 | System Analysis & Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Security, Risk Management & Maintenance, extras
- Paper 2 | Programming Language (Java): Java Fundamentals, OOPS with Java, Array, String, IO & References, Generic & Collections, Multithreading, Java, Miscellaneous, Control Flow, OOPS with C++, Stack, C Fundamentals, Arrays & Pointers, Object Oriented Technology, Control Flow & Looping, Introduction to Python
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
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: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.

