Scribd
Upload
47 views

Computer Networks A4

This document contains questions and explanations about computer networks. Question 1 describes a scenario where Host A can send data at 100Mbps but the link only supports 80Mbps, and Host B can receive at maximum 40Mbps. Question 2 provides examples of transmission time calculations. Question 3 explains that the sequence number space must be at least twice the window size to avoid overlapping windows between sender and receiver. Question 4 performs calculations for maximum segment size and transmission time. Question 5 lists packet field values for a TCP connection.

Uploaded by

Eunice Wong
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
47 views

Computer Networks A4

This document contains questions and explanations about computer networks. Question 1 describes a scenario where Host A can send data at 100Mbps but the link only supports 80Mbps, and Host B can receive at maximum 40Mbps. Question 2 provides examples of transmission time calculations. Question 3 explains that the sequence number space must be at least twice the window size to avoid overlapping windows between sender and receiver. Question 4 performs calculations for maximum segment size and transmission time. Question 5 lists packet field values for a TCP connection.

Uploaded by

Eunice Wong
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Computer networks

Assignment 4

Q1.
There are two situations in this scenario. The first one is hast A can send data at a rate up to
100Mbps, but the link only can transfer data up to 80Mbps. And, the second one is hast B
only can receive data at rate no more than 40Mbps.

Q2.
a. 103 / 1010
= 10-7ms

10-7ms / (2+10-7)
=5 x 10-8

b. 106 / 1010
= 10-4ms

10-4ms / (2+10-7)
= 5 x 10-5

c. Using pipelining protocols can solve this case. It is because it wastes the
bandwidth(100GBps). From the result of a and b, the utilization is too small. And, if the
packet sixe increase, the utilization will increase. The network protocol limits the use of
physical resources. The sender only can send the next packet when it received the Ack.
Sender will wait for the Ack in the most of time.

Q3.
In order to avoid the scenario, we want to avoid having the leading edge of the receiver's
window wrap around in the sequence number space and overlap with the trailing. That is,
the sequence number space must be large enough to fit the entire receiver window and the
entire sender window without this overlap condition. So we need to determine how large a
range of sequence numbers can be covered at any given time by the receiver and sender
windows. Suppose that the lowest-sequence number that the receiver is waiting for is
packet m. In this case, it's window is [m, m+w-1] and it has received packet m-1 and the w-1
packets before that, where w is the size of the window. If none of those w ACKs have been
yet received by the sender, then ACK messages with values of [m-w, m-1] may
still be propagating back. If no ACKs with these ACK numbers have been received by the
sender, then the sender's window would be [m-w, m-1].
Thus, the lower edge of the sender's window is m-w, and the leading edge of the receiver
window is m+w-1. In order for the leading edge of the receiver's window to not overlap with
the trailing edge of the sender's window, the sequence number space must thus be big
enough to accommodate 2w sequence numbers. That is, the sequence number
space must be at least twice as large as the window size, k >= 2w.
Q4.
a. Maximum segment size
L = 232
L = 4294967296 bits

b. No. of segments
= 4294967296 / (512-64)
= 9586981
Total data
= 9586981 x 512
= 4908534053 bits
Time
= 4908534053 / (155 x 106)
= 31.6s

Q5.
a.
Sequence number: 347
Source port number: 80
Destination port number: 302

b.
Acknowledgment number: 397
Source port number: 302
Destination port number: 80

c.
Acknowledgment number: 347

d.

You might also like