Proxy Server and Non-Persistent Vs Persistent Connections
Duration: 7 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Quantitative Aptitude: Number System, Divisibility Rules, HCF LCM, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Mixture and Alligation, Partnership, Age Problems, Time and Work, Pipe and Cistern, Speed Time and Distance, Algebra, Arithmetic, Data Interpretation, Sequence and Series (Series), Logarithm, Powers and Exponents (Surds and Indices), Permutation and Combination, Probability, Speed Mathematics and Basic Mathematics, Trigonometry
- Logical Reasoning: Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Syllogisms, Inequality, Data Sufficiency, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Venn Diagram, Logical Sequence Of Words, Calendar, Clock, Cubes & Dices, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
- Verbal Ability: Noun, Pronoun, Adjectives, Verb, Adverb, Tenses, Subject Verb Agreement (Verb Noun Agreement), Articles, Preposition, Conjunction, Modals, Determiner, Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Construction
- Data Structures (Domain Test): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms (Domain Test):
- OOPs (Domain Test): Object Oriented Programming (OOPS)
- DBMS (Domain Test): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
- SQL (Domain Test): SQL
- Operating Systems (Domain Test): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
- Computer Networks (Domain Test): 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 Security, Cloud Computing and IoT, Cyber and Info Security
- Coding: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir
- Written English Test: English Writing Ability
- Psychometric Test: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric 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
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: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.
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.

