Course details
Data Communications, Computer Networks and Protocols
PDS Acad. year 2023/2024 Summer semester 5 credits
Transport protocols. Routing algorithms. Switch and router design. Principles of P2P communication. Network traffic classification. Packet processing in the operating system. Network protocol identification and anomaly detection. Reputation systems. Data centres, 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 exercises
- 2 hrs laboratories
- 26 hrs projects
Assessment points
- 60 pts final exam (oral part)
- 15 pts mid-term test (written part)
- 25 pts projects
Department
Lecturer
Matoušek Petr, doc. Ing., Ph.D., M.A. (DIFS)
Veselý Vladimír, Ing., Ph.D. (DIFS)
Instructor
Jeřábek Kamil, Ing., Ph.D. (DIFS)
Matoušek Petr, doc. Ing., Ph.D., M.A. (DIFS)
Poliakov Daniel, Ing. (DIFS)
Veselý Vladimír, Ing., Ph.D. (DIFS)
Learning objectives
Understand the principles and implementation of network algorithms in computer networks. Become familiar with the design of common network devices. Learn advanced methods for network traffic classification and analysis. Understand the architecture of P2P networks, SDN and network programming. Get an overview of network security and privacy.
Why is the course taught
The course prepares students to solve advanced engineering tasks in area of network communication, network applications and infrastructure.
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.
- IP address lookup and 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
- P4 network programming.
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.
Exam prerequisites
Requirements for class accreditation are not defined.
Course inclusion in study plans
- Programme IT-MGR-2, field MBI, MIN, any year of study, Compulsory-Elective group C
- Programme IT-MGR-2, field MBS, MGM, MIS, MPV, MSK, 1st year of study, Compulsory
- Programme IT-MGR-2, field MMM, any year of study, Elective
- Programme MITAI, field NADE, NBIO, NEMB, NEMB up to 2021/22, NGRI, NIDE, NISD, NISY, NISY up to 2020/21, NMAL, NMAT, NSEN, NSPE, NVER, NVIZ, any year of study, Elective
- Programme MITAI, field NCPS, NHPC, NNET, NSEC, any year of study, Compulsory