# Supporting HTTP timing · example 1

Subject: Computer Networks

Exam: TEE

Reader: https://deep-learning-study-room.vercel.app/cn/#tee/practice/applications/http-time-1

Canonical: https://deep-learning-study-room.vercel.app/read/cn/tee/practice/applications--http-time-1/

Optional extension · no matching calculation in the two supplied papers

**Optional worked extension.** This calculation format was not found in the supplied December 2025 final or February 2026 re-exam. The numbers and practice marks are authored. Study the core concept and actual-paper questions first; this is extra explanation, not a TEE prediction.

### Practice question. A client fetches 3 equal objects sequentially. Each object is 10000 bytes; link rate=1000000 bit/s and RTT=50 ms. Ignore DNS, TLS, loss, processing, headers, slow start and parallelism. Compare separate nonpersistent TCP connections with one new persistent connection without pipelining. [5 practice marks]

#### Answer

## Given

n=3; RTT=50 ms; each payload=10000 B; rate=1000000 bit/s; ideal HTTP/1.x timing model.

## To find

Total time under each stated connection policy.

## Formula and why



$$
T_{non}=n(2RTT+T_{object})
$$





$$
T_{persistent}=RTT+n(RTT+T_{object})
$$



Nonpersistent uses one setup RTT plus one request/first-response RTT per object. Persistent pays setup once, then one sequential request RTT per object.

## Step-by-step solution

#### Step 1. Serialize one object

Tobject=10000×8/1000000 seconds = 80 ms.

#### Step 2. Separate connections

Tnon=3×(2×50+80)=540 ms.

#### Step 3. One persistent connection

Tpersistent=50+3×(50+80)=440 ms.

#### Step 4. Check the saving

540−440=100 ms = (3−1)×50; exactly the removed setup round trips.

**Final answer:** Nonpersistent=540 ms; persistent=440 ms.

#### What this result means

This is an explicitly simplified supporting numerical, not a measured prediction for modern browsers using multiplexing, TLS, caches and parallel connections.