Course details
Data Communications, Computer Networks and Protocols
PDS Acad. year 2024/2025 Summer semester 5 credits
Transport protocols. Routing algorithms. Design of switches and routers. Principles of P2P communication. Packet processing in the operating system. Detection of network incidents. Data centers, software defined networks, virtual network functions. Content delivery networks. Privacy and anonymity in computer networks.
Guarantor
Course coordinator
Language of instruction
Completion
Time span
- 39 hrs lectures
- 4 hrs seminar
- 2 hrs laboratories
- 26 hrs projects
Assessment points
- 60 pts final exam (written part)
- 15 pts mid-term test (6 pts written part, 6 pts test part)
- 25 pts projects
Department
Lecturer
Matoušek Petr, doc. Ing., Ph.D., M.A. (DIFS)
Veselý Vladimír, Ing., Ph.D. (DIFS)
Instructor
Matoušek Petr, doc. Ing., Ph.D., M.A. (DIFS)
Veselý Vladimír, Ing., Ph.D. (DIFS)
Learning objectives
Understand principles and implementation of network algorithms in computer networks. Become familiar with design of common network devices. Learn advanced methods for classification and analysis of network traffic and error detection in computer communication.
Understanding principles and implementation of network algorithms in computer networks. Knowledge of network device architectures. Methods for classification and analysis of network traffic and error detection in computer communication.
Understanding communication principles and implementation in current computer networks.
Prerequisite knowledge and skills
The set theory, graph theory and relations. Fundamentals of communication protocols. Principles of Internet.
Study literature
- D. Medhi, K. Ramasamy: Network Routing. Algorithms, Protocols, and Architecture. 2nd Edition, Elsevier, 2018.
- George Varghese. Network Algorithmics. Elsevier, Inc., 2005.
- Russ White and Ethan Banks. Computer Networking Problems and Solutions: An innovative approach to building resilient, modern networks. Addison-Wesley Professional, 2017.
- Andrew Tanenbaum and David Wetherall. Computer Networks. Pearson, Global edition, 2021.
Fundamental literature
Syllabus of lectures
- Introduction to networking.
- Routing theory.
- Transport layer, flow-control and congestion-control.
- Switch design.
- Router design.
- Packet processing in operating system.
- Data center. Software Defined Networks.Virtual Network Functions.
- Peer to peer networks.
- Packet classification and data filtering.
- Intrusion detection.
- Reputation systems.
- Privacy and anonymity on the Internet.
- Content delivery networks.
Syllabus of laboratory exercises
- Advanced network traffic processing.
Syllabus - others, projects and individual work of students
- Advanced metods for network traffic analysis.
Progress assessment
Written mid-term exam and submitting project in due dates.
Mid-term exam, laboratory practice and/or homework supported by project completion, and final exam are the monitored, and points earning education. Mid-term exam and laboratory practice are without correction eventuality. Final exam has two additional correction eventualities. The minimal number of points that can be obtained from the final exam is 25. Otherwise, no points will be assigned to a student.
Schedule
Day | Type | Weeks | Room | Start | End | Capacity | Lect.grp | Groups | Info |
---|---|---|---|---|---|---|---|---|---|
Fri | lecture | 1., 2., 3. of lectures | E104 | 08:00 | 10:50 | 70 | 1MIT 2MIT | NCPS - NSEC NHPC NNET xx | Veselý |
Fri | lecture | 4., 5., 6., 7., 11., 12. of lectures | E104 | 08:00 | 10:50 | 70 | 1MIT 2MIT | NCPS - NSEC NHPC NNET xx | Matoušek |
Fri | lecture | 9., 10., 13. of lectures | E104 | 08:00 | 10:50 | 70 | 1MIT 2MIT | NCPS - NSEC NHPC NNET xx | Grégr |
Fri | lecture | 2025-04-04 | E104 | 08:00 | 10:50 | 70 | 1MIT 2MIT | NCPS - NSEC NHPC NNET xx | |
Fri | seminar | lectures | E104 | 11:00 | 11:50 | 70 | 1MIT 2MIT | NCPS - NSEC NHPC NNET xx | Matoušek |
Course inclusion in study plans