



Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Material Type: Quiz; Class: Internetwork Programming; Subject: Electrical & Computer Engr; University: Georgia Institute of Technology-Main Campus; Term: Spring 2006;
Typology: Quizzes
1 / 5
This page cannot be seen from the preview
Don't miss anything!




Email Address
Prof. John A. Copeland Practice for April 11, 2006 Tel.: 404-894- E-Mail: [email protected] RULES. i This quiz is not open book. One original sheet of hand-written notes may be used. Calculators are ok. ii Answer all questions and show all work to receive full credit. Use back of sheets only if necessary. iii All sub-questions have the same weight. iv Please do not ask the proctors any questions during the exam about exam questions. Part of the test is understanding the question, as written, without supplemental information. If you feel additional data is needed to solve the problem, make (and state) an assumption and then work the problem. v. This is a time-limited test. All papers must be turned in 50 minutes after the start. If you find you are taking more than 10 minutes on a particular problem, move on and come back to that problem after finishing the others. The Georgia Honor Code applies (see last page). The actual test will be about 60% as long as this. Question 1 โ TCP with no Congestion. A 100 Mbps network connection has a 100 ms round trip time (RTT). A server begins sending maximum-size packets (after the initial SYN-ACK) using Slow Start. The client ACK's every packet (col. 2) or every-other (col.3), and has a receiver-window which holds 16 maximum-size packets. Show how many packets are sent in each RTT period below: Time Period Start (ms) No. Segments, when all ACKed No. Segments, when 1/2 ACKed 0 1 1 100 200 300 400 500 600 _____________ How long does it take the server to ramp up to maximum transfer rate (ms). _____________ If the maximum packet size is 1000 bytes, what is the maximum transfer rate (bytes/second). How and when is the receiver's maximum segment size (MSS) sent to the sent to the other host? How? _____________________________ When _________________________________________ How and when is the receiver's TCP window (WIN) sent to the sent to the other host?? How? _____________________________ When _________________________________________ The last WIN received was 8000, the last ACK number was 12000, and the last TCP segment sent had a SEQ number of
Question 3 โ Bandwidth-Delay Product a. If the round-trip time (RTT) for a dedicated 16 Mbit/s connection to California is 50 ms, what is the bandwidth-delay product of the link? ________________________(bits). b. What is the minimum TCP widow size that will allow this channel to be fully utilized? _______________ (bytes) c. What will the maximum throughput be if the window is half the value in b. above. ____________ (bits/s) d. What will the maximum throughput be if the window is twice the value in b. above. ____________ (bits/s) Question 4 โ TCP Response to Congestion - Lost and Out-of-Order Packets Once a TCP segment times out, a variable collision window-size is cwnd is used. For consistency, we consider cwnd to govern the number of segments sent during the initial Slow Start mode. SMSS (sender maximum segment size) was called segsize in the class slides, MSS in some of the books. Conditions at the sender may require SMSS to be smaller than the MSS value received for the other TCP host. What places an upper limit on the maximum number of outstanding (sent, but not ACKed) bytes besides cwnd?
After a time-out, the value of cwnd drops to _____________ times the maximum segment size (SMSS or segsize). After a time-out, the value of ssthresh drops to _____________ times the previous value of cwnd. cwnd then grows in _______________ mode until it reaches ssthresh. which is reduced to _______ times the value of ____________ before the time-out. After cwnd reaches ssthresh, cwnd grows linearly by adding SMSS bytes for approximately every Y number of maximum segments sent (ignore the incorrect SMSS/8 term in the slides and book). What is this linear mode (of cwnd increase) called? __________________________ For the case where the receiver ACKs every packet, Y = _____________________________ (in terms of cwnd, SMSS) For the case where the receiver ACKs every other packet, Y = _____________________________ (ditto) What is the maximum value of cwnd? ___________________ (or is it moot, see TCP Illustrated, p. 310, rule 1). Does cwnd or win (from the receiver) govern the bytes by (sequence number) that can be sent? ____________________ Question 5 โ TCP Fast Retransmission and Fast Recovery After a TCP sender receives __________ duplicate ACKs it retransmits the first missing segment. How many additional bytes (at a minimum) can be sent after each additional duplicate ACK is received?
How much does cwnd increase after each additional duplicate ACK is received? ________________ When does Fast Recovery operation start? ________________________________ When FR starts, cwnd is set equal to ___________ x cwnd-before-dup-ACK + _____________ SMSS. In Fast Recovery, how many SMSS bytes are added each RTT is all segments are ACKed (do not use SMSS/8 term):
(ignore the 500 ms tick rounding, round results up to 1 ms) Question 8โ Routing, Distance Vector, RIP The routing tables for RIP routers A, B, C are shown.
Question 9โ Routing, Link State, OSPF Every router (A, B, ..., J) has advertised the costs (delays) to all the other nodes. For example, node V broadcasts the following route advertisement message: "V, B:29, G:12, U:22, W:26" (In practice, only link states that have changed since the last broadcast are included in the message.) Based on all the advertisement messages, the network topology and link costs can be mapped. The letters below represent the nodes (routers) on the network. The numbers represent costs (delay-times) on the links between them. These nodes are all routers (no networks) and for simplicity routes have the same cost in both directions. A -----35-----C-----22-----U-----14-----D | | | | 45 29 4 5 | | | | B-----22-----V----56------W-----17-----X -> | | | | 11 12 16 20 | | | | F-----13----G-----21-----H-----45------J A. Using Dijkstra's technique, calculate the cost values of routes from node "A" to the following. A-[ ], F-[ ], C-[ ], G-[ ], J-[ ] B. Cross out (X) the links that are not on the sink tree for node A. Routers A,B,C,D are connected to Ethernet E. Show the way this would be diagrammed for an OSPF network diagram? How are the link-states from a network node advertised? __________________________ What is the costs? __________ Question 9โ Routing, Path Vector, BGP The Internet is composed of interconnected ________________ Systems (AS) that are linked by _______BGP routers. What are the three types of AS, and their defining characteristic? 1. ______________________________________
What information do Autonomous Boundary Routers advertise to their exterior neighbors?
To reduce the size of routing tables, network prefixes are _______________ as much as possible. Question 10 - Protocols for Router Updates All of these protocols use IP for updates. Indicate multicast IP by "Multi.-" before the transport layer protocols they use. RIP ______________________ OSPF _________________________ BGP _______________________________ Question 10 - DNS, HTTP, FTP, SMTP, SPAM, SSH questions - see first and last slides of slide set 16 for topics.