10/27/2016

ESE 407/507

Mid-Term Exam

Closed Book

1 Hour 20 min

Explain your reasoning briefly but clearly; no points for answers without reasoning

Problem 1

A Hamming (7,4) code has parity bits (c5 c6 c7) given by data word bits (d1 d2 d3 d4) in the following way:

c5 = d1 + d3 + d4
c6 = d1 + d2 + d4
c7 = d2 + d3 + d4

a) What is the Generator Matrix G? What is the dmin for this code?
b) If we add an overall (even) parity bit to each codeword to get an (8,4) code, is this code linear?
What is the dmin for this code?
c) How does the extra parity (the code in section b) change the error detection/correction
capability of a Hamming (7,4)?


Problem 2



C1
L2

C2


S1
S2

C3

L3


L1



100 Mbps
30 Mbps
20 Mbps

0 ms prop delay
50 ms prop
10 ms prop

delay
delay

Consider the scenario above. 3 client hosts and a server L1 are connected to a switch by 100 Mbps links,
with an near zero propagation delay. The switch is connected to another switch over a 30 Mbps link with
a 50 ms propagation delay. The latter switch is connected to two remote servers L2 and L3, each over a
20 Mbps link with a 10 ms propagation delay (Mbps = 106 bits/s)

a) Suppose only C1 sends messages, each 10,000 bits long to only L2. What is the end-to-end delay
from when the message is first transmitted to when it is completely received by the server. Assume
no queueing nor processing delays, and there are no errors.
b) Assume all 3 clients generate 10,000 bit messages at the same rate; each client is equally likely to
send messages to either L2 or L3, no message directed to L1, what is the maximum rate at which the
clients can send logging message to the remote servers?

c) Now suppose only C1 sends messages, each 10,000 bits long, alternating between L1 and L2
(message 1 to L1, message 2 to L2, message 3 to L1, message 4 to L4, ). The switches do not buffer
packets. What is the maximum rate at which C1 can generate and send messages (to both L1 and L2
combined, given there is a 50/50 ratio of L1/L2 transmissions) in this scenario?

radio range

Problem 3

A 100Base-T Ethernet (100 Mbps rate = 106 bits/s, minimum frame length 512 bits) consists of a single
hub with 32 ports, to which 32 user nodes are connected. The individual hub-to-node cables are at most
120 m long. Propagation speed on the cables is 2.4 x 108 m/s, and the hub adds a delay of d s.

a) What is the maximum permissible value of d?
b) Suppose the hub delay is d = 1 s, and assume that all nodes have many 2000-bit frames to
send. What is the approximate frame rate each node can count on getting? Ethernets best
efficiency: h = 1/(1 + 5t/T), t is transmission delay, T is frame delay.

Problem 4
time


t1

A


B

t3


t4
C



D

t0
t2


Consider the scenario above. All 4 nodes have wireless interfaces, A is heard by B only, B is heard by
both A and C, C is heard by both B and D, and D is heard by C only. Node D send an RTS at time t0, node
C sends CTS, which is heard by both B and C in accordance with 802.11 protocol, and node D begin
transmission of its message at time t2. In the meantime, node A sends an RTS message to B at time t1
which ends at t3.

a) If A were to begin transmitting to B at some point after t3, would As transmission affect with the
ongoing DATA transmission from D to C?
b) At t3, can B respond to As RTS with a CTS? Why or why not?
c) In the 802.11 protocol, what will node C do at t4, at the end of the receipt of data from D?
d) IF A were to begin transmitting to node B at some point after t3, would As transmission be
successfully received at B? Justify/discuss your answer in a few sentences.