Module 6: Transport Layer - TCP Flashcards

1
Q

When is a TCP segment sent?

A

Segment sent when…
1. Segment is full (max segment size)
2. not full , but times out
3. “pushed” by application

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

TCP segment

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

Initial Sequence Number

A

Why not start with 0?
- IP addresses and port numbers uniquely id a connection
- eventually though these port numbers do get used again

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

How do sender/receiver independently determine ISN?

A

3 way handshake
1. open connection: 3-way handshake
2. reliable byte stream transfer
3. close (tear down) connection

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

open connection: 3-way handshake

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

What if the SYN packet gets lost?

A

eventually no SYN-ACK arrives
- sender sets a timer and wait from SYN-ACK
- receiver sets a timer
- after timeout, resend

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

close connection

A

4-ways tear down

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

Why is stop and wait inefficient?

A

only one TCP segment is in flight at a time

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

Sliding Window

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

Go Back N (GBN)

A

transmit up to n unacknowledged packets
if timeout for ACK(k), k+1,…
not efficient if windows are large: high speed networks

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

What is an improvement on GBN?

A

Selective Repeat
GBN forces sender to retransmit all packets in window even if some have been received correctly

to avoid, we need a “finer granularity”of acknowledgements (individual acks as opposed to cumulative acknowledgements)

sender: transmit up to n unacknowledged packets

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

SR is great for _____

A

isolated loss
does not recover quickly from burst loss

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

What does TCP use for sliding window?

A

hybrid of GBN and SR

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

General observations about Sliding Windows

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

TCP Flow Control

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

Which of the following in the TCP header is especially important to flow control?

A

acknowledgement
advertised window
sequence number

17
Q

retransmission timeout

A

how to set timeout?
if too long: connection has low throughput
if too short: what if retransmit packet that was just delayed

solution: make timeout proportional to RTT

18
Q

RTT Estimation

A
19
Q

smaller alpha means slower reaction time. t/f

A

false

20
Q

karn/partridge algo

A
21
Q

The Karn/Partridge algorithm doubles the last timeout because if you are getting successive needs to timeout, it means there are losses in the network. T/F

A

True