Course detail

Data Communications, Computer Networks and Protocols

FIT-PDSAcad. year: 2018/2019

Coding for error detection and correction, error control. Packet synchronization. Switch architecture. Label switching technique. Packet-error control. Architecture of routers, queuing theory. Multicast addressing and routing. Exterior routing using BGP. Routing in IPv6 and their alternatives. Routing in wireless and sensor networks. Resource reservation and QoS. Protocol engineering. Formal specifications and verification of network communication.

Language of instruction

Czech

Number of ECTS credits

5

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 communication functions and their implementations in computer networks; being informed about related formal tools.
Understanding communication principles in current computer networks.

Prerequisites

The sets, relations and mappings. The elementary notions of the graph theory. The elementary notions 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 communication functions and their implementations in computer networks; understand archicture of basic network devices. Be aware of related formal tools for modelling, simulation and verification of network communication.

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. 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.

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 MMI , 0 year of study, summer semester, elective
    branch MBI , 0 year of study, summer semester, compulsory-optional
    branch MSK , 1 year of study, summer semester, compulsory
    branch MMM , 0 year of study, summer semester, elective
    branch MBS , 1 year of study, summer semester, compulsory
    branch MPV , 1 year of study, summer semester, compulsory
    branch MIS , 1 year of study, summer semester, compulsory
    branch MIN , 0 year of study, summer semester, compulsory-optional
    branch MGM , 1 year of study, summer semester, compulsory

Type of course unit

 

Lecture

39 hod., optionally

Teacher / Lecturer

doc. Ing. Ondřej Ryšavý, Ph.D.
doc. Ing. Petr Matoušek, Ph.D., M.A.
Ing. Jan Pluskal, Ph.D.
Ing. Vladimír Veselý, Ph.D.
Ing. Libor Polčák, Ph.D.
Ing. Matěj Grégr, Ph.D.

Syllabus

  1. L2 and L3 technologies.
  2. Technologies for network and traffic control.
  3. Transport layer, flow-control and congestion-control.
  4. Switch architecture.
  5. Routing and switching theory.
  6. Router architecture.
  7. Packet processing in operating system.
  8. Software Defined Networks.
  9. Architecture of peer-to-peer networks.
  10. Anonymity on the Internet.
  11. IDS and IPS.
  12. Protocol engineering and formal methods in protocol design.
  13. Net neutrality.

Fundamentals seminar

4 hod., compulsory

Teacher / Lecturer

Ing. Jan Pluskal, Ph.D.
Ing. Vladimír Veselý, Ph.D.
Ing. Viliam Letavay
Ing. Matěj Grégr, Ph.D.

Laboratory exercise

2 hod., compulsory

Teacher / Lecturer

Ing. Viliam Letavay
Ing. Matěj Grégr, Ph.D.
Ing. Jan Pluskal, Ph.D.
Ing. Vladimír Veselý, Ph.D.

Syllabus

  • Basic network attacks.

Project

7 hod., compulsory

Teacher / Lecturer

Ing. Jan Pluskal, Ph.D.
Ing. Viliam Letavay
Ing. Vladimír Veselý, Ph.D.
Ing. Matěj Grégr, Ph.D.

Syllabus

  • Design, modeling and implementation of a network application.