Assume out bit looks like this (0101011)Electronic errors. in other words , if the number of 1s in the frame is even and the flag is showing that correctly. Yet everything is looking great. but if receiver receives the frame and it will look like this (1010110), As you can see , The no. of 1s is still even , but the sequence if those bits is wrong. Parity check will still consider this frame as valid while in reality it is not because the order is of bits is wrong.
A checksum (also known as a hash sum) is a small size datum computed from a block of digital data. One would use a checksum to detect errors that could have been introduced during storage.
Checksum, Cyclic Redundancy Checks Google them,
time to live
Redundancy checking is a technique used to detect errors or errors in a data transmission. It involves adding extra bits to the data to create a checksum or parity. The receiver then checks for errors by recalculating the checksum or parity and comparing it to the received value. If they do not match, an error is detected.
A checksum is used solely to see if a file has changed or to see if two files contain exactly the same data. The chances of two different files having the same checksum is very, very small. If you change a file in any way, even by one byte, the checksum will change.
RIP messages are wrapped in a UDP package, which already has a checksum.
To generate a 16-bit checksum for data verification, the process involves dividing the data into 16-bit blocks, adding up all the blocks, and then taking the one's complement of the sum to obtain the checksum. This checksum can be appended to the data for verification purposes.
A checksum is used to determine that the information sent using the protocol has not been corrupted en-route.
Only TCP will automatically discard a packet with a bad checksum. UDP packets have a checksum field, but it is rarely used, and then only by the application (not UDP itself)
7b
128
yes