Scribd
Upload
5 views1 page

Due Time: 11:59pm, March 9, 2025, Sunday Total Marks: 10 Points

This document outlines the requirements and questions for Homework Three in Comp 2322 Computer Networking, due on March 9, 2025. It includes tasks related to UDP and TCP checksums, file transfer calculations, and TCP connection performance metrics. The homework is worth a total of 10 points and specifies penalties for late submissions.

Uploaded by

cmy202388
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
5 views1 page

Due Time: 11:59pm, March 9, 2025, Sunday Total Marks: 10 Points

This document outlines the requirements and questions for Homework Three in Comp 2322 Computer Networking, due on March 9, 2025. It includes tasks related to UDP and TCP checksums, file transfer calculations, and TCP connection performance metrics. The homework is worth a total of 10 points and specifies penalties for late submissions.

Uploaded by

cmy202388
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Comp 2322 Computer Networking

Homework Three

Due time: 11:59pm, March 9, 2025, Sunday


Total marks: 10 points
Submission Requirements:
You need to submit the homework to the blackboard via Learn@PolyU on or before the due time. Late
submission will cause the marks to be deducted 25% per day.

Questions:

1. (2 points) UDP and TCP use 1’s complement for their checksums. Suppose you have the following
three 8-bit bytes: 01011011, 01100010, 01010110. What is the checksum value of these 8-bit
bytes?

2. (4 points) Consider transferring an enormous file of L bytes from Host A to Host B. Answer the
following questions:

a) Assume an MSS of 1500 bytes and the TCP sequence number field has 4 bytes. What is the
maximum value of L such that TCP sequence numbers are not exhausted? (2 points)

b) Assume that a total of 56 bytes of transport, network, and data-link header are added to each
segment before the resulting packet is sent out over a 1 Gbps link. Ignore flow control and
congestion control so A can pump out the segments back to back and continuously. For the L
you obtain in (a), find how long it takes to transmit the file. (2 points)

3. (4 points) Consider that only a single TCP (Reno) connection uses one 150Mbps link which does
not buffer any data. Suppose that this link is the only congested link between the sending and
receiving hosts. Assume that the TCP sender has a huge file to send to the receiver, and the
receiver’s receive buffer is much larger than the congestion window. We also make the following
assumptions: each TCP segment size is 1,500 bytes; the round-trip time of this connection is 500
msec; and this TCP connection always uses AIMD for congestion control (that is, it ignores slow
start).

a) What is the maximum window size (in segments) that this TCP connection can achieve? (1
point)

b) What is the average window size (in segments) and average throughput (in bps) of this TCP
connection? (2 points)

c) How long would it take for this TCP connection to reach its maximum window again after
recovering from a packet loss? (1 point)

You might also like