8. Consider the effect of using slow start on a line with a 10-msec round-trip time and no congestion. The receive window is 24 KB and the maximum segment size is 2 KB. How long does it take before the first full window can be sent? What is the final result? Provide proof: Solution|

I need the answer as soon as possible

Problem with constructing MAC. The messages X to be authenticated consists of z independent blocks, so that: X = x1||x2|| . . . ||xz, where every xi consists of |xi| = 8 bits. The input blocks are consecutively put into the compression function  ci = h(ci−1, xi) = ci−1⊕xi At the end, the MAC value: MACk(X) = cz+k mod 28 is calculated, where k is a 64-bit long shared key. Describe how exactly the (effective part of the) key k can be calculated with only one known message X.

Consider an (n, k) block code with the following generator matrix. Find the following: * The values of n and k. * The detection and correction capacities of the code. * The codeword c for the message mF1001. 0 1 0 1 10 0 1 0 10 10 0 0 1 1 0 0 1 0 1 1 0 0 0 0 1 G = The syndrome for the received vector r= 1101011. Assume this code is used on a channel with Poe=0.01. What is the probability of receiving codeword free from error?