UDP and TCP use 1's complement for their checksums. Suppose you have the following three 8-bit bytes: 01010101, 01110000, 01001100. What is the 1's complement of the sum of these 8-bit bytes? (Note that although UDP and TCP use I6 bit words in computing the checksum, for this problem you are being asked to consider 8-bit summands). Show all work. Why it is that UDP takes the 1's complement of the sum; that is, why not just use the sum? With the 1's complement scheme, how does the receiver detect errors? Is it possible that a one-bit error will go undetected? How about a two-bit error?

UDP and TCP use 1's complement for their checksums. Suppose you have the following three 8-bit bytes: 01010101, 01110000, 01001100. What is the 1's complement of the sum of these 8-bit bytes? (Note that although UDP and TCP use I6 bit words in computing the checksum, for this problem you are being asked to consider 8-bit summands). Show all work. Why it is that UDP takes the 1's complement of the sum; that is, why not just use the sum? With the 1's complement scheme, how does the receiver detect errors? Is it possible that a one-bit error will go undetected? How about a two-bit error?

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter9: Computer Networks

Section: Chapter Questions

Problem 10VE

See similar textbooks

Similar questions

UDP and TCP use 1s complement for their checksums. Suppose you have the followingthree 8-bit bytes: 01010011, 01100110, 01110100. What is the 1s complement of the sum ofthese 8-bit bytes? (Note that although UDP and TCP use 16-bit words in computing thechecksum, for this problem you are being asked to consider 8-bit sums.) Show all work. Why is itthat UDP takes the 1s complement of the sum; that is, why not just use the sum? With the 1scomplement scheme, how does the receiver detect errors? Is it possible that a 1-bit error will goundetected? How about a 2-bit error?
UDP and TCP use 1’s complement for their checksums to detect errors. Suppose you have the following 8-bit bytes: 11011001, 01010010, 11001010, 10100100 and 01011001. A. What is the 1’s complement of the sum of these 8-bit bytes? Show all the details of your work. B. Why do UDP and TCP take the 1’s complement of the sum as their checksum? That is, what do UDP and TCP not simply use the sum of these bytes as checksum? C. With the 1’s complement scheme, how does the receiver detect errors? D. With this checksum scheme, is it possible that any l-bit error will go undetected? How about a two-bit error? Explain your answer.
UDP and TCP use one’s complement for the checksum. Suppose you have the flowing four 8-bit data in a datagram: 10011011, 01011100, 11001101. 10101001 a) What is the one’s complement of the sum of the four? Show your work. b) Is it possible that a 1-bit error will go undetected? Is it possible that a 2-bit error will go undetected?
UDP and TCP Use 1s complement for their checksums. Suppose you have the following three bytes: 10101110, 10101001, 00101011 what is the 1s complement of the sum of these three bytes?
In this problem, we will get practice with computing the one’s complement of the one’s complement sum over a sequence of data values. We will use the exact same algorithm used to compute TCP/UDP checksum, but over a sequence of 4-bit chunks rather than 16-bit chunks. (a) Consider the following data bits. What is the (4-bit) checksum of this (8-bit) data? 0101 1100 (b) Consider the following data bits. What is the 4-bit checksum of this (12-bit) data? (Note: you may be able to reuse calculations from part (a).) 0101 1100 1001
Suppose Alice and Bob are going to communicate using AES in CBC mode. Unfortunately Alice's message length (in bytes) is not a multiple of 16. Suppose the last block of her message is just a single zero byte. How can she pad out the last block so that she can use CBC mode? Since this needs to be a reversible operation, how does Bob recognize the padding and remove it?
Show your work for the following conversion. a) Convert the following block of IP addresses into CIDRized addresses: 11000110 10110111 10100000 00000000 to 11000110 10110111 10111111 11111111
The following character encoding is used in a data link protocol: A: 01000111; B: 11100011; FLAG: 01111110; ESC: 11100000 Show the bit sequence transmitted in binary for the four character frame: A B ESC FLAG when each of the following framing methods is used: a) Character count b) Flag bytes with byte stuffing c) Starting and ending flag bytes, with bit stuffing. Please solve within 30 minutes. Asap.
Is that so, or not? Consider a TCP connection where the most recent SampleRTT was 1 second. It is recommended that the TimeoutInterval be set to more than one second.
Computer Science Can you tell whether the datagram is carrying UDP, TCP, or ICMP data? How? What is the SPI for this SA from your Ubuntu to DVWA-Ubuntu? What is the SPI for this SA from DVWA-Ubuntu to Ubuntu? How are the sequence numbers changing in each of the SAs? In your own words, describe in what cases is manual keying feasible and in what cases it is not.
Computer Science With the CBC/OFB/CFB/CTR mode: (a) if there is a single bit transmission error in block C3 of the ciphertext, which plaintext blocks are affected? CBC and CTR (b) Suppose that there is a bit error in the source version of P1. Through how many ciphertext blocks is this error propagated? What is the effect at the receiver?
Is this the right answer or the wrong answer? Assume that the most recent SampleRTT for a TCP connection is one second. The TimeoutInterval setting for the connection must now be set to a value that is greater than one second.