Packet Switching

Duration: 19 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-STET-COMPUTER-SCIENCE-COMPLETE-COURSE/unit-7-computer-networks/introduction-to-cn/switching-techniques/asset-packet-switching after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the course: About the Course
  2. Mathematical Aptitude: संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Divisibility Rules, प्रतिशत / Percentage, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, लाभ, हानि और बट्टा / Profit, Loss and Discount, समय और कार्य / Time and Work, घन क्षेत्रमिति / Solid Mensuration, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, समय, चाल और दूरी / Time, Speed and Distance, Age Problems, मिश्रण और एलिगेशन / Mixture and Alligation, Algebra, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, Pipe and Cistern, Trigonometry, Statistics, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers
  3. Logical Reasoning: श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, सादृश्यता एवं वर्गीकरण / Analogy and Classification, रक्त संबंध / Blood Relations, दिशा एवं दूरी / Direction and Distance, क्रम एवं रैंकिंग / Order and Ranking, अशाब्दिक तर्क / Non-Verbal Reasoning, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, Syllogisms, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, वर्णमाला एवं संख्या परीक्षण / Alphabet and Number Test, कथन आधारित तार्किक विवेचन / Statement-Based Reasoning, Analytical Reasoning (Counting Figures Reasoning), घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, कैलेंडर एवं घड़ी / Calendar and Clock, Clock
  4. General Knowledge: वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Chemistry, Biology, History, Geography, Polity, Indian Economy, समसामयिकी / Current Affairs, Static General Knowledge, राज्य विशेष सामान्य ज्ञान / State-Specific General Knowledge
  5. Art of Teaching: शिक्षण-अधिगम प्रक्रिया एवं कक्षा प्रबंधन / Teaching-Learning Process and Classroom Management, Learners & Learning Process, Factors Affecting Teaching, शिक्षण विधियाँ एवं उपागम / Teaching Methods and Approaches, सूक्ष्म शिक्षण एवं कक्षा संप्रेषण / Microteaching and Classroom Communication, शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी / Teaching Aids and Educational Technology, आकलन एवं मूल्यांकन / Assessment and Evaluation, शिक्षक: गुण, व्यावसायिक नैतिकता एवं विकास / Teacher: Qualities, Professional Ethics and Development, शैक्षिक नीतियाँ, अधिनियम एवं प्रशासन / Educational Policies, Acts and Administration, पाठ्यचर्या, कला एवं सह-शैक्षिक क्षेत्र / Curriculum, Arts and Co-curricular Areas, निर्देशन एवं परामर्श / Guidance and Counselling, दिव्यांग बच्चों की शिक्षा / Education of Children with Disabilities, Micro-Teaching & Teaching Skills, पाठ योजना / Lesson Planning
  6. Environmental Science: Environment
  7. Unit 1 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  8. Unit 2 | COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer
  9. Unit 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  10. Unit 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  11. Unit 4 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  12. Unit 5 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  13. Unit 6 | 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, Transaction Management, Concurrency Control
  14. Unit 7 | Computer Networks: 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
  15. Unit 8 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  16. Unit 9 | Object Oriented Programming: OOPS with C++
  17. Unit 10 | Web Development: HTML Basics, CSS, JavaScript-Basics, XML, Node.js, Git & Github, PHP
  18. Unit 11 | 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
  19. Unit 12 | IoT: Emerging Tech Trends, Cloud Computing, कंप्यूटर नेटवर्क / Computer Networks, Internet of Things
  20. Unit 13 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  21. Unit 14 | E-Commerce: Electronic Data Interchange and E-Commerce, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Physical Security and Cryptography Basics, Cyber Safety and Security
  22. Unit 15 | Multimedia: Multimedia
  23. Unit 16 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  24. Full Length Mock Tests — General Paper:
  25. Full Length Mock Tests — Computer Science (Paper II):
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces packet switching as a data transmission method where messages are divided into smaller units called packets, each transmitted independently without a dedicated communication path. The instructor explains the store-and-forward mechanism used by intermediate nodes, which receive complete packets, buffer them temporarily, examine destination addresses, and forward them to the next hop. A hand-drawn network diagram with source S, destination D, and intermediate routers R1-R5 illustrates how packets P1-P4 travel through the network. The lesson covers dynamic resource allocation, noting that packets may follow the same or different paths depending on routing algorithms. The instructor then discusses advantages such as better bandwidth utilization and no connection setup delay, alongside disadvantages including variable delay and out-of-order delivery. The lecture concludes with a comparative table contrasting circuit switching and packet switching across definition, connection type, efficiency, delay, reliability, bandwidth usage, and example uses, emphasizing that the Internet is based on packet switching.

Chapters

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

    The lecture opens with a slide titled '2. Packet Switching' defining the concept: messages are divided into smaller units called packets, transmitted separately without a dedicated communication path. The slide lists the Store and Forward mechanism steps: 'The complete packet is received,' 'temporarily stored in a buffer,' 'destination address is examined,' and 'forwarded to the next hop.' The instructor begins drawing a green network graph on the right side, starting with nodes R1 and R2 linked by a line, then expanding to include S, R3, R4, R5, and D connected by edges. Small green boxes labeled P1, P2, P3, and P4 appear above the source node S as he points toward it.

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

    The instructor traces the path of packet P1 from source S to intermediate node R1 using a pointer, illustrating how packets travel independently through the network. A red 'Buffer' label with a box diagram is drawn next to node R1 to show where packets are temporarily stored. The slide text emphasizes that 'Network resources are allocated dynamically as packets are transmitted' and 'Packets may travel through the same path or different paths depending on the routing algorithm used.' The instructor continues annotating the diagram with arrows showing packet flow through intermediate nodes, reinforcing that each node performs store-and-forward operations before passing the packet onward.

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

    The instructor adds a magenta buffer rectangle on the right side of the diagram with labels P1 and P2, illustrating how multiple packets can be stored simultaneously at a node. The Store and Forward section remains visible with its four steps: complete packet received, temporarily stored in buffer, destination address examined, and forwarded to next hop. The slide scrolls down to reveal a Resource Allocation section followed by Advantages and Disadvantages headings. The instructor points to the resource allocation content, explaining how network resources are shared dynamically rather than reserved for a single connection as in circuit switching.

  4. 10:00 – 15:00 10:00-15:00

    The slide displays a text section headed 'Resource Allocation' listing Advantages and Disadvantages, with the line 'Internet is based on Packet Switching.' The instructor points at the advantages including better bandwidth utilization and no connection setup delay, then lowers his hand toward a blue 'Circuit Switching' bar at the bottom of the slide. A later frame shows a hand-drawn network diagram in green and red with nodes S, R1-R4, D and packet labels P1, P2, P3 plus a red Buffer box. The disadvantages discussed include variable delay and out-of-order delivery of packets, which require reassembly at the destination.

  5. 15:00 – 18:30 15:00-18:30

    The lecture transitions to a comparative table contrasting circuit switching and packet switching across multiple aspects including Definition, Connection, Efficiency, Delay, Reliability, Bandwidth usage, and Example Uses. The instructor points to the Definition row explaining that circuit switching establishes a dedicated path while packet switching transmits packets independently. He then points to the Example Uses row, noting that circuit switching is used in traditional telephone networks while packet switching underpins the Internet. The table reinforces key differences: circuit switching has fixed delay and guaranteed bandwidth but lower efficiency, while packet switching offers better resource utilization at the cost of variable delay.

The lecture builds a coherent understanding of packet switching through progressive visual explanation. It begins with the core definition and store-and-forward mechanism, then uses a hand-drawn network diagram to make abstract routing concepts concrete. The instructor methodically traces packet paths, annotates buffer locations, and explains dynamic resource allocation before transitioning to a structured comparison with circuit switching. The pedagogical flow moves from definition to mechanism to practical implications (advantages/disadvantages) to comparative analysis, culminating in the real-world application that the Internet relies on packet switching. Key exam-relevant points include: packets are transmitted independently without dedicated paths, intermediate nodes perform store-and-forward (receive, buffer, examine destination, forward), resources are allocated dynamically, packets may take different routes, and the trade-off is better bandwidth utilization versus variable delay and potential out-of-order delivery.

Loading lesson…