Proxy Server and Non-Persistent Vs Persistent Connections

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/computer-networks/application-layer/http-protocol/asset-proxy-server-and-non-persistent-vs-persistent-connections 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.

The lecture introduces HTTP proxy servers as intermediary computers that cache recent responses to reduce latency and server load. The instructor uses a hand-drawn tree diagram of ovals linked by lines to illustrate how clients, proxies, and origin servers interact. The lesson then transitions to nonpersistent versus persistent connections, detailing the step-by-step process of a nonpersistent connection where one TCP connection is opened and closed for each request/response pair. The high overhead of this strategy is emphasized, noting that a server requires multiple buffers for each opened connection and that N+1 connections are needed for an HTML page with embedded objects. Finally, the lecture covers persistent connections as specified by default in HTTP version 1.1, highlighting advantages such as saved time and resources from avoiding repeated connection establishment round-trips. A brief mention of HTTP security notes that HTTP itself does not provide security but can run over the Secure Socket Layer (SSL) as HTTPS.

Chapters

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

    The slide titled 'Proxy Server' is displayed with the title underlined and later enclosed in a hand-drawn oval. The first bullet states: 'HTTP supports proxy servers. A proxy server is a computer that keeps copies of responses to recent requests.' The instructor sketches a hand-drawn tree diagram of ovals linked by lines beneath the bullets, progressively adding lines and circling several ovals in red while pointing at them. Visible slide text includes 'HTTP supports proxy servers' and 'keeps copies of responses to recent requests.'

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

    The lecture transitions to a slide titled 'Nonpersistent versus Persistent Connections,' with the two words underlined in red and black. The slide lists steps for nonpersistent connections: 'The client opens a TCP connection and sends a request' and 'The server sends the response and closes the connection.' Red underlines mark key phrases such as 'one TCP connection is made' and the example line stating the connection must be opened and closed N + 1 times. The instructor highlights the high overhead of the nonpersistent strategy, noting that a server needs multiple buffers for each opened connection.

  3. 5:00 – 6:42 05:00-06:42

    A slide titled 'Persistent Connections' states that 'HTTP version 1.1 specifies a persistent connection by default,' with key phrases underlined. An 'Advantages' section reads that 'Time and resources are saved using persistent connections' and that the round-trip time for connection establishment is saved. A later slide titled 'HTTP Security' notes that 'HTTP per se does not provide security' and can run over the 'Secure Socket Layer (SSL)' as HTTPS.

The lecture progresses from defining proxy servers and their caching role to contrasting nonpersistent and persistent HTTP connections. The hand-drawn tree diagram visually reinforces how proxies sit between clients and origin servers, storing recent responses for future requests. The nonpersistent connection model is broken down into discrete steps emphasizing the overhead of opening and closing a TCP connection for every request, quantified as N+1 connections for pages with embedded objects. Persistent connections are then presented as the HTTP 1.1 default, offering efficiency gains by reusing a single connection and eliminating repeated handshake round-trips. The brief security note contextualizes HTTP within the broader SSL/HTTPS framework, indicating that encryption is layered on top rather than built into HTTP itself.

Loading lesson…