Recitation: Final Review

Hung-Bin (Bing) Chang1 and Yu-Yu Lin2

hungbin@seas.ucla.edu1 and skywoods2001@ucla.edu2

Prof. Izhak Rubin (UCLA)

EE 132B

2014 Fall

1 / 14

Outline

Final Exam Rules

Probability

Multiplexing schemes and Multiples Access Schemes

Switching Techniques

ARQ: Automatic repeat request

Routing

OSI Layer Models

Continuous and Discrete-time Markov Chain

Prof. Izhak Rubin (UCLA)

EE 132B

2014 Fall

2 / 14

Final Exam Rules

Rules

Thursday, December 18, 2014, 03:00p - 06:00p @ MS 4000A

Close book and cumulative exam.
One cheat sheet (A4 or letter paper) and write anything on both
sides of the paper.
A scientific calculator is also allowed!
Please highlight your answers (including "units") and describe how
to obtain your highlighted results as clear as possible!

Prof. Izhak Rubin (UCLA)

EE 132B

2014 Fall

3 / 14

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

4 / 14

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)

Prof. Izhak Rubin (UCLA)

EE 132B

2014 Fall

5 / 14

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

6 / 14

ARQ: Automatic repeat request

ARQ: Automatic repeat request

Positive acknowledgement, timeout timer, number packet and

ACK.
The operations and performance evaluations of the three ARQ
schemes
Stop and Wait
Go back N
Selective repeated

Prof. Izhak Rubin (UCLA)

EE 132B

2014 Fall

7 / 14

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

8 / 14

OSI Layer Models

OSI Layer Models

Application Layer, Session Layer, Presentation Layer, Transport,

Network, Data Link and Physical layers
Layer description, services, functionalities and examples
Comparison of the same functions provided in some layers (e.g.,
error control and flow control functions)

Prof. Izhak Rubin (UCLA)

EE 132B

2014 Fall

9 / 14

Continuous and Discrete-time Markov Chain

Markov Chain

A stochastic process X is considered to be a Markov Chain if it

satisfies the Markov Property:
DTMC : P(Xn+1 = j | X0 , X1 , X2 , . . . , Xn ) = P(Xn+1 = j | Xn )
CTMC : P(Xt+s = j | Xu , u t) = P(Xt+s = j | Xt )

Prof. Izhak Rubin (UCLA)

EE 132B

2014 Fall

10 / 14

Continuous and Discrete-time Markov Chain

Discrete Time Markov Chain

(Time-homogeneous) Transition Probability Function (TPF)
Pn (i, j) = P(Xn+1 = j | Xn = i) = P(X1 = j | X0 = i) = P(i, j).
Transient state analysis
State distribution at time k : Pk (j) = P(Xk = j)
The m-step TPF: P m (i, j) = P(XmP
= j | X0 = i)
Initial state computation: Pk (j) = iS P0 (i)P k (i, j)
Chapman-Kolmogorov:
P
P m+n (i, j) = iS P m (i, l)P n (l, j), m, n 1.

Steady state analysis

P

iS (i) = 1
P =
limn P n (i, j) = (j)

Prof. Izhak Rubin (UCLA)

EE 132B

2014 Fall

11 / 14

Continuous and Discrete-time Markov Chain

Continuous-time Birth and Death Process - Balanced

Equation
Load balancing equations (Flow into a node = Flow out of a node)
0 P(0) = 1 P(1)

, for state 0,

(k + k )P(k ) = k 1 P(k 1) + k +1 P(k + 1) , for state k .

After arrangement, we can obtain
P(k ) = ak P(0),
where ak =

Qk 1
Qi=0
k

i=1 i

and P(0) =

P1

k =0

ak

A general M/M/m/N QS is a continuous-time birth and death

Process can be applied to
Prof. Izhak Rubin (UCLA)

EE 132B

2014 Fall

12 / 14

Continuous and Discrete-time Markov Chain

M/M/1 QS - Summary

i = , i 0.
i = , i 1.
=

<1

P(j) = (1 )j , j 0.
W (t) =


1 e(1)t u(t), t 0.

E[Q] = E[W ] =

D(t) =


1 e(1)t u(t), t 0.

Prof. Izhak Rubin (UCLA)

j=0 jP(j) = 1 ,
1
E[D] = 1
D E[X ] = (1) ,

E[W ] = E[D] 1 = (1)

,

E[X ] =

EE 132B

2
1 .

2014 Fall

13 / 14

Continuous and Discrete-time Markov Chain

Performance Metrics for M/M/m/N (QS)

(
i =

, 0 i N 1,
0 , i = N.
E[X ] =

f = , =

PN

j=0 jP(j),
]
E[D] = E[X
D .
E[W ] = E[D] 1

i = min(i, m), i 1.

m .

P(j) = aj P(0), j 0.
P
1
N
P(0) =
a
j
j=0
aj =
j
f

, 0 j < m,

j!

fj

, m j N.
m!mjm
a0 = 1.

E[Q] = D E[W ].
For M/M/m/m
P(j) =

fj
j!
fk
k =0 k !

Pm

, for

0k m
PB = P(m)
E[X ]
E[D] = (1P
=
B)

fN

PB = P(N) = P(0) m!mNm .

D = (1 PB ).
Prof. Izhak Rubin (UCLA)

EE 132B

2014 Fall

14 / 14