Exam: |
Oral exams will take place on July 31 and September 18. Registration: Contact our secretary Mrs. Gerber (This email address is being protected from spambots. You need JavaScript enabled to view it., room 36/430). |
Lecture: |
Tuesdays, 11:45-13:15 in 36-438. |
Exercise: |
The exercise will be held either on Mondays, 10:00-11:30, or on Wednesdays, 15:30-17:00. Room: 36-438. |
Contact: |
Prof. Dr.-Ing. Jens Schmitt |
The objective of this lecture is to introduce the basics of performance management in communication networks on multiple time-scales. The contents are as follows:
The slides are only accessible from within the university network (131.246.*). You can use SSH or VPN for remote access.
Chapter | Title | Last Update | Slides |
---|---|---|---|
0 | Organization | April 25, 2017 | |
1 | Introduction | April 28, 2017 | |
2 | Long-Term Performance Management | May 19, 2017 | |
3 | Medium-Term Performance Management | May 30, 2017 | |
4 | Short-Term Performance Management | July 11, 2017 | PDF uncorr-vs-indep |
The exercise sheets are only accessible from within the university network (131.246.*). You can use SSH or VPN for remote access.
Exercise | Time | Download |
---|---|---|
1 | May 15 at 10:00 | PDF ex_1_data_1.dat ex_1_data_2.dat Positions Solution(1-2) |
2 | May 24 at 15:30 | PDF Solution(1-3) |
3 | June 26 at 10:00 | PDF Solution(1) |
4 | July 10 at 10:00 |
News: |
Die Klausurergebnisse vom 25.9.2017 sind online! |
Nachklausur: |
Am 25.09.2017, um 09:00 Uhr in Gebäude 1, Raum 106 |
Vorlesung: |
Montags, 15:30 in Raum 46-210 |
Kontakt: |
Prof. Dr.-Ing. Jens Schmitt |
Diese Vorlesung soll die Aufgaben, der Aufbau und die Arbeitsweise moderner Kommunikationssysteme näher bringen. Insbesondere liegt dabei der Fokus auf der Architektur und den Protokollen, welche heute vor allem im Internet im Einsatz sind. Anhand eines Schichtenmodells, werden von Anwendungsprotokollen (z.B. HTTP, FTP, SMTP, ...) bis zu den Grundlagen der Datenübertragung (z.B. Signalverarbeitung, Kodierungstheorie) viele Aspekte vernetzter Systeme behandelt.
Der Vorlesungsaufbau ist dabei wie folgt:
Downloads zu dieser Vorlesung sind nur aus dem Universitätsnetz verfügbar (131.246.*). Um außerhalb des Universitätsnetzes auf das Material zugreifen zu können, nutzt bitte Dienste wie VPN oder SSH.
Titel | Letztes Update |
Folien |
---|---|---|
0. Organisation | 26. April 2017 | |
1. Introduction | 26. April 2017 | |
2. Physical Layer | 05. Mai 2017 | |
3. Link Layer | 29. Mai 2017 | |
4. Network Layer | 11. Juni 2017 | |
5. Transport Layer | 02. Juli 2017 | |
6. Application Layer | 14. Juli 2017 |
Die Nachklausur findet am Montag, dem 25.09.2017 um 9 Uhr in Gebäude 1, Raum 106 statt.
Um an der Klausur teilnehmen zu dürfen benötigt ihr die Zulassung. Voraussetzung um die Zulassung dieses Semester zu erhalten waren:
Die Liste der Neuzulassungen dieses Semester findet ihr hier: PDF. Wer seine Zulassung schon in einem vergangenen Semester erhalten hat, behält diese natürlich. Achtung: Wer seine Zulassung nicht hat darf nicht an der Klausur teilnehmen und wird davon zwangsabgemeldet. Bitte überprüft daher die Liste auf Korrektheit und klärt Unstimmigkeiten bitte mit eurem Übungsleiter ab.
Die Klausurergebnisse vom 11.8.2017 könnt ihr hier einsehen: PDF.
Die Klausurergebnisse vom 25.9.2017 könnt ihr hier einsehen: PDF.
Übungsanmeldung: | bis 1. Mai 2017, 23:59 |
Übungsbeginn: | 2. Mai Woche (KW 19) |
Downloads zu dieser Vorlesung sind nur aus dem Universitätsnetz verfügbar (131.246.*). Um außerhalb des Universitätsnetzes auf das Material zugreifen zu können, nutzt bitte Dienste wie VPN oder SSH.
# | Termine | Letztes Update | |
---|---|---|---|
1 | KW 19+20 | 8. Mai | |
2 | KW 21+22 | 22. Mai | |
3 | KW 23+24+25 | 3. Juni | |
4 | KW 29 | 11. Juli |
Die Zwischenklausur findet dieses Jahr in einem Peer-Review-Modus statt, d.h. ihr korrigiert euch gegenseitig unter Anleitung. Dies hat den großen Vorteil, dass die ihr vor der richtigen Klausur schon Einblick erhaltet, wie Klausuren aus der Sicht des Korrigierenden aussehen und was von euch erwartet wird. Ablaufen wird das Ganze wie folgt:
Bringt für die Klausur bitte einen nicht-programmierbaren Taschenrechner mit (normaler Schulrechner). Außerdem gelten während dem Schreiben, Korrigieren und Einsehen Klausurbedingungen. Wer beim Schummeln, Fotografieren, etc erwischt wird verliert sofort die Zulassung.
News: | Website online |
Exam: |
To be announced. |
Lecture: |
On Tuesdays 11:45h - 13:15h in room 48-453 |
Exercises: |
On Thursdays 10:00h - 11:30h in room 48-453 |
Contact: |
Derek Sedlack |
News: | Next deadline: July 12 |
Level: | Bachelor (89-4111) / Master (89-4271) |
Contact: | M.Sc. Matthias Schäfer and follow us on Twitter |
Kick-off Meeting: | April 25, 5:15pm |
Registration (FCFS): | April 26, 4am - 11:59pm |
Visualization Mock-up: | May 19, 11:59pm |
Visualization Draft: | June 9, 11:59pm |
Report & Presentation Draft: | June 30, 11:59pm |
Final Visualization, Report, Presentation: | July 7, 11:59pm |
Presentation Day: | July 12 |
Each seminar participant will give a talk which should not exceed 30 minutes. In these 30 minutes, the students should a) present their topic and b) give a short demonstration of their visualization.
The presentations will be held in room 36-232 (AG Hagen) starting from 9am. The tentative schedule for the presentation day is as follows:
ID | Student | Title |
---|---|---|
09:00-10:30: Performance | ||
P1 | Sriharsha | EC-Cache: Load-Balanced, Low-Latency Cluster Caching with Online Erasure Coding |
P3 | Johannes | Update or Wait: How to Keep Your Data Fresh |
P5 | Markus | Silo: Predictable Message Latency in the Cloud |
10:45-12:15: Security | ||
S2 | Marco | Fingerprinting Wi-Fi Devices Using Software Defined Radios |
S3 | Philipp | ARMageddon: Cache Attacks on Mobile Devices |
S5 | David | Leave Your Phone at the Door: Side Channels that Reveal Factory Floor Secrets |
In order to participate in this year's seminar, you have to register. The registration will open on April 26, at 4am and will close on the same day at 11:59pm. No registrations will be accepted after the registration deadline has passed. There are 10 topics available and the registration is on a first-come first-served basis. As soon as the 10 topics are gone, the registration will be closed. However, if there are no topics available anymore, you can send an email to This email address is being protected from spambots. You need JavaScript enabled to view it. to get on the waiting list. Please include your three favorite topics and your study program in your email. Please also go through the introduction slides before registering. You can register for the seminar here:
Seminar Registration (only from within the Uni network/VPN)
The DISCO group offers a seminar with focus on performance and security aspects of communication networks this summer. You will be able to practice working on current research literature, presenting a scientific topic and your programming ability. The latter is crucial for your grade as all presentations have to be supported by an interactive visualization of an important aspect of your paper.
Here is the list of papers for this year's seminar. Note that this list is tentative and may be subject to changes:
ID | Author(s) and Title | Student | Supervisor | |
---|---|---|---|---|
Performance | ||||
P1 | Rashmi et al.: "EC-Cache: Load-Balanced, Low-Latency Cluster Caching with Online Erasure Coding" | Sriharsha | Daniel | |
P2 | Ghaderi: "Randomized Algorithms for Scheduling VMs in the Cloud" | Manish | Paul | |
P3 | Sun et al.: "Update or Wait: How to Keep Your Data Fresh" | Johannes | Paul | |
P4 | Zhu et al.: "PriorityMeister: Tail Latency QoS for Shared Networked Storage" | Steffen | ||
P5 | Jang et al.: "Silo: Predictable Message Latency in the Cloud" | Markus | Steffen | |
Security | ||||
S1 | Bultel et al.: "A Prover-Anonymous and Terrorist-Fraud Resistant Distance-Bounding Protocol" | Sachinkumar | Carolina | |
S2 | Vo-Huu et al.: "Fingerprinting Wi-Fi Devices Using Software Defined Radios" | Marco | Carolina | |
S3 | Lipp et al.: "ARMageddon: Cache Attacks on Mobile Devices" | Philipp | Daniel | |
S4 | Karapanos et al.: "Sound-Proof: Usable Two-Factor Authentication Based on Ambient Sound" | Simon | Matthias | |
S5 | Hojjati et al.: "Leave Your Phone at the Door: Side Channels that Reveal Factory Floor Secrets" | David | Matthias |
This year's project will focus on web caching. A web cache is what makes your browser fast (or not, if it fails) by holding copies of popular websites in your browser cache, on a computer close to you (aka. a content delivery network), and in large server farms (aka. web accelerators).
At the heart of browser performance lies the problem of selecting which web objects you'd like to have copies of, which is known as a caching policy. This project will center on the performance evaluation of various caching policies. We will experiment with various caching policies and evaluate their performance on request traces of one of the most popular websites in the world.
We will learn about basic concepts of performance evaluation, implementation, and surveying the academic literature.
M.Sc. Daniel Berger
M.Sc. Matthias Schäfer
Follow #PEDSproject and @DISCO_Teaching.
Here is a Google calendar with the tentative schedule.
Class time | Title | Link |
---|---|---|
28.11.2016 5pm | Introduction and overview (case study: delivery Wikipedia's content) | |
07.12.2016 1.30pm | I. Basic analysis (popularity distributions, CDFs, size distributions, etc) | |
14.12.2016 5.15pm | II. Statistics and simulation (hit ratios) | |
11.01.2017 5.30pm | III. More statistics and advanced simulation (classical caching policies) | |
18.01.2017 5.15pm | IV: Better than classical caching policies (the Filter policy) | |
25.01.2017 5.15pm | Q&A and general discussion | - |
01.02.2017 5.15pm | V: Theory meets practice (bloom filters) | upcoming |
Make your own slides by using the latex/ppt templates or by cloning (File->Make a copy) of this Google slide set.
Group A:
Ali Taha |
Anusha Halsnad |
Manish Kumar |
Group B:
Oskar Frohn |
Karla Schäfer |
Ewa Krajnik |
Selin Dursun |
Group C:
Bindu Nagendra |
Sriharsha Navile Basavaraju |
We will use traces of requests to a Wikipedia cache server. The trace format is:
seq# hashid size
where seq# is a consecutive request counter (per day), hashid is a long integer hash of the accessed page, and the size measures in bytes the size of the requested object.
(Download available from inside the university network. These traces fit the request fornat of the webcachesim open cache simulator. )
Example C++ code to parse such a trace file. This does very little, only outputs the contents of each line of the trace.
#include <fstream> #include <iostream> using namespace std; int main (int argc, char* argv[]) { const string traceFileName = argv[1]; long time, hashid, size; ifstream infile; infile.open(traceFileName); while (infile >> time >> hashid >> size) cout << "time: " << time << " hashid: " << hashid << " size " << size << endl; infile.close(); return 0; }
git clone This email address is being protected from spambots. You need JavaScript enabled to view it.:dasebe/webcachesim.git
cd webcachesim
cmake CMakeLists.txt
make
./webcachesim cache.07.01.tr 0 LRU 33.3219
Policy Name |
# Operations per Hit |
# Operations per Miss |
Memory Overhead (besides the cached object) |
LRU |
O(1) |
O(1) |
(List entry + unordered hash map entry) for each cached object |
FIFO |
none |
O(1) |
(List entry + unordered hash map entry) for each cached object |
We offer a variety of bachelor and master theses at any point in the academic year. Also check out some of our completed theses. Read more...