Lecture 2: Delays

0.0(0)
Studied by 0 people
call kaiCall Kai
Locked
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/12

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 11:07 AM on 9/15/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

13 Terms

1
New cards

What are the different forms of delays?

Processing, queing, transmission, propogation.

2
New cards

Propogation Delay is?

The time it takes for a bit to propogate from one end of a link to the other.
In this course assume speed s = 3×108 m/s (speed of light). Link length is d.
pprop = d/s

3
New cards

Transmission Delay is?

The time required to push all bits of a packet onto the physical link. It depends purely on the packet length (L) and the link rate (R):
dtrans = L/R

4
New cards

Queuing Delay is?

The time a packet has to wait to be transmitted onto a link.

A packet can be transmitted on a link only if there is no other packet currently being transmitted on that link. The queuing delay depends on the number and size of earlier-arriving packets that are queued and waiting for transmission onto the link.

5
New cards

Processing Delay is?

The time required to examine the packet’s header, determine where to direct the packet, check for bit-level errors, and more.

Is in the order of microseconds (or less) in modern routers.

In this course dproc → 0

6
New cards

Store-and-Forward transmission is?

Transmission where routers must receive a packet in its entirety before transmitting its first but onto the outbound link.

7
New cards

Traffic Intensity (I) is parameterized how?

I = L * a / R

L: packet length
a: arrival rate (packets/second)
R: link bandwith (bits/second)

8
New cards

Queuing Behavior depending on I

I ≈ 0: very small or negligible queuing delay
I → 1: delay increases exponentially
I > 1: Arriving rate exceeds transmission capacity; the queue grows indefinitely, resulting in buffer overflow and packet loss.

9
New cards

Ping measures?

Round-trip-time (RTT) ≈ 2*(dproc + dqueue + dprop)

10
New cards

Link capacity is?

The maximum achievable data rate R [bit/s] of a communication link.

11
New cards

Throughput is?

The rate of successful data delivery over a communication channel [bit/s].
Instantaneous: rate at given point in time.
Average: rate over range of time.

12
New cards

Goodput is?

The rate of data passed to the application layer [bit/s] (i.e., application-level throughput)

13
New cards

Jitter is?

variation in the end-to-end delay across consecutive packets. High jitter degrades real-time applications like VoIP or video calls.