

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
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Material Type: Assignment; Professor: Riesen; Class: Introduction to Computer Networks; Subject: Computer Science; University: University of New Mexico; Term: Fall 2008;
Typology: Assignments
1 / 3
This page cannot be seen from the preview
Don't miss anything!
Exercise 1 : Silly window syndrome [10 points] Briefly explain what the silly syndrome is. What algorithm is used to prevent the syndrome from happening? How does that algorithm work, and what are some of the problems associated with it?
Exercise 2 : TFTP [30 points] TFTP is a simple file protocol. It is sometimes used to boot systems remotely. The booting machine sends out a TFTP request and a server responds with a kernel image that the client uses in the second stage of the boot. Request For Comments (RFC) are documents that describe protocols and procedures used on the Internet. RFC 1350 describes TFTP. Look at RFC 1350 and answer the following questions:
Exercise 3 : TCP state diagram [10 points] Consider the TCP state diagram shown in Figure 5.7 on page 392 of our textbook. When a connection is closed, we have to wait in the TIME WAIT state for twice the maximum segment lifetime before we can go to the CLOSED state. However, if we take the right-most path through the diagram we can reach CLOSED via CLOSE WAIT and LAST ACK without having to wait. Why can we do that without waiting as in the other path? Is it possible for both sides of the connection (the client and the server) to take this shortcut?
Exercise 4 : TCP data transmission [10 points] Assume host A sends two TCP segments to host B; one right after the other. The sequence numbers of the two segments are 100 and 120 respectively. Answer these questions:
Exercise 5 : Router queue management [10 points] Do exercise 6.11 on page 529 in the textbook. However, instead of using Table 6.2 in the book, use the one given here.
Packet Size Flow 1 210 1 2 210 1 3 210 1 4 140 2 5 230 2 6 90 3 7 110 3 8 100 3
Exercise 6 : TCP congestion window [20 points] Have a look at the following figure and answer the questions below. The figure represents the congestion window size during the first part of a TCP connection. Each step on the x-axis represents one round trip delay. The numbers on the y-axis represent the size of the congestion window in number of segments.