Computer Networks – Important Formulas

– Fourier' theorem: Every periodic function can be written as a sum of sine and cosine functions. The frequencies of
1
these functions are integer multiples of the fundamental frequency f =
T
1 ∞ ∞
g  t = ∑n =1 an sin2  n f t ∑n =1 b n cos 2 n f t 
2c
2 T 2 T 2 T
c = ∫0 g  t  dt an = ∫0 g  t sin 2  n f t  dt b n= ∫0 g  t  cos2  n f t  dt
T T T
– Nyquist formula: maximum data rate  2⋅ bandwidth ⋅log 2
 symbols  bits/s
signal strength
– Shannon formula: maximum data rate  bandwidth log2 1  bit/s
noise level
– Amplitude modulation f  t = s  t ⋅sin2  f t 
– Frequency modulation f  t =a⋅sin2  s  t  t  
– Phase modulation f  t =a⋅sin2  f t  s  t 
– Bit error rate: BER  SNR =0,5⋅e−SNR
T
– Coherent receiver: compare distorted waveform to all legal waveforms sigi =∫0  dstrt  t − legal i  t 2 dt  min
T
– Corellation: compare correlation of distorted waveform and all legal waveforms sigi =∫0  dstrt  t ⋅legal i  t  dt  max
log∣S∣ d S 
– Block codes, S ⊂{1,0 }n : rate R of code S R S = ; distance  of code S  S =
n n
– Bellman-Ford: node X ...
– ... has distance vector for all destinations x 1 ... x n
– ... receives distance vector from neighbour y 1 ... y n
– ... has cost c XY to reach Y
– check if, x i y i c XY then set outgoing link for node i to Y, update cost to y i c XY
– LastByteSent − LastByteAcked  CongestionWindow
Maximum Segment Size
– Additive increase: Congestion Window + =Maximum Segment Size ⋅
Congestion Window
– TCP Congestion Control – Summary
– When CongWin is below Threshold, sender in slow-start phase, window grows exponentially.
– When CongWin is above Threshold, sender is in congestion-avoidance phase, window grows linearly.
– When a triple duplicate ACK occurs, Threshold set to CongWin/2 and CongWin set to Threshold.
– When timeout occurs, Threshold set to CongWin/2 and CongWin is set to 1 MSS.
0.93⋅ Maximum Segment Size
– TCP Data Rate 
Round Trip Time ⋅ loss probability
sin 2kx 
– ∫ sin x  dx =−cos x C , ∫ sin kx 2 dx = 12 x − 4k , ∫ cos  x  dx =sin  x C ,
sin 2kx 
∫ cos kx 2 dx = 12 x 4k
– mean  , variance Var  X =E  X −2 =E  X2 − E  X 2  , standard deviation =  Var  X 

–  n k
binomial distribution P  X = k = p 1−p 
k
k
n− k
=np 2
 =np 1− p 

 2
– poisson distribution P  X =k = e− =  =
k!
– binomial coefficient  n= n!
k k !⋅ n−k  !
– conditional probability
ISO/OSI TCP/IP
Application Presentation
Presentation
Session
Transport Transport
Network Internet
Data Link
Host-to-network
Physical

Computer Networks – Important Formulas, 26.02.2008, Martin Dräxler, draexler@mail.uni-paderborn.de