diff --git a/ex06/kn06.pdf b/ex06/kn06.pdf index c8209af..4ce2993 100644 --- a/ex06/kn06.pdf +++ b/ex06/kn06.pdf Binary files differ diff --git a/ex06/kn06.tex b/ex06/kn06.tex index 804c65e..e31bba1 100644 --- a/ex06/kn06.tex +++ b/ex06/kn06.tex @@ -86,5 +86,46 @@ %\header{BlattNr}{Tutor}{Abgabedatum}{Vorlesungsname}{Namen}{Semester}{Anzahl Aufgaben} \header{6}{}{2015-11-25}{Kommunikationsnetze}{\textit{Jonas Jaszkowic, 3592719}\\\textit{Jan-Peter Hohloch, 3908712}}{WS 15/16}{2} \vspace{1cm} -\Aufgabe{Switching Methods in Communication Networks}{45}\\\\ +\Aufgabe{Switching Methods in Communication Networks\footnote{pictures from slides adjusted to exercise}}{45} + \begin{enumerate} + \item Circuit switching: + \begin{itemize} + \item Setup time: 3 nodes to find: $3\cdot 3.1s=9.3s$ + \item Data Transmission Time: $\frac{80000 bit}{4800 bit/s}+3\cdot 0.02s=\frac{50}{3}s+0.06s \approx 16.7s$ + \item Teardown time: %TODO: not sure whether this is right/necessary + nothing given, assume: $0s$ + \item[$\rightarrow$] Transmission time: $\approx 27s$ + \includegraphics[width=.5\textwidth]{circuitSwitching.png} + \end{itemize} + \item Message switching: + \begin{itemize} + \item One message containing $80000bit+400 bit=80400 bit$ + \item Setup: no setup times given so we assume datagram switching with one message + \item Data transmission: $\frac{80400bit}{4800bit/s}+ 3\cdot 2\cdot 0.02s= 16.75 s+0.12s\approx 16.9s$ + \item[$\rightarrow$] Transmission time $\approx 16.9s$ + \includegraphics[width=.5\textwidth]{messageSwitching.png} + \end{itemize} + \item Package switching: + \begin{itemize} + \item 20 packages ($\frac{10000}{500}$) containing $500Byte+50Byte=4400bit$ + \item Setup: no setup times given so we assume datagram switching + \item Data transmission: $20\cdot \left(\frac{4400bit}{4800bit/s}+ 3\cdot 2\cdot 0.02s\right) \approx 20\cdot (0.9s+0.12s)\approx 20s$ + \item[$\rightarrow$] Transmission time $\approx 20s$\vspace{-12pt}\\ + Picture for each packet: + \hfill\includegraphics[width=.5\textwidth]{messageSwitching.png} + \end{itemize} + \end{enumerate} +\Aufgabe{Switches}{55}\\ + Let $i=1,...,5$, in=out=$10^i$ + \begin{enumerate} + \item There are $10^{2i}$ crosspoints (in $\times$ out) + \item At maximum there are $10^i$ crosspoints active simultaneously ($\min$(in,out)) + \item %TODO + \item $n$ for minimal number of crosspoints: $\left\lceil \sqrt{\frac{10^i}{2}}\right\rceil=3,8,23,71,224$\\ + $k\geq 2n-1$ : $k=5,15,45,141,447$ + \item We use the minimal number of crosspoints above:\\ + $C_{N,opt}=\frac{N}{n}\cdot n\cdot k + k\cdot \frac{N}{n}\cdot\frac{N}{n}+ \frac{N}{n}\cdot k\cdot n\\ + =153,5337,175043,5617042,178486160$ + \item %TODO + \end{enumerate} \end{document} diff --git a/ex06/messageSwitching.png b/ex06/messageSwitching.png index b84465f..3a671ca 100644 --- a/ex06/messageSwitching.png +++ b/ex06/messageSwitching.png Binary files differ diff --git a/ex06/messageSwitching.xcf b/ex06/messageSwitching.xcf index de4efbf..f4b28f7 100644 --- a/ex06/messageSwitching.xcf +++ b/ex06/messageSwitching.xcf Binary files differ