It's UWAweek 16 (1st semester, week 7)

help3002

This forum is provided to promote discussion amongst students enrolled in CITS3002 Computer Networks.

Please consider offering answers and suggestions to help other students! And if you fix a problem by following a suggestion here, it would be great if other interested students could see a short "Great, fixed it!"  followup message. How do I ask a good question?

Displaying selected article
Showing 1 of 201 articles.
Currently no other people reading this forum.


 UWA week 12 (1st semester, week 4) ↓
SVG not supported

Login to reply

👍x1
helpful
5:25am Tue 19th Mar, Christopher M.

"Henry Hewgill" <23*1*7*8@s*u*e*t*u*a*e*u*a*> wrote:
> Hi Chris, > > In the slides from last week's lecture, we should be recalculating the checksum for the acknowledgement before sending it, though this wasn't in the C code:
Hi Henry, Yes, you're correct - in practice, we should be calculating and verifying checksums for everything that could be corrupted (by the Physical Layer), so it applies for both data frames and acknowledgment frames. Those early slides trying to introduce concepts one at a time, so at the bottom of page 6 [CITS3002] the checksum should be calculated and checked before breaking from the inner loop. However, at that stage we have a problem, because we haven't yet introduced time into our protocols (using timers), so what should we do if the checksum of an arriving DLL_ACK or DLL_NACK frame is wrong? The sender has no concept of time, yet, and thus has no 'pathway' to retransmission of the original data. Moreover, if the receiver had correctly received the original data, it couldn't detect a duplicate retransmission because we haven't yet introduced sequence-numbers. Much of this is corrected by page 20 [CITS3002] where all frame types are checksummed, we have sequence-numbers, and timers to support retransmission. (but well picked up!)

The University of Western Australia

Computer Science and Software Engineering

CRICOS Code: 00126G
Written by [email protected]
Powered by history
Feedback always welcome - it makes our software better!
Last modified  5:07AM Sep 06 2023
Privacy policy