cp5601t8 - characters are contained in each segment sent...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CP5610 tutorial 8 (from textbook chapter 8) 34. Consider the three-way handshake in TCP connection setup (a) Suppose that an old SYN segment from station A arrives at station B, requesting a TCP connection. Explain how the three-way handshake procedure ensures that the connection is rejected. (b) Now suppose that an old SYN segment from station A arrives at station B, followed a bit later by an old ACK segment from A to a SYN segment from B. Is this connection request also rejected? 37. Are there any problems if the server in a TCP connection initiates an active close? 40. A fast typist can do 100 words a minute, and each word has an average of 6 characters. Demonstrate Nagle’s algorithm by showing the sequence of TCP segment exchanges between a client, with input from our fast typist, and a server. Indicate how many
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: characters are contained in each segment sent from the client. Consider the following two cases: (a) The client and server are in the same LAN and the RTT is 20 ms. (b) The client and server are connected across a WAN and the RTT is 100 ms. 43. Suppose that a TCP source (with unlimited amount of information to transmit) begins transmitting onto a link that has 1 Mbps in available bandwidth. Sketch congestion window versus time trajectory. Now suppose that another TCP source (also with unlimited amount of information to transmit) begins transmitting over the same link. Sketch the congestion window versus the time for the initial source....
View Full Document

This note was uploaded on 04/07/2010 for the course CP 1500 taught by Professor Cue during the Three '09 term at James Cook.

Ask a homework question - tutors are online