Proxy Server and Non-Persistent Vs Persistent Connections

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/computer-networks-security/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. About Course: About the Course
  2. Paper-2 | Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  3. Paper-2 | Databases / DBMS & SQL: 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: 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, Network Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, 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, Waveform Generators and Timer 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
  7. Paper-2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  8. 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
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning), Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
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…