Lecture: High Performance Networking
Course:
- Responsible: Prof. Dr. Peter Martini
- Dates: Wed. 18:00 to 19:30, weekly, AVZ III / Römerstr. 164 - Hörsaal 2
- Course number: 612113101
Exercises:
- Responsible: Prof. Dr. Peter Martini, Dr. Matthias Frank, Dr. Patrick Peschlow, Jakob Bieling, Sebastian Eschweiler
- Dates: by arrangement
- Course number: 612213101
Other:
- Term: Master Computer Science, Diploma (Graduate)
- Requirements:
- Faculty: MA-INF 3101, (B, C) [B1]
- Effort: 2L + 2E
Student Evaluation:
Remark(s)
Master: According to the changes 03/2010 of the Master Examination Regulation 2008, this module counts as 2L + 2E with a total of 6 credits.
Diplom/DPO2003: please see the German version of this web page if you plan to participate in this lecture for Diplom [B1].
News
- November 3, 2010: Assignment sheet 2 and practical sheet 1 are available for download. For further information – especially on the practical exercise – read the sheets.
- October 20, 2010: Assignment sheet 1 is available for download. All information about the submission of solutions etc. can be found on the sheet.
- October 14, 2010: The lecture slides for chapter 0 and part A are available for download. (In order to access the lecture resources from outside the university network, you have to use the username and password given in the first lecture.)
- October 14, 2010: The slides "Important information about the exercises" that have been presented in the first lecture are available for download (see section Assignment Sheets below).
Mailing list
The mailing list "HPN" is used for news concerning the lecture "High Performance Networking". An additional purpose is to discuss the lecture topics or assignment sheets. It is strongly recommended to subscribe to the mailing list. More information can be found here.
Lecture slides
Access to the files is unrestricted from within the computer science department. Access from outside requires a username and a password, which has been announced in the first lecture.
Chapter | PDF file |
---|---|
0 HPN - About this Lecture | Slides 1-41 (3.292.018 Bytes) |
A. Fundamentals of Communication SystemsA.1. The Internet – Overview and Philosophy | Slides 1-170 (2.378.346 Bytes) slides 1-60 (1.188.485 Bytes) slides 61-170 (1.210.362 Bytes) |
B. Advanced Topics in Communication SystemsB.1. IntroductionB.2. Performance Studies – Why and How ? B.2.1. Why Care about Performance Studies ? B.2.2. Example: Performance of the Stop-and-Wait Protocol B.2.3. Paths to a deeper Understanding ... B.2.4. What is a Model ? B.2.5. Before you start: Clearly state the Goals ! B.2.6. Performance Evaluation as an Art B.2.7. Checklist for Performance Studies | Slides 1-38 (1.536.304 Bytes) |
B.3. Measurements in Communication Systems B.3.1. Why Measurements? B.3.2. A Measurement Cookbook B.3.3. Case Studies B.3.3.1. Case Study #1: Measurement of Internet Characteristics B.3.3.2. Case Study #2: RTT and Timeout as published by Padhye | Slides 1-34 (766.449 Bytes) |
B.3.3.3. Case Study #3: TCP Performance in 3G+ Networks | Slides 1-66 (2.340.048 Bytes) |
B.3.4. Load Models B.3.4.1. Constant Bit Rate (CBR) B.3.4.2. Measurements in Local Area Networks B.3.4.3. Poisson Arrivals B.3.4.4. The Burst / Batch Poisson Process B.3.4.5. The Markov Modulated Poisson Process (MMPP) B.3.4.6. Video Traces B.3.4.7. Do we really need to care about Load Models? B.3.4.8. An active Area of Research | Slides 1-32 (3.539.619 Bytes) slides 1-25 (886.866 Bytes) slides 26-28 (703.311 Bytes) slide 29 (1.156.879 Bytes) slides 30-32 (819.911 Bytes) |
B.4. Simulation of Communication Systems B.4.1. What is Simulation ? B.4.2. Types of Simulation B.4.2.1. Continuous-State versus Discrete-State Models B.4.2.2. Event-Driven Simulation B.4.2.3. Terminating versus Steady-State B.4.2.4. Synthetic versus Trace-Driven B.4.3. A Simulation Cookbook B.4.4. Case Study: Competing TCP Flows | Slides 1-55 (474.046 Bytes) |
B.4.5. Advanced Topics in Simulation Technology B.4.5.1. Random Numbers in Simulations B.4.5.2. Output Analysis with Confidence Intervals B.4.5.3. Speeding up Simulation Runs | Slides 1-34 (933,309 Bytes) |
B.5. Mathematical Analysis of Communication Systems (in a nutshell) B.5.1. Basics of Queuing Theory B.5.1.1. Packets as “Customers” B.5.1.2. Quantities describing Data Flows B.5.1.3. Networks with one Output Channel B.5.1.4. The M/G/1 Model B.5.2. Performance Analysis of Networks with Polling B.5.2.1. The Cycle Time B.5.2.2. Calculating the Average Cycle Time B.5.2.3. Calculating the Average Packet Delay B.5.2.4. Analysis of Multiple Token Rings B.5.2.5. Analysis of Single Token Rings B.5.2.6. Performance Comparison of Token Rings B.5.3. Performance Analysis of Random Access Systems B.5.3.1. Pure Aloha B.5.3.2. Slotted Aloha B.5.3.3. CSMA B.5.3.4. CSMA/CD B.5.4. A Formula for TCP Throughput Estimation B.5.4.1. The Basic Model B.5.4.2. Loss Indications exclusively by triple-duplicate ACK B.5.4.3. Loss Indications by Timeout or TD-ACKs B.5.4.4. Comparison with Measurements in Real Systems | Slides 1-83 (513.246 Bytes) |
B.6. Let’s get wet: Underwater Communication B.6.1 Underwater Networks B.6.1.1 Underwater Networks B.6.1.2 Requirements B.6.1.3 Challenges B.6.1.4 Summary B.6.2 Media Access B 6.2.1 ALOHA B 6.2.2 TDMA B 6.2.3 FDMA B 6.2.4 CSMA/CA B 6.2.5 Summary B.6.3 Designing an Underwater Acoustic Network B.6.3.1 Cookbook? B.6.3.2 Media Access B.6.3.3 Network Protocol B.6.3.4 Transport Protocol B.6.3.5 Summary | Slides 1-64 (1.630.481 Bytes) slides 1-24 (831.448 Bytes) slides 25-64 (843.480 Bytes) |
Assignment Sheets
Important information about the exercises
The PDF files can be viewed and printed with Adobe Reader. The program is available for free and installed on nearly all hosts of the institute.
PDF file | Supplementary material | Further information | Results |
---|---|---|---|
Sheet 01 | Results 01 | ||
Sheet 02 | traffic.pcap.zip | Results 02 | |
Sheet 03 | Results 03 | ||
Sheet 04 | Results 04 | ||
Sheet 05 | Results 05 | ||
Sheet 06 | Results 06 | ||
Sheet 07 | Results 07 |
Practical exercises
PDF file | Supplementary material | Further information | Results |
---|---|---|---|
Practical sheet 01 | |||
Practical sheet 02 | Time Sequence Plots | Results PR | |
Information about the presentation |