Course detail

Data Communications, Computer Networks and Protocols

FIT-PDSAcad. year: 2020/2021

Transport protocols. Routing algorithms. Design of switches and routers. Packet processing in the operating system. IP address lookup. Packet flitering and classification. Network traffic identification. Detection of network incidents. Privacy in computer networks. Concepts of P2P, CDN and SDN networks.

Language of instruction

Czech, English

Number of ECTS credits

Mode of study

Not applicable.

Guarantor

doc. Ing. Ondřej Ryšavý, Ph.D.

Department

Department of Information Systems (UIFS)

Learning outcomes of the course unit

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. Principles of P2P, CDN and SDN networks.

Understanding communication principles and implementation in current computer networks.

Prerequisites

The set theory, graph theory and relations. Fundamentals of communication protocols. Principles of Internet.

Co-requisites

Not applicable.

Planned learning activities and teaching methods

Not applicable.

Assesment methods and criteria linked to learning outcomes

Written mid-term exam and submitting project in due dates.
Exam prerequisites:
Requirements for class accreditation are not defined.

Course curriculum

Not applicable.

Work placements

Not applicable.

Aims

Understand principles and implementation of network algorithms in computer networks. Become familiar with design of network devices. Learn advanced methods for network traffic identification and anomaly detection. Introduce concepts of peer-to-peer networks, content delivery networks and software defined networks.

Specification of controlled education, way of implementation and compensation for absences

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.

Recommended optional programme components

Not applicable.

Prerequisites and corequisites

Not applicable.

Basic literature

D. Medhi, K. Ramasamy: Network Routing. Algorithms, Protocols, and Architecture. 2nd Edition, Elsevier, 2018.

Recommended reading

D. Medhi, K. Ramasamy: Network Routing. Algorithms, Protocols, and Architecture. 2nd Edition, Elsevier, 2018.

Classification of course in study plans

  • Programme IT-MSC-2 Master's

    branch MGM , 1 year of study, summer semester, compulsory
    branch MBI , 0 year of study, summer semester, compulsory-optional
    branch MBS , 1 year of study, summer semester, compulsory
    branch MIN , 0 year of study, summer semester, compulsory-optional
    branch MIS , 1 year of study, summer semester, compulsory
    branch MMI , 0 year of study, summer semester, elective
    branch MMM , 0 year of study, summer semester, elective
    branch MPV , 1 year of study, summer semester, compulsory
    branch MSK , 1 year of study, summer semester, compulsory

  • Programme MITAI Master's

    specialization NISY , 0 year of study, summer semester, elective
    specialization NADE , 0 year of study, summer semester, elective
    specialization NBIO , 0 year of study, summer semester, elective
    specialization NCPS , 0 year of study, summer semester, compulsory
    specialization NEMB , 0 year of study, summer semester, elective
    specialization NHPC , 0 year of study, summer semester, compulsory
    specialization NGRI , 0 year of study, summer semester, elective
    specialization NIDE , 0 year of study, summer semester, elective
    specialization NISD , 0 year of study, summer semester, elective
    specialization NMAL , 0 year of study, summer semester, elective
    specialization NMAT , 0 year of study, summer semester, elective
    specialization NNET , 0 year of study, summer semester, compulsory
    specialization NSEC , 0 year of study, summer semester, compulsory
    specialization NSEN , 0 year of study, summer semester, elective
    specialization NSPE , 0 year of study, summer semester, elective
    specialization NVER , 0 year of study, summer semester, elective
    specialization NVIZ , 0 year of study, summer semester, elective

Type of course unit

 

Lecture

39 hod., optionally

Teacher / Lecturer

Ing. Matěj Grégr, Ph.D.
doc. Ing. Petr Matoušek, Ph.D., M.A.
Ing. Vladimír Veselý, Ph.D.

Syllabus

  1. Routing theory.
  2. Transport layer, flow-control and congestion-control.
  3. Switch design.
  4. Router design.
  5. Packet processing in operating system.
  6. Packet classification and data filtering.
  7. Intrusion detection. Network traffic identification.
  8. Reputation systems.
  9. Privacy and anonymity on the Internet.
  10. Peer to peer networks.
  11. Content delivery networks.
  12. Data center. Software Defined Networks.Virtual Network Functions. 

Fundamentals seminar

4 hod., compulsory

Teacher / Lecturer

doc. Ing. Petr Matoušek, Ph.D., M.A.

Laboratory exercise

2 hod., compulsory

Teacher / Lecturer

doc. Ing. Petr Matoušek, Ph.D., M.A.

Syllabus

  • Advanced network traffic processing.

Project

26 hod., compulsory

Teacher / Lecturer

doc. Ing. Petr Matoušek, Ph.D., M.A.

Syllabus

  • Advanced metods for network traffic analysis.