Demo: Circuit Switching

Duration: 13 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/computer-networks/introduction-to-cn/switching-techniques/asset-demo-circuit-switching after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. Computer Networks: Introduction to CN, 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, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. 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
  10. 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
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), 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, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
  17. English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces circuit switching as a fundamental networking technique where a dedicated communication path is established between a source and destination before any data transmission occurs. The instructor begins by defining switching as the process of transferring data between sources and destinations via intermediate nodes, visually diagramming this with circles labeled 'S' for Source and 'D' for Destination. The core concept is that a dedicated path remains reserved until communication ends, ensuring all data travels through the same route without requiring further routing decisions. The lesson progresses to illustrate network topologies with multiple routers (R1 through R5), demonstrating how specific paths like S-R1-R2-R5-D are selected and reserved. The instructor then breaks down the process into three distinct phases: connection establishment, data transfer, and connection release. Finally, the lecture evaluates circuit switching within telephone networks by analyzing its advantages, such as guaranteed bandwidth and fixed delay, against disadvantages including setup delays, bandwidth wastage during idle periods, and vulnerability to link failures.

Chapters

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

    The instructor introduces the concept of switching as a process for transferring data between sources and destinations via intermediate nodes. He begins to visually diagram this concept by drawing circles to represent the source (S) and destination (D), illustrating the path data takes. On-screen text defines switching as establishing a dedicated communication path before transmission, emphasizing that the path remains reserved until communication ends. The instructor underlines key phrases like 'source to a destination' and draws the initial network diagram connecting S to D through intermediate routers (R1, R2), showing that no routing decisions are needed once the connection is set up.

  2. 2:00 – 5:00 02:00-05:00

    The instructor illustrates the concept of circuit switching by drawing a network topology with nodes labeled S, R1 through R5, and D. He writes out two distinct communication paths (S-R1-R2-R5-D and S-R1-R3-R5-D) to demonstrate how a dedicated path is established between source and destination. This visual aid supports the on-screen text explaining that once a connection is established, all data travels through the same dedicated path without further routing decisions. The instructor points to specific nodes in the network diagram to trace paths and highlights bandwidth (BW) reservations on links, reinforcing that a dedicated path is reserved for the entire duration of communication.

  3. 5:00 – 10:00 05:00-10:00

    The lesson transitions to defining the specific phases of circuit switching: connection establishment, data transfer, and connection release. The instructor points to 'Phase 1: Connection Establishment' bullet points on a new slide, explaining the initial setup required before data can flow. He continues to discuss how different paths can be established, such as S-R1-R2-R5-D or S-R1-R3-R5-D, emphasizing that a dedicated path is reserved for the entire duration of communication. The instructor points to network nodes R1, R2, R3 to illustrate potential routes from source S to destination D, highlighting that once a connection is established, all data travels through the same dedicated path without requiring further routing decisions.

  4. 10:00 – 13:05 10:00-13:05

    The instructor explains the advantages and disadvantages of circuit switching within a telephone network context. The slides detail specific benefits like guaranteed bandwidth, fixed delay after setup, and congestion-free communication with in-order delivery. Conversely, the disadvantages highlighted include connection setup delays, bandwidth wastage during idle periods where reserved bandwidth remains unused when no data is being transmitted, and the vulnerability of communication to link failures. The instructor points to 'Advantages' and 'Disadvantages' sections on the slide, explaining why circuit switching might be inefficient despite its reliability guarantees.

The lecture systematically builds an understanding of circuit switching by first defining the core mechanism: a dedicated path established before data transmission. The instructor uses visual diagrams of network topologies with labeled nodes (S, R1-R5, D) to concretize abstract concepts like path selection and reservation. Key evidence includes the explicit listing of two distinct paths (S-R1-R2-R5-D and S-R1-R3-R5-D) to show how specific routes are chosen. The teaching flow moves from definition to topology visualization, then to the procedural phases (establishment, transfer, release), and finally to a critical evaluation of pros and cons. The advantages section emphasizes reliability features like guaranteed bandwidth and fixed delay, while the disadvantages section highlights efficiency issues such as setup delays and idle bandwidth wastage. This progression ensures students grasp both the operational mechanics and the practical trade-offs of circuit switching in telephone networks.

Loading lesson…