Lecture 9 - Congestion Control

0.0(0)
studied byStudied by 0 people
0.0(0)
full-widthCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/18

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

19 Terms

1
New cards

Congestion Control is implemented at the ____ Layer

Transport

2
New cards

Congestion Control measures capacity and demand in…

bps

3
New cards

When demand exceeds supply…

Que fills up

Packets are dropped

4
New cards

Traffic Jam

Too many packets on the network, wait in que, eventually transmit.

5
New cards

Bucket with a Leak Example

Hole (link) can only handle so much (capacity), fill up bucket (queue), overflow bucket (drop).

6
New cards

End-To-End Principle

Have “intelligent” end hosts and “dumb” core network

7
New cards

The senders manage…

End to end connections and congestion

8
New cards

Network provides

Acknowledgement (ACK) packets, recall CSMA

9
New cards

Under TCP, each sender keeps a congestion window

Limit on the number of unacknowledged packets a device can have. When ACK received, “slide” and receive

10
New cards

Sliding Windows are similar to Netflix DVD policy because…

Both allow you fixed number of m ovies at one time, pay for larger “window”

11
New cards

Under no congestion, cwnd should…

Grow, as it efficiently utilizes the network and TCP increases it linearly

12
New cards

Increase cwnd

By 1, if all outstanding packets received, by 1/cwnd for every packet that comes back

13
New cards

Inferring Congestion 1

If a sender waits a long time with no ACK, packet was probably lostfR

<p>If a sender waits a long time with no ACK, packet was probably lostfR</p>
14
New cards

Round Trip Time (RTT)

Time to receiver and back

15
New cards

Inferring Congestion Assumption 2

IIf sender received ACK for many future packets, packet was probably lost. Think of them going sequentially.

16
New cards

TCP Congestion Control: Loss-based

All or nothing approach.

Problem: often too late by the time losses are occurring

Delay-based: (how late/early was the packet)

17
New cards

Loss Based Congestion Inference

TCP Reno - Widely used in Windows OS.

Every RTT: Have all packets been received properly?

  • Yes: Increases cwnd by 1

  • No: Cut cwnd in half

18
New cards

Distributed Power Control

Objective: Match measured to desired SIRs, can reach equilibrium among transmitters.

19
New cards

Distributed Congestion Control

Objective: Match measured to desired transmission rates.