Gate 2008_

Duration: 11 min

This video lesson is available to enrolled students.

Return to /learn/UP-LT-GRADE-ASSISTANT-TEACHER-2025/cs-08-computer-networks/dll-flow-control/go-back-n-protocol/asset-gate-2008-2961 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. CS | 01 | Digital Logic and Circuits and Discrete Mathematical Structures: Digital Systems & Boolean Basics, Number System, Number Representation, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Permutation and Combination
  3. CS | 02 | Computer Organization and Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Multiprocessors
  4. CS | 03 | Data Structures and Algorithm: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Complexity Theory, Advanced Algorithms
  5. CS | 04 | Problem Solving through C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. CS | 05 | Object Oriented Techniques: Object Oriented Technology, Java
  7. CS | 06 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Unix OS
  8. CS | 07 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Query Processing & Optimization, File Organization & Indexing
  9. CS | 08 | 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, Hardware basics
  10. CS | 09 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. CS | 10 | Internet Technology, Web Design and Web Technology: Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, JavaScript-Basics, HTML Basics
  12. CS | 11 | System Analysis And Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance
  13. CS | 12 | Information Security and Cyber Laws: Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security
  14. CS | 13 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  15. GS Paper | 01 | Indian and World Geography: Geography
  16. GS Paper | 02 | History: History
  17. GS Paper | 03 | Indian Economy & Social Development: Indian Economy
  18. GS Paper | 04 | General Science: Biology, Chemistry, वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research
  19. GS Paper | 05 | Elementary Maths: संख्या पद्धति / Number System, Divisibility Rules, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, प्रतिशत / Percentage, लाभ, हानि और बट्टा / Profit, Loss and Discount, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, समय और कार्य / Time and Work, समय, चाल और दूरी / Time, Speed and Distance, Algebra, घन क्षेत्रमिति / Solid Mensuration, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, Statistics, Probability, Sequence and Series (Series), मिश्रण और एलिगेशन / Mixture and Alligation, Calculus, Trigonometry, Vectors, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, यूक्लिडीय ज्यामिति और क्षेत्रमिति / Euclidean Geometry and Mensuration, सांख्यिकी और प्रायिकता / Statistics and Probability, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers, समतल क्षेत्रमिति / Plane Mensuration, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics
  20. GS Paper | 06 | Indian Polity and Governance: Polity
  21. GS Paper | 07 | Current Events: समसामयिकी / Current Affairs
  22. UPLT Live Classes Notes: UPLT Live Classes
  23. UPLT Full Mock Tests Tier 1:
  24. UPLT Full Mock Tests Tier 2:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video analyzes a GATE 2008 networking problem concerning satellite link utilization and the Go-Back-N sliding window protocol. The instructor systematically extracts parameters from a problem statement involving a 1 Mbps link, 36,504 km satellite altitude, and a signal speed of $3 \times 10^8$ m/s. The core objective is to determine the packet size required to achieve 25% channel utilization given a window size of $N=127$. The lecture progresses from identifying the problem constraints to deriving the efficiency formula $U = \frac{N}{1+2\alpha}$, calculating propagation delay based on distance and speed, and finally solving for the transmission time to find the packet length $L$. The solution culminates in selecting option (C) 240 bytes as the correct answer.

Chapters

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

    The instructor introduces the GATE 2008 networking problem displayed on screen, which involves a satellite link connecting two ground stations. He begins by extracting the given parameters from the question text, specifically noting the bandwidth $B = 1$ Mbps and preparing to analyze the link geometry. The visible text on screen reads 'Q. A 1Mbps satellite link connects two ground stations' and lists the altitude as 36,504 km with a signal speed of $3 \times 10^8$ m/s. The instructor writes down the bandwidth value and draws a diagram of the satellite link between stations S1 and S2 to visualize the network topology. He identifies the target channel utilization as 25% and notes that the Go-Back-N sliding window protocol is used with a window size $N=127$. The goal is to find the packet size $L$ that satisfies these conditions among options (A) 120 bytes, (B) 60 bytes, (C) 240 bytes, and (D) 90 bytes.

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

    The instructor derives the formula relating efficiency ($n$), transmission time, and propagation delay to find the required packet size. The visible equations show the substitution of values like $1/4$ for efficiency and 127 for the window size. He writes down the relationship $n = \frac{U.T}{T.t}$ and sets up the equation with window size 127. The derivation shows $\frac{1}{4} = \frac{T_Dt \times 127}{T_d + 2 \times T_t}$ and simplifies it to $\frac{1}{4} = \frac{127}{1 + a}$, where $a$ represents the ratio of propagation delay to transmission time. The instructor focuses on the relationship between efficiency and window size, identifying transmission time versus propagation delay components. He calculates the propagation delay $T_p$ using the distance formula $\frac{D}{S}$ and shows the calculation on a digital calculator. The handwritten notes derive the efficiency formula $U = \frac{N}{1+2\alpha}$ and solve for $ $ using the window size of 127.

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

    The video demonstrates a step-by-step derivation for calculating packet size using channel utilization and sliding window parameters. The instructor solves the networking problem by relating channel utilization to window size and round-trip time, using satellite altitude and signal speed for propagation delay. He calculates transmission time to find packet size based on the derived formulas. The screen displays channel utilization formula, sliding window parameters, and packet size calculation steps. The instructor continues to manipulate the efficiency equation $\frac{1}{4} = \frac{127}{1 + a}$ to solve for the parameter $a$. Once $a$ is determined, he uses the definition of $a = \frac{T_p}{T_t}$ to find the transmission time $T_t$. The visible text on screen includes 'Channel Utilization Formula', 'Sliding Window Parameters', and 'Packet Size Calculation'. The instructor ensures the mathematical progression is clear, showing how the window size of 127 and utilization of $1/4$ constrain the possible values for transmission time.

  4. 10:00 – 11:08 10:00-11:08

    The screen displays the final steps of the networking problem regarding a 1Mbps satellite link with an altitude of 36,504 km. Handwritten notes detail the derivation for channel utilization using a go-back-127 sliding window protocol. Formulas calculate transmission time and propagation delay to solve for packet size $L$. The instructor circles option (C) 240 bytes as the final answer. The visible text on screen confirms the problem statement and options, while the handwritten notes show the completed calculation. The instructor concludes by verifying that 240 bytes is the correct packet size to achieve the specified 25% channel utilization with the given window constraints. The final answer is clearly marked on the screen, providing a complete solution to the GATE 2008 question.

The lecture provides a comprehensive walkthrough of solving a satellite link utilization problem using the Go-Back-N sliding window protocol. The instructor methodically breaks down the problem by first identifying all given parameters: bandwidth of 1 Mbps, satellite altitude of 36,504 km, signal speed of $3 \times 10^8$ m/s, and a required channel utilization of 25%. The core concept taught is the relationship between efficiency ($U$), window size ($N$), and the ratio of propagation delay to transmission time ($\alpha$). The efficiency formula $U = \frac{N}{1+2\alpha}$ is central to the solution. By substituting $U = 0.25$ and $N = 127$, the instructor solves for $ $. Once $ $ is found, he calculates propagation delay $T_p = \frac{2 \times 36504 \times 10^3}{3 \times 10^8}$ seconds. Using the relationship $\alpha = \frac{T_p}{T_t}$, he determines transmission time $T_t$. Finally, the packet size $L$ is calculated as $L = T_t \times B$, yielding 240 bytes. This solution demonstrates the practical application of data link layer protocols in satellite communication scenarios, emphasizing how window size and propagation delay impact channel efficiency.

Loading lesson…