Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 1

1.

Suppose we want to transmit the message 11100011 and protect it from errors
using the CRC polynomial X3 +1.
a. Use polynomial long division to determine the message that should be
transmitted.
b. Suppose the leftmost bit of the message is inverted due to noise on the
transmission link. What is the result of the receiver’s CRC calculation?
How does the receiver know that an error has occurred?

2. Given the following 8 bit pattern 01011100 and the generator polynomial
x3+x2+1, compute the CRC bits. Given a 1 bit error that transforms the 8 bit
message pattern from 01011100 to 11011100, show that the pattern protected by
the above CRC can detect the error.
3. A message 1001 1100 1010 0011 is transmitted using the Internet Checksum
(using 4-bit words). What is the value of the checksum?

4. How long it takes to send a file of 640,000 bits from Host A to Host B over a
circuit-switched network. Suppose that all links in the network use TDM with 24
slots and have a bit rate of 1.536 Mbps. Also suppose that it takes 500 msec to
establish an end-to-end circuit before Host A can begin to transmit the file. How
long does it take to send the file?

5. Assume you wish to transfer an n-byte file along a path composed of the source,
destination, seven point-to-point links, and five switches. Supposed each link has a
propagation delay of 2ms, bandwidth of 4Mbps, and that the switches support both
circuit and packet switching. Thus, you can either break the file up to 1-KB
packets, or set up a circuit through the switches and send the file as one contiguous
bit stream. Supposed that packets have 24 bytes of packet header information and
1000 bytes of payload, that store-and-forward packet processing at each switch
incurs a 1-ms delay after the packet has been completely received, that packets
may be sent continuously without waiting for acknowledgements, and that circuit
setup requires a 1-KB message to make one round-trip on the path incurring a 1-
ms delay at each switch after the message has been completely received. Assume
switches introduce no delay to data traversing a circuit. You may also assume that
file size is a multiple of 1000 bytes.
a. For what file size n bytes is the total number of bytes sent across the
network less for circuits than for packets?
b. For what file size n bytes is the total latency incurred before the entire file
arrives at the destination less for circuits than for packets?

You might also like