From bdf7dec8904d546ed441736bc00dc91a9dc94a40 Mon Sep 17 00:00:00 2001 From: chhan11 Date: Thu, 29 Jun 2017 18:52:07 +0200 Subject: [PATCH] NEW: QoS early stage content --- acronyms.tex | 3 +++ chapter/qos.tex | 21 +++++++++++++-------- 2 files changed, 16 insertions(+), 8 deletions(-) diff --git a/acronyms.tex b/acronyms.tex index b893bee..9fcbc7d 100644 --- a/acronyms.tex +++ b/acronyms.tex @@ -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} diff --git a/chapter/qos.tex b/chapter/qos.tex index 2ab7c0b..0a98c5a 100644 --- a/chapter/qos.tex +++ b/chapter/qos.tex @@ -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}