Intra-Domain Vs Inter-Domain Routing

Duration: 4 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-intra-domain-vs-inter-domain-routing 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.

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…