Computer Networks (Practice Problem)

Q 1) A noiseless 4-kHz channel is sampled every 1 msec. What is the maximum data rate? How does
the maximum data rate change if the channel is noisy, with a signal-to-noise ratio of 30 dB?

Q2) Ten signals, each requiring 4000 Hz, are multiplexed onto a single channel using FDM. What is the
minimum bandwidth required for the multiplexed channel? Assume that the guard bands are 400 Hz
wide.

Q3) A cable company decides to provide Internet access over cable in a neighborhood consisting of
5000 houses. The company uses a coaxial cable and spectrum allocation allowing 100 Mbps
downstream bandwidth per cable. To attract customers, the company decides to guarantee at least 2
Mbps downstream bandwidth to each house at any time. Describe what the cable company needs to
do to provide this guarantee.

Q4) Sixteen-bit messages are transmitted using a Hamming code. How many check bits are needed to
ensure that the receiver can detect and correct single-bit errors? Show the bit pattern transmitted for
the message 1101001100110101. Assume that even parity is used in the Hamming code.

Q5) A 12-bit Hamming code whose hexadecimal value is 0xE4F arrives at a receiver. What was the
original value in hexadecimal? Assume that not more than 1 bit is in error.

Q6) Suppose that data are transmitted in blocks of sizes 1000 bits. What is the maximum error rate
under which error detection and retransmission mechanism (1 parity bit per block) is better than using
Hamming code? Assume that bit errors are independent of one another and no bit error occurs during
retransmission.

Q7) What is the remainder obtained by dividing x 7 + x 5 + 1 by the generator polynomial x 3 + 1?

Q8) A bit stream 10011101 is transmitted using the standard CRC method described in the text. The
generator polynomial is x 3 + 1. Show the actual bit string transmitted. Suppose that the third bit from
the left is inverted during transmission. Show that this error is detected at the receiver’s end. Give an
example of bit errors in the bit string transmitted that will not be detected by the receiver.

Q9) A channel has a bit rate of 4 kbps and a propagation delay of 20 msec. For what range
of frame sizes does stop-and-wait give an efficiency of at least 50%?

Q10) The distance from earth to a distant planet is approximately 9 × 1010 m. What is the channel
utilization if a stop-and-wait protocol is used for frame transmission on a 64Mbps point-to-point link?
Assume that the frame size is 32 KB and the speed of light is 3 × 108 m/s.

Q11) Consider an error-free 64-kbps satellite channel used to send 512-byte data frames in one
direction, with very short acknowledgements coming back the other way. What is the maximum
throughput for window sizes of 1, 7, 15, and 127? The earth-satellite propagation time is 270 msec.

Q12) Host A wants to send 20 frames to Host B. The hosts agreed to go with Go-Back-4. How many
numbers of frames are transmitted by Host A if every 6th frame that is transmitted by host A is either
corrupted or lost?
Q13) How many parity bits are needed to transmit the bit pattern
containing"1101011011010101111011111”? Find out the Hamming code, if the dataword 1011 is to
be sent in EVEN parity state.

Q14) A large number of consecutive IP addresses are available starting at 198.16.0.0. Suppose that
four organizations, A, B, C, and D, request 4000, 2000, 4000, and 8000 addresses, respectively, and in
that order. For each of these, give the first IP address assigned, the last IP address assigned, and the
mask in the w.x.y.z/s notation.

Q15) Consider 7-bit hamming codeword received by receiver is 1011011. Assuming the even parity
state. Check whether the received code is correct or wrong. If wrong, locate the bit having error and
guess the correct code.

Q16) Suppose we want to transmit the message 11001001 and protect it from errors using the CRC
polynomial 𝑥 3 + 1. Use Polynomial long division to determine the message that should be
transmitted. Corrupt the left-most third bit of the transmitted message and show that the errors is
detected by the receiver using CRC technique.

Q17) A channel has a bit rate of 4 kbps and a propagation delay of 20 msec. For what range of frame
sizes does stop-and-wait give an efficiency of at least 50%?

Q18) A company is granted the site address 181.56.0.0 (class B). The company needs 1000 subnets.
Design the subnets.

Q17) A small organization is given a block with the beginning address and the prefix length
205.16.37.24/29 (in slash notation). What is the range of the block?

Q18) An organization is granted the block 130.34.12.64/26. The organization needs to have four
subnets. What are the subnet addresses and the range of addresses for each subnet?

Q19) An ISP is granted a block of addresses starting with 190.100.0.0/16. The ISP needs to distribute
these addresses to three groups of customers as follows:

1. The first group has 64 customers; each needs 256 addresses.

2. The second group has 128 customers; each needs 128 addresses.

3. The third group has 128 customers; each needs 64 addresses.

Q19) Design the subblocks and give the slash notation for each subblock. Find out how many
addresses are still available after these allocations.

Q20) An ISP is granted the block 16.12.64.0/20. The ISP needs to allocate addresses for 8
organizations, each with 256 addresses.

a. Find the number and range of addresses in the ISP block.

b. Find the range of addresses for each organization and the range of unallocated addresses.

c. Show the outline of the address distribution.

Q21) The set of IP addresses from 29.18.0.0 to 19.18.128.255 has been aggregated to
29.18.0.0/17. However, there is a gap of 1024 unassigned addresses from 29.18.60.0
to 29.18.63.255 that are now suddenly assigned to a host using a different outgoing
line. Is it now necessary to split up the aggregate address into its constituent blocks,
add the new block to the table, and then see if any reaggregation is possible? If not,
what can be done instead?

Q22) 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?

Q23) Suppose that the TCP congestion window is set to 18 KB and a timeout occurs. How
big will the window be if the next four transmission bursts are all successful? Assume
that the maximum segment size is 1 KB.

Q24) If the TCP round-trip time, RTT, is currently 30 msec and the following acknowledgements
come in after 26, 32, and 24 msec, respectively, what is the new RTT estimate
using the Jacobson algorithm? Use α = 0.9.

Q25) A TCP machine is sending full windows of 65,535 bytes over a 1-Gbps channel that
has a 10-msec one-way delay. What is the maximum throughput achievable? What is
the line efficiency?

Q26) What is the fastest line speed at which a host can blast out 1500-byte TCP payloads
with a 120-sec maximum packet lifetime without having the sequence numbers wrap
around? Take TCP, IP, and Ethernet overhead into consideration. Assume that Ethernet
frames may be sent continuously.