Recitation: Midterm Review

Hung-Bin (Bing) Chang and Yu-Yu Lin

Electrical Engineering Department University of California (UCLA), USA,
hungbin@seas.ucla.edu and skywoods2001@ucla.edu

Prof. Izhak Rubin (UCLA)

EE 132B

2014 Fall

1 / 14

Outline

Material Summary
Probability
Multiplexing schemes and Multiples Access Schemes
Switching Techniques
ARQ: Automatic repeat request
Routing

Midterm Sample

Prof. Izhak Rubin (UCLA)

EE 132B

2014 Fall

2 / 14

Material Summary

Probability

Probability

Random variables (uniform, binomial, exponential, geometric,

Poisson)
CDF, PDF, expectation, moment generating function
Geometric series, Memoryless property

Prof. Izhak Rubin (UCLA)

EE 132B

2014 Fall

3 / 14

Material Summary

Multiplexing schemes and Multiples Access Schemes

Multiplexing schemes and Multiples Access Schemes

Multiplexing schemes
Fixed assigned (FDM, TDM)
Demand assigned (ATDM - statistical multiplexing)

Multiples Access Schemes

Fixed assigned (FDMA, TDMA)
Demand assigned (reservation-based DA/TDMA vs. polling
(centralized, token passing/token ring))
Random access (ALOHA, slotted ALOHA, CSMA, CSMA/CA)
Throughput calculation of a system (bps, packets/sec)

Prof. Izhak Rubin (UCLA)

EE 132B

2014 Fall

4 / 14

Material Summary

Switching Techniques

Switching Techniques

Circuit switching (resource guarantee/dedicated, QoS) - phases of

operation
Constant rate traffic
Resource guarantee, QoS (throughput and delay) assurance
Circuit setup cost and delay, low capacity utilization

Packet/Message switching (store and forward, best effort)

Bursty traffic
Low cost, rapid reaction to link/network failures/congestion
No QoS guarantees

Prof. Izhak Rubin (UCLA)

EE 132B

2014 Fall

5 / 14

Material Summary

ARQ: Automatic repeat request

ARQ: Automatic repeat request

Positive acknowledgement, timeout timer, number packet and

ACK.
Three ARQ schemes
Stop and Wait
Go back N
Selective repeated

Prof. Izhak Rubin (UCLA)

EE 132B

2014 Fall

6 / 14

Material Summary

Routing

Routing
Distance Vector Routing (Bellman-Ford Algorithm)
Each router estimates the length of its shortest path to each node
in the domain using estimates that it receives from its neighbors,
and informs its estimates to its neighbors.
Routers iteratively update their estimates based on the estimates
that they receive from their neighbors, when a shorter route length
is detected.

Link State Routing (Dijkstras Algorithm)

Each router has complete topology info (map of routers and the
networks they are connected to).
Routers actively test the status of neighboring routers and
propagate link status to all neighbors.
Each router does the routing locally by finding the shortest path
tree.

Prof. Izhak Rubin (UCLA)

EE 132B

2014 Fall

7 / 14

Material Summary

Routing

Dijkstras Algorithm

Step 1:
Set P = {1} (i.e., Node 1 is the source node)
Set T = {2, 3, . . . }
j = 2, 3, . . . , set d(1, j) = h(1, j)

Step 2: Find i T where d(1, i) = minjT {d(1, j)}.

Set T = T {i}
Set P = P + {i}
If T = , we are done!

Step 3: j T :
d(1, j) = min{d(1, j), d(1, i) + h(i, j)}
Go to step 2

Prof. Izhak Rubin (UCLA)

EE 132B

2014 Fall

8 / 14

Material Summary

Routing

Example: Dijkstras Algorithm

2
1

Step 1:

P = {1}
T = {2, 3, 4}
d(1, 2) = 3, d(1, 4) =
0.5, d(1, 3) =

0.5

3
4

Step 1
1

Step 2:

i =4
P = {1, 4}, T = {2, 3}
d(1, 2) = min{3, 0.5 + } =
3
d(1, 3) = min{, 0.5 + 8} =
8.5

0.5

(1, )

Step 2

(1, 3)
4

(1, 0.5)
(1, 3)

0.5

3
4

(4, 8.5)

(1, 0.5)

Figure : Dijkstras algorithm

Prof. Izhak Rubin (UCLA)

EE 132B

2014 Fall

9 / 14

Material Summary

Routing

Example - Contd

Step 3

Step 3:

i =2
P = {1, 2, 4}T = {3}
d(1, 2) = min{3, 0.5 + } =
3
d(1, 3) = min{8.5, 3+4} = 7

(1, 0.5)
(1, 3)

0.5

3
4

i =3
P = {1, 2, 3, 4}

(2, 7)

Step 4:

0.5

Step 4

(1, 3)
4

(2, 7)

(1, 0.5)

Figure : Dijkstras algorithm

Prof. Izhak Rubin (UCLA)

EE 132B

2014 Fall

10 / 14

Midterm Sample

Problem 1
(a.) State the protocols for the following random access schemes:
unslotted ALOHA, slotted ALOHA, CSMA/CA.
(b.) Consider a communications channel that is shared among 10
stations. The transmission data rate across the channel is 10
Mbps. Each station is noted to transmit (or retransmit) a packet in
each slot with probability 0.03. The packet size is equal to 4000
bits, including overhead. The slot duration is equal to the time it
takes to transmit a packet.
(i.) Calculate the probability that a given stations packet transmission
is successful.
(ii.) Calculate the channels normalized throughput rate (which is equal
to the average number of successful packet transmissions in a slot).
(iii.) Compute the average number of times that a packet is transmitted
(and retransmitted) until it is successfully received.

Prof. Izhak Rubin (UCLA)

EE 132B

2014 Fall

11 / 14

Midterm Sample

Problem 2

(a.) Define and state key differences between multiplexing and

multiple access schemes.
(b.) Define and state key differences between TDMA and
demand-assigned TDMA.

Prof. Izhak Rubin (UCLA)

EE 132B

2014 Fall

12 / 14

Midterm Sample

Problem 2 - Contd
(c.) Consider a communications channel that is shared among 10
stations using a TDMA protocol. Each station is allocated a single
slot during each TDMA time frame. The transmission data rate
across the channel is equal to 2 Mbps. Each time slot is
sufficiently wide to allow the transmission of a single packet,
including the propagation delay which equals to 1 msec. Each
packet contains 5000 information bits and 240 overhead bits.
(i.) Calculate the network throughput achieved by a single station,
assuming a noiseless channel such that all message transmissions
are received correctly.
(ii.) Assume that, for the above described system, the channel bit error
rate is equal to 104 . Assume that a packet that is received
incorrectly will be retransmitted by the station in its slot in the next
frame. Calculate the net throughput achieved by a single station.

Prof. Izhak Rubin (UCLA)

EE 132B

2014 Fall

13 / 14

Midterm Sample

Problem 3
Consider a Half-Duplex communications link which employs a
Stop-and-Wait ARQ error-control scheme. The transceivers
equipment has a turn-around time of 3 msec. The link is 2000 Km
long, and the propagation rate is 5 microsec/Km. The ACK packet
contains 360 bits. Assume ACK messages to be sent as separate
frames. The information frame (on which the error control scheme
operates) contains a 760 bits header. The link is operated at a
data rate of 240 Kbps. The channels bit error rate is equal to
0.0001.
(a.) Obtain the maximum length of the frame which must be selected to
ensure that the frame is retransmitted (at least once) for no more
than 30% of the time. Show whether such a maximum length
condition can be imposed.
(b.) Under the selected value for the frame, calculate the links
throughput and its normalized throughput efficiency.

Prof. Izhak Rubin (UCLA)

EE 132B

2014 Fall

14 / 14