Makeup Quiz (1 + 2)

- 30 of our 90 questions from last quizzes will be used

- Quiz 1 + 2 will be returned on Monday

Homework and Labs

- Lecture Slides
- Textbooks
- Library Access
- YouTube videos are allowed

Midterm 3/18
MATERIAL -
- Formula heavy
- Packet size / link capacity rate (Be bale to calculate transmission delay)
Slide 2
- Slide 3 queuing and loss - queuing is receiving packets to be received
fully, loss happens when queue is full and packets are locked out and loss.
- Propagation delay, queueing delay, transmission delay, processing delay
- E2E equals the sum of all the above
- Know the speed of light (3 * 10^8)
- Definition and Calculation of Throughput (bits/time)
- How many bits can our link hold in a given second of continuous flow
- Instantaneous throughput
- Know Internet Protocol Stack (Application, Transport, Network, Data Link,
Physical)
- Application (FTP, SMTP, HTTP)
- Transport (TCP, UDP)
- Network (IP)
- Data Link Layer (802.111 (WiFi), PPP
- Persistent vs. non-persistent HTTP
- Calculate the response time for non-persistent HTTP time (Slide 11)
- Non-persistent HTTP response time = 2RTT + file transmission time
- Persistent - Opens up the connection and keeps it open
- Non-persistent - Only opens the connection when it needs to,
- requires 2 RTTs per object
- File distribution time : Client-server (Either a question about this...)
- Know the formula on Slide 14
- Distribution time of Client-server approach
- File Distribution time: P2P (... Or this)
- Know the formula on Slide 15
- No BitTorrent Questions!
- Know UDP segment format (Checksum, dest and source port numbers, length)
- UDP is used for videos, phone calls, dns queries
- Know UDP checksum
- There will be at least 2 questions about checksum in general
- Be able to add them together, given some 16 bit integer, you'd be asked
"What is the checksum?" (Slide 22)
- Know rdt3.0 and the new assumption on Slide 23
- The "Approach" Slide 23
- rdt3.0 in action on Slide 24
- You most likely will be asked to finish a sender/receiver diagram on slide
24 and 25
- ACK Loss ad Packet Loss
- You must mention detect duplicate for ACK Loss)
- Out of the four scenarios in Slides 24 and 25, be able to finish the
diagram
- Performance of rdt 3.0
- Know Dtrans and Usender (On slide 26)
 - RTT and Utilization (Slide 26 + 27)
- How does pipelinining improve utilization over rdt3.0
- What is a pipelined protocol?
- Know how pipelining formula changes as more packets are added (Slide 30)
- Differences between Go-Back-N (GBN) and Selective Repeat
- Differences in ACK Behavior and Retransmission
- Slide 33 about GBN in action
- You may be asked to draw the diagram or explain what is happening on a
diagram.
- You will not have to write any programming at all
- Understand slide 38
- Know TCP overview on slide 39
- No question from Quiz 1 or Quiz 2 will given again during the Test
- It's possible that a question from HMWK 1 will be repeated.
- Slide 40 TCP Overview and the terms with how seq and ACK work here
- Slide 42
- Slide 44 (At least one question about the following)
- How does TCP handle Lost ACK scenario and premature timeout (important) and
the one on Slide 45
- Know what flow control is
- No Congestion control questions
- How does TCP have its receiver-side buffering check diagram on Slide 47
- Ignore Slide 48

WORKED-OUT PROBLEMS
- Size of Packet - 2000 bits
- A--------------B With a 2Mbps link rate and RTT = 20ms
- Assume that the link is error free, what is the possible max rate of transmission
for stop-and-wait, GBN and SR protocols
- A) Stop-and-wait
- Rmax = Length of Packets/Rate = (2000/2Mbps) + 20ms = (2000 / 2*10^6)
+ 0.02 = ?
- Stop&Wait needs to wait for the ACK of each packet before
transmitting the next one.
- B) GBN
- If window size is smaller than N than the max rate is
- See photo
- Under these conditions Selective Repeat and GBN are the same.
- C)

PARAMETERS
- 0 M/C questions
- No Fill in the Blank Questions
- Just numerical problems and protocols
- No definitions or Theory-based questions
- TA has all answers for HMWK 1, get them all.

(P/R) + RTT