TCP Chapter 3

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

1/41

flashcard set

Earn XP

Description and Tags

Last updated 1:47 AM on 3/8/23
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

42 Terms

1
New cards
Processes
Programs running on host machine - it is like a house
2
New cards
sockets
Processes communicate by sending messages into \___________ (they're like a door)
3
New cards
SSL
Brings security to TCP (which normally doesn't have encryption)
4
New cards
persistent
TCP uses \________ connection
5
New cards
TCP Socket
Souce - IP address

Source - Port # (Socket #)

Dest - IP address

Dest - Port Number
6
New cards
16
Port Numbers are \____ bits
7
New cards
UDP
Error detection is usually in the data link layer, but this isn;t a universal truth, so \________ has checksum error detection as a backup
8
New cards
rdt2.0
\________ deals with channels with errors
9
New cards
Network Layer
Logical communication between hosts
10
New cards
Transport Layer
Logical communication between processes
11
New cards
TCP
* reliable
* in-order delivery
* flow/congestion control
12
New cards
UDP
* unreliable
* best effort
* no in-order delivery
13
New cards
multiplexing
is a method by which multiple analog or digital signals are combined into one signal over a shared medium - Many to One - happens at source socket
14
New cards
demultiplexing
reconverts a signal containing multiple analog or digital signal streams back into the original separate and unrelated signals- One to Many - happens at destination socket
15
New cards
UDP
sends all data packets with the same port \# but different IP addresses will get sent to the same socket regardless with \_____
16
New cards
UDP Headers
Source Port #

Dest Port #

Length

Checksum
17
New cards
checksum
adding n bit strings and then adding the 1's compliment at the end to get a series of 1111111111's is the method for UDP ________ .

If anything is a 0, then there was an error
18
New cards
True
T/F UDP only has error detection, not error correction
19
New cards
1
rdt_.0 does not take errors or loss into account

only has

send(data)/make(data)+send(packet)

or

rcv(packet)/extract(packet, data)+deliver(data)
20
New cards
2
rdt_.0 used Ack/Nack to let sender know about erroneous packets
21
New cards
2.1
rdt_._ adds sequence numbers to Ack/Nack calls to help against duplicate packets
22
New cards
fast retransmit
TCP (two words) uses repeated Ack (triple ack) to know when there has been a packet loss
23
New cards
3
rdt_.0 deals with errors and loss

implements a countdown timer to resend packets if an Ack with the appropiate sequence number was not received within a certain timeframe
24
New cards
pipelining
sender allows multiple, "in-flight", yet-to-be-acknowledged pkts

can multiply the utilization rate of rdt
25
New cards
receiver window
the \______ \______ is 16 bits and used for flow control
26
New cards
UARPSF
these are single-bit flags in TCP

URG (not important)

Ack Valid # (0 or 1)

PSH (push data)

RST

SYN

FIN
27
New cards
32
both sequence number and acknowledgment number are \_________ bits in TCP
28
New cards
previously
Ack num

num is the __________ received number with no errors
29
New cards
current
Sequence num

num is the _________ message number of the connection
30
New cards
Estimated RTT
(1 - a ) * Estimated RTT + a * SampleRTT \=
31
New cards
DevRTT
(1 - B) * DevRTT + B * | SampleRTT - EstimatedRTT |
32
New cards
TimeOutInterval
TimeoutInterval \= EstimatedRTT + 4 • DevRTT
33
New cards
congestion
we experience packet loss / delay because of \________
34
New cards
skyrocket
queing delays \________ when packet arrival rate nears link capacity (La/R approaches 1)
35
New cards
goodput
the amount of usable data that crosses a given point in a network over a certain period of time (whats actually received)
36
New cards
R/4
retransmission causes throughput to go from R/2 to
37
New cards
T
T/F TCP adjusts send rate depending on congestion
38
New cards
Slow Start
the TCP protocol of starting to send data at 1 MSS ( maximum segment size )

double congestion window every RTT (exponential)

either restart this process or go down to congestion window/2 whenever a packet is lost
39
New cards
Reno
the TCP protocol of increasing linearly after a packet loss during a slow start
40
New cards
Tahoe
the TCP protocol of repeating the exponential growth of slow start, but starting at the cwnd/2 at the time of the packet loss
41
New cards
utilization
(L/R) / (RTT + L/R)
42
New cards
2(prop delay)
1 RTT \= \________ seconds