Udacity Lesson 6 Flashcards

Quiz Content Covered in Udacity Lesson 6

1
Q

What is congestion control? why do we need it?

A

Fill the internets pipes without overflowing them

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Throughput less than the bottleneck length

A

Congestion Collapse

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Increase in load -> decrease in useful work

A

Congestion Collapse

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

cause of congestion collapse

A

spurious retransmission

undelivered packets

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

spurious retransmission

A

“better timers

tcp congestion control”

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

undelivered packets

A

congestion control of all packets

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

congestion control main goals

A

“use network resources efficiently

preserve fair allocatino of resources

avoid congestion collapse”

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

congestion control approaches

A

“end-to-end congestion control

network-assisted”

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

end-to-end congestion control

A

“no feedback from network

congestion inferred by loss and delay”

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

network-assisted congestion control

A

“routers provide feedback:
single bit for congestion
explicit rate specification”

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

tcp congestion control

A

senders increase rate until packet drop occurs

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

T/F: packet loss is always a sign of congestion

A

False.

Wireless networks can experience packet loss due to interference

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

packet loss occurs when

A

a router has no room in its buffer for incoming packets

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

window-based algorithm

A

“sender can only have certain number of packets ““in-flight”” referred to as ““window size””.

sender cannot send additional packets until ACK is returned from receiver.”

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

AIMD additive increase

A

increment window size based on number of returned ACK packets

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

AIMD multiplicative decrease

A

reduce window size by half

17
Q

AIMD

A

“Window-based congestion control: additive increase, multiplicative decrease.

Distributed, Fair, Efficient”

18
Q

Sending Rate: RTT, Packet size, Window_size

A

( Window_Size / RTT ) * ( Bits / Packet )

19
Q

Fairness

A

every sender gets fair share of network resources

20
Q

Efficiency

A

The network resources are used well.

21
Q

Phase Plot

A

see plot

22
Q

Multiplicative Decrease improves

A

fairness

23
Q

Additive Increase improves

A

efficiency

24
Q

Loss Rate

A

“1/2 * (w_m/2)*(w_m/2 + 1)

~w_m^2 / 8”

25
Q

Throughput

A

3/4 * w_m/(RTT)

26
Q

Solution to TCP Incast

A

“Finer granularity retransmission. (timers need to operate on a granularity close to that of the datacenter)

Fewer ACKs. (ACKs for every-other packet)”

27
Q

Jitter

A

Variation in transmission delay

28
Q

Which pathologies can streaming audio/video tolerate?

A

“Initial Delay

Minor Packet Loss

CANNOT tolerate Jitter”

29
Q

T/F: TCP is good for video/audio transmission

A

FALSE

30
Q

UDP

A

User Datagram Protocol

31
Q

Does UDP retransmit?

A

No

32
Q

Does UDP adapt sending rate?

A

No

33
Q

QoS

A

Quality of Service: Marking and Policing

34
Q

QoS problem with Fixed Bandwidth

A

leads to inefficiency

35
Q

Common QoS strategies

A

“Marking Packets by Priority

Scheduling High-Priority Queues”