Proxy Server and Non-Persistent Vs Persistent Connections

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/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. Quantitative Ability: Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Age Problems, Number System, Divisibility Rules, HCF LCM, Algebra, Permutation and Combination, Probability, Data Interpretation, Logarithm, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Speed Mathematics and Basic Mathematics
  2. Logical Reasoning: Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Data Sufficiency, Venn Diagram, Inequality, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Subject Verb Agreement (Verb Noun Agreement), Tenses, Articles, Preposition, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Facts, Inference and Judgements
  4. Programming Fundamentals (Technical): C Fundamentals
  5. Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  7. OOPs (Technical): Object Oriented Programming (OOPS)
  8. DBMS (Technical): 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
  9. SQL (Technical): SQL
  10. Operating Systems (Technical): 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
  11. Computer Networks (Technical): 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
  12. Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Coding/Automata Round: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir, Pseudo Codes
  14. Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
  15. Writing Assessment: English Writing Ability
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…