0% found this document useful (0 votes)
25 views2 pages

Cheat Sheet 1

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
25 views2 pages

Cheat Sheet 1

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Switching Principles

avg . norm .
Tp . = T = Entopn .
Psuc CSMA VARIATIONS
transmit
-(0) >
-

Circuit Space/Time Division & Wavelength Sw .


·
Psucc = Qa(lin) Qr(0 n) . . + . Qu(lin)
Qa(Oin)
·
Non-Persistent - B - ! (0) >
- wait random /cost. time

Packet= Internet ATM , .


↑ packets >
-
Queuing & Loss Psucc =
G() .
e-P() ,
G() : (m-n)9a nar attempt +
-
1-Persistent - B - (0) - transmit ,
! (0) - wait until (0)
-
rate
Protocol Princ .
Stop & Wait = wait until ACK Psucc =
6 .
e -n = 0
arr . rate
·
P-Persistent = B - (0) - transmit with p ,! (0) >
-
backlogged

Automatic Repeat Request (ARQ) =timeout & send again


: Drift-(m-n)9a- Psucc = + - n ↑ RESERVATION TECH . . U :
busy tone duration >
- opt = B
n
Link Layer Tasks
-
G(n) b
-

·
= +
ngr
·
Sremax . norm
. To .
S-max norm To for reservation tech
.

. -= .
. .

Framing ,
Link access , transmission of a frame ,
:
error Drifte + -- Stable point maxPsucc. Ye .
S -
/I. OROES . Del I worst

det & . Corr , packet forwarding


a switching
>
-
> + unstable point -

0 308
.

.
-
Sr = 1/2 VB +

Medium Access Control (MAC) PsuccnO bad stable 802 Il WIRELESS STUDY ACK mode
>
- point .

·
when & how to send/listen Miniqa
·
e
system are design distributed coordination fxn (DCF) >
- RTS/CTS mode
params. , param.

metrics = Tp delay energy effic


, , .,
robustness ...
BACKOFF (collision resolution) ACK MODE

Multiplexing Princ .
FDM freq .,
WDM -
wavelength slots that a packet can be transmitted after collision
·

DIFS + DATASIFS ACK" +


,
DATA : Ts : SWAC + To

TDM BO #backoff slots N ACK


SACK
·

- time SDM-Space CDM-code =


opt BO =
Sip + TM
.
.
, , ,

Rate
goodput GP
·

Medium Access Scheme which f/ + / time slots ...? Tot


prob of out of Nc coll select the BOs ACK
·

. i users . users same . ,

5 Dimension of Comm .
Time Freq . , ,
Energy
2
MAC P(i) =
(4) (YBO)" (1 - BO)NC-i ·
DIFS - before Id
transmitting before b--

BO-1 + Nc Nc 1 -

Space-Planning ,
Code & PHY ·
Pcoll = 1-PCO)-PCI) = I -
BO
-
(1-1/B0) ·
suitable when # user

ALOHA - transmit when have packet (ACK) EXP .


BACKOFF window size
·
Ts =
DATA! SIFS + ACKIDIFS · TC = DATA I DIFS

Poissonarr.
·
= Ji=J/m ,
di = J Carrival rate) ·
BO = b >
-
Ob max .
BO stage
RTS/CTS Mode Client
RTS
, Host ,
Host
CTS
-> Client

X
jk !
"
(NAV)
>
-

p x = k =
e ·
·
c = #colls .
exp .
by a pckt
·
Wo -init .
Bo
·
Network Allocation Vector >
- broadcasts the

2"Wo BO
feedback 0 2 Wi 2? Wo Wmax W min (Wi Wmax) duration of the transmission
· · ·

= , , e = =
=
,

a) SifSebtw step DIFS after ACK


suffering each
·
-
·
no I new arr .
are discarded when ·

p : Const . coll .
prob .
·
n : # users
.
,

DIFS

Pt
2(1 2p) Ts RTS + SIFS DATA ! SIFS ACK I DIFS
packet
-

waiting CTS SIFS


·
is ·

= = + + +

(( 2p)(Wo 1) pWo
*
-
+ +
( -(2p)
b) M >
- = new packet = new node ·
Tc =
RTS 1 DIFS · packet size
M- I
MP+ (1 -01) (1 P + )U E[P]
throughput Tp-packet Psucc Psuc Ptr 1 Saturation tp. S
·

attempt rate
· ·
x = · =
- -

·
.
I =

U
1 (1 P1) ~ at least 1 trans Ts-Tc .
0 Uptr-1 + Tc/o
(
- -

1-Lidletime
+
=> P = ration Collision tr .

d IN 1
Ps
-

(collision
·
norm .
Tp . =
p.lim 1 JN TREE ALGORITHM
X
resolution (

resolve collision AFTER Ptr Ps E[P]


collision happened System to eS
·
· a norm . =
. .

26 Ptr Ps Ts (l-Ptr) O + Ptr (l-Ps) T


d + . .
.

independently distributed
.

e runs MAC
·
= .
-> -

·
best-case =
d.e- ·
Q = branch size (1) >
- Done IEEE 802 11 MODES .

SLOTTED ALOHA a) lower bound ·


1) random = 01bcQ 2) b 0k. = >
- (e) - Step ) ·
Infra structure >
-> AP + Host ,
Ad-Hoc >
- Hosts only

b) upper bound = arr .


rate = G =
6+ B 3) fb : (l)or(0) >
- b- 1- Step 2
·
Rate adaptation = SNR b BER * - Switch tx. rate

case a) no new pckt is generated while backlog. (e) >


- b+ Q 1 - -
Step 3 IEEE 802 3 ETHERNET .
: CSMA/CD
N -
1
·

prob of .
trans. of backlogged =
pr
·
Psucc = (Y) (1/Q) (1-1/Q) .
·
used in LANs because TP
/m
&
""""Unbacklogged = 90 = 2-
·
OPTIMAL DYNAMIC T A .
. = init. Q . = # collided users ·
waiting time : free - B , busy el + B ,
coll .
- 2B

prob of .
no arrivals =e-/m ·
Tp =
succesful/all slots ·
exp .
delay E[D] =
B Pnt
. + (1 + B) Ps + 2BPc = (l Pc)B Ps
+ +

Pr -1 2
, ,
Printite ,
Prime O ·
MODIFIED T A .
.
foreseen collision · 2 = Pnt + Ps + Pc , g(n) ↓Brqr n = .
,
Ps gln) = . e
-
g(n)
,
Put-eig(n)
eg)(B g(n)
(2-e9l
-

Transmission prob
. COLLISION AVOIDANCE ·
ECD] :
-
g(n) . + g(n) . e

m n 1

(m)(qa)"
- -

Qa(in) = (1 9a) -

,
munti
·
Pre-backoff =init .
BO = N ·
Carrier Sensing
:

Dn =
d .
E[D]-Psucc ·
Dn = () >
- 6 < Psucc/ECD]
n i
q'(l-9r)
-

Gr(in) = (i) , nei ·


Access Barring = PAB : access
barring factor x < 2/1 + 3 . 31B

Transition prob
. ·
CSMA CA = each user can sense the channel ·

sending time Ts =
4C ·

prop time .
=> Tp =
/ 2x18mIs
Prin + i =
. Qa(i n ,
21:<m -M 1
C : channel bit rate ·
L : size of packet/slot ·
B = Tp/Ts
,

B B
·
Qa(lin) I-Qr(0,n) ,
i = 2 .
T : detection time .
B sensing time ratio
: ·
to detect a coll . - 2Tp < Ts ,
B20 5 .

·
QaClin) Qr(O n) . , + Qa(0n) [1-Qr(In)] ,
i = 0
·
B =
[c < 1 ·
(0) - B (lor(e) - 1 + B POLLING PROTOCOLS
P
·
Qa(0n) Qr(lin) . ,
i = -1 · P+: 1-Pnt ·
Pat = (" .
,
no bl .
transmitted
·
fully decentralized - Token Ring (IEEE 802 5) X controller .

Steady B Hub polling


·

state analysis - no new packets arr in


·
semi- ,
controller-duser-user ....

n+ 1
.

m
·

Enopa-1 , pr =
Eio pi .
Pin I ·

expected delay = ED = B Pnt . + (( B) Pt + .


·
fully centralized - roll call polling ,
controller - each host

E opi -i P(1- ar)


Pre-payin pal-Pnin) Pin ED B 2 NACK controller knows that has packet
· ·
. =
+ - a user no

E
·
ds = B + 1 - = P (1-9r)" d g(n) = JB + grn IEEE 802 3 .

expected of bl N
·

users = = n= n pr n
Psucc-edP Earn
. .

.
(dB 9rn) + =
g(n) . e
·

Bridging - subnetworks
·

Delay D N/d
eg(n)
= =

·
Dn Xs-Psu J(P + -e9(u) -

g(n) ·

Switching >
- N-port layer-2 switch
P(success
.
=

its slot)
=
·

exp delay T i

gleig *
. = = . on

Departure 2/2 + Full-Duplex e


rate-
·
·

·
drop rate = o =
NT-tP/di

You might also like