Title:

Data Communications, Computer Networks and Protocols

Code:PDS
Ac.Year:2018/2019
Sem:Summer
Curriculums:
ProgrammeField/
Specialization
YearDuty
IT-MSC-2MBI-Compulsory-Elective - group C
IT-MSC-2MBS1stCompulsory
IT-MSC-2MGM1stCompulsory
IT-MSC-2MIN-Compulsory-Elective - group C
IT-MSC-2MIS1stCompulsory
IT-MSC-2MMI-Elective
IT-MSC-2MMM-Elective
IT-MSC-2MPV1stCompulsory
IT-MSC-2MSK1stCompulsory
Language of Instruction:Czech
Credits:5
Completion:examination (written&oral)
Type of
instruction:
Hour/semLecturesSeminar
Exercises
Laboratory
Exercises
Computer
Exercises
Other
Hours:394207
 ExamsTestsExercisesLaboratoriesOther
Points:60150025
Guarantor:Ryšavý Ondřej, doc. Ing., Ph.D. (DIFS)
Deputy guarantor:Matoušek Petr, Ing., Ph.D., M.A. (DIFS)
Lecturer:Grégr Matěj, Ing., Ph.D. (DIFS)
Matoušek Petr, Ing., Ph.D., M.A. (DIFS)
Pluskal Jan, Ing. (DIFS)
Polčák Libor, Ing., Ph.D. (DIFS)
Ryšavý Ondřej, doc. Ing., Ph.D. (DIFS)
Veselý Vladimír, Ing., Ph.D. (DIFS)
Instructor:Grégr Matěj, Ing., Ph.D. (DIFS)
Letavay Viliam, Ing. (DIFS)
Pluskal Jan, Ing. (DIFS)
Veselý Vladimír, Ing., Ph.D. (DIFS)
Faculty:Faculty of Information Technology BUT
Department:Department of Information Systems FIT BUT
Substitute for:
Data Communications and Computer Networks (PDT), DIFS
Schedule:
DayLessonWeekRoomStartEndLect.Gr.Groups
Monlaboratory - PDS - Oprava projektu2019-05-06C228 07:0010:50
Monlaboratory - PDS - Oprava projektu2019-05-06C228 13:0016:50
Tuelaboratory - PDS - Oprava projektu2019-05-07C228 07:0010:50
Tuelaboratory - PDS - Oprava projektu2019-05-07C228 13:0018:50
Wedexam - 1. oprava2019-05-29D105 14:0015:501MIT 2MIT
Thuexam - 2. oprava2019-06-06G202 13:0014:501MIT 2MIT
Friexam - řádná2019-05-17D105 09:0010:501MIT 2MIT
Friexercise2019-02-15E112 11:0011:501MIT 2MIT MGM - MSK xx
Friexercise2019-03-29E112 11:0011:501MIT 2MIT MGM - MSK
Friexam - PDS - půlsemestrální zkouška2019-03-29E112 16:0017:50
 
Learning objectives:
  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.
Description:
  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.
Knowledge and skills required for the course:
  The sets, relations and mappings. The elementary notions of the graph theory. The elementary notions of communication protocols. Principles of Internet.
Subject specific learning outcomes and competencies:
  Understanding communication functions and their implementations in computer networks; being informed about related formal tools.
Generic learning outcomes and competencies:
  Understanding communication principles in current computer networks.
Syllabus of lectures:
 
  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.
Syllabus of laboratory exercises:
 
  • Basic network attacks.
Syllabus of computer exercises:
 
  1. Packet traversal
  2. Network troubleshooting
  3. Bitcoin P2P network
Syllabus - others, projects and individual work of students:
 
  • Design, modeling and implementation of a network application.
Fundamental literature:
 
  • R. White, E. Banks: Computer Networking Problems and Solutions: An innovative approach to building resilient, modern networks, Addison-Wesley Professional, 2018.
  • F. Behrouz: Data Communications and Networking: Fifth Edition, McGraw-Hill Higher Education, 2012.
  • D. Medhi, K. Ramasamy: Network Routing. Algorithms, Protocols, and Architecture. Elsevier, 2007.
  • Farrel, A.: The Internet and Its Protocols - A Comparative Approach, Morgan Kaufmann, 2004.
  • Pužmanová, R.: Routing and Switching - Time of Convergence, Addison-Wesley, 2002. 
Study literature:
 
  • R. White, E. Banks: Computer Networking Problems and Solutions: An innovative approach to building resilient, modern networks, Addison-Wesley Professional, 2018.
  • F. Behrouz: Data Communications and Networking: Fifth Edition, McGraw-Hill Higher Education, 2012.
Controlled instruction:
  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.
Progress assessment:
  Written mid-term exam and submitting project in due dates.
Exam prerequisites:
  Requirements for class accreditation are not defined.
 

Your IPv4 address: 34.201.121.213