Course details
Data Communications, Computer Networks and Protocols
PDS Acad. year 2025/2026 Summer semester 5 credits
Overview of computer networks. Routing algorithms. Transport protocols. Network security. Switch and router design. Classification and packet filtering. P2P networks. SDN networks, data centres, virtualization. Privacy and anonymity in computer networks. IPv6 networking. Network traffic identification.
Guarantor
Language of instruction
Completion
Time span
- 39 hrs lectures
- 4 hrs seminar
- 2 hrs laboratories
- 26 hrs projects
Assessment points
- 60 pts final exam (oral part)
- 18 pts mid-term test (written part)
- 22 pts projects
Department
Lecturer
Matoušek Petr, doc. Ing., Ph.D., M.A. (DIFS)
Veselý Vladimír, Ing., Ph.D. (DIFS)
Instructor
Learning objectives
Understand the principles and implementation of network algorithms in computer networks. Become familiar with the design of common network devices. Study advanced methods of classification and analysis of network traffic, as well as and error detection in computer communications. Understand the principles of modern networking technologies.
Prerequisite knowledge and skills
The set theory, graph theory and relations. Fundamentals of computer networks and communication protocols. Principles of the Internet.
Study literature
- D. Medhi, K. Ramasamy: Network Routing. Algorithms, Protocols, and Architecture. 2nd Edition, Elsevier, 2018.
- George Varghese. Network Algorithmics. Elsevier, Inc., 2005.
Fundamental literature
- D. Medhi, K. Ramasamy: Network Routing. Algorithms, Protocols, and Architecture. 2nd Edition, Elsevier, 2018.
-
George Varghese. Network Algorithmics. Elsevier, Inc., 2005.
- Andrew Tanenbaum and David Wetherall. Computer Networks. Pearson, Global edition, 2021.
-
James Aweya. Switch/Router Architectures. Shared-Bus and Shared-Memory Based Systems. Wiley-IEEE Press, 1st edition, 2018.
-
James Aweya. Switch/Router Architectures. Systems with Crossbar Switch Farbrics. CRC Press, 1st edition, 2019.
Syllabus of lectures
- Introduction to networking.
- Routing theory.
- Transport layer, flow-control and congestion-control.
- Switch design.
- Router design.
- Packet classification.
- Peer to peer networks.
- Packet processing in operating system.
- Data center. Software Defined Networks.Virtual Network Functions.
- Network traffic identification and anomaly detection.
- Reputation systems.
- Privacy and anonymity on the Internet.
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. The mid-term exam cannot be repeated. The individual project. The oral final exam. The minimum for passing the final exam is 20 out of 60. If this is not achieved, the total score will be 0 points.
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. of lectures | E104 | 08:00 | 10:50 | 70 | 1MIT 2MIT | NCPS - NSEC NHPC NNET xx | Matoušek |
| Fri | lecture | 9., 10. of lectures | E104 | 08:00 | 10:50 | 70 | 1MIT 2MIT | NCPS - NSEC NHPC NNET xx | Grégr |
| Fri | seminar | 2., 9. of lectures | E104 | 11:00 | 11:50 | 70 | 1MIT 2MIT | NCPS - NSEC NHPC NNET xx | Grégr |
| Fri | seminar | 2026-02-13 | E104 | 11:00 | 11:50 | 70 | 1MIT 2MIT | NCPS - NSEC NHPC NNET xx | Veselý |
Course inclusion in study plans