netravnen/NetworkLabNotes
1
0
Fork 0
mirror of https://gitlab.com/netravnen/NetworkLabNotes.git synced 2024-12-23 20:57:53 +00:00
Code Releases Activity

NEW: QoS early stage content

Browse source
This commit is contained in:
chhan11 2017-06-29 18:52:07 +02:00
parent c314e695ac
commit bdf7dec890
2 changed files with 16 additions and 8 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

3
acronyms.tex
View file

@ -15,6 +15,7 @@
\newacronym{bpdu}{BPDU}{Bridge Protocol Data Unit}
\newacronym{bsd}{BSD}{Berkeley Software Distribution}
\newacronym{carp}{CARP}{Common Address Redundancy Protocol}
\newacronym{cbwfq}{CBWFQ}{Class-based Weighted Fair Queueing}
\newacronym{cdn}{CDN}{Cat Delivery Network}
\newacronym{cdp}{CDP}{Cisco Discovery Protocol}
\newacronym{cest}{CEST}{Central European Summer Time}
@ -26,6 +27,7 @@
\newacronym{cq}{CQ}{Custom Queueing}
\newacronym{cst}{CST}{Common Spanning Tree}
\newacronym{cwdm}{CWDM}{}
\newacronym{dcbwfq}{DCBWFQ}{Distributed Class-based Weighted Fair Queueing}
\newacronym{db}{DB}{Database}
\newacronym{dhcp}{DHCP}{Dynamic Host Control Protocol}
\newacronym{dknog}{DKNOG}{Danish Network Operators' Group}
@ -34,6 +36,7 @@
\newacronym{dsl}{DSL}{Digital Subscriber Line}
\newacronym{dst}{dst}{destination}
\newacronym{dwdm}{DWDM}{}
\newacronym{dwfq}{DWFQ}{Distributed Weighted Fair Queueing}
\newacronym{eapol}{EAPoL}{Extensible Authentication Protocol over Local Area Network}
\newacronym{eap}{EAP}{Extensible Authentication Protocol}
\newacronym{ecn}{ECN}{Explicit Congestion Notification}

21
chapter/qos.tex
View file

@ -19,11 +19,12 @@ Different mechanisms of handling access to network ressorces is used.
\section{Concepts}
\gls{qos}\tsq{s} goal is a differentiated prioritazion of packets parsing thorugh the network based upon the following concepts:
\begin{enumerate}
\item Bandwidth,
\item latency,
\item jitter,
\item realiability.
\item jitter\footnote{Latency Variation}
\item realiability\footnote{Pct. of packets discarded by any a router}.
\end{enumerate}
\section[Congestion Mgmt]{Congestion Management}
@ -31,16 +32,20 @@ Different mechanisms of handling access to network ressorces is used.
There are different ways to do congestion management. Which is in it\tsq{s} essence sorting of packets when a link reaches full capacity usage in the outgoing direction.
\begin{enumerate}
\item \gls{fifo}
\item \gls{pq}
\item \gls{cq}
\item \gls{wfq}
\item \gls{fifo}: Classic store-and-forward. Oftentimes the default algorithm.
\item \gls{pq}: Made to give stict priority to important traffic at each point \gls{pq} in the network where \gls{pq} is used.
\item \gls{cq}:
\item \gls{wfq}: Traffic is diveded into flow based upon charactaristics \begin{mylist} \item \gls{dst} address, \item \gls{src} address, \item protocol, \item port number, \item socket. \end{mylist}. Flows is then allocated a part of the bandwidth relative to the number of ongoing conversations/flows.
\begin{enumerate}
\item Flow-based \gls{wfq},
\item class-based \gls{wfq},
\item distributed \gls{wfq}.
\item \gls{cbwfq},
\item \gls{dwfq}.
\end{enumerate}
\item distributed class-based \gls{wfq}
\item \gls{ip} \gls{rtp} priority
\item \gls{llq}
\begin{enumerate}
\item \gls{llq}
\item Distributed \gls{llq}:
\end{enumerate}
\end{enumerate}