Title:

Data Communications, Computer Networks and Protocols

Code:PDS
Ac.Year:2017/2018
Term:Summer
Curriculums:
ProgrammeFieldYearDuty
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&verbal)
Type of
instruction:
Hour/semLecturesSem. ExercisesLab. exercisesComp. exercisesOther
Hours:394207
 ExaminationTestsExercisesLaboratoriesOther
Points:60150025
Guarantor:Ryšavý Ondřej, doc. Ing., Ph.D., DIFS
Lecturer:Grégr Matěj, Ing., Ph.D., DIFS
Matoušek Petr, Ing., Ph.D., M.A., 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
Pluskal Jan, Ing., DIFS
Polčák Libor, Ing., Ph.D., 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.St.G.EndG.
Wedexam - 1. oprava2018-05-30D10509:0010:501MIT
Wedexam - 1. oprava2018-05-30D10509:0010:502MIT
ThuPDS - reklamace projektu2018-05-17C30415:0017:50
Thuexam - PDS - půlsemestrální zkouška2018-03-29D10518:0019:50
Frilecture - Náhradní rozvrh kvůli DOD2018-02-16E10508:0011:501MITxxxx
Frilecture - Náhradní rozvrh kvůli DOD2018-02-16E10508:0011:502MITxxxx
Frilecture - Náhradní rozvrh kvůli DOD2018-02-16E11208:0011:501MITxxxx
Frilecture - Náhradní rozvrh kvůli DOD2018-02-16E11208:0011:502MITxxxx
Friexam - řádná2018-05-18D10509:0010:501MIT
Friexam - řádná2018-05-18D10509:0010:502MIT
Friexam - řádná2018-05-18A11309:0010:501MIT
Friexam - řádná2018-05-18A11309:0010:502MIT
Friexam - 2. oprava2018-06-08D10514:0015:501MIT
Friexam - 2. oprava2018-06-08D10514:0015:502MIT
 
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 competences:
  Understanding communication functions and their implementations in computer networks; being informed about related formal tools.
Generic learning outcomes and competences:
  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:
 
  • Farrel, A.: The Internet and Its Protocols - A Comparative Approach, Morgan Kaufmann, 2004, ISBN 1-55860-913-X
  • Pužmanová, R.: Routing and Switching - Time of Convergence, Addison-Wesley, 2002, ISBN 0-201-39861-3
  • Keshav, S.: An Engineering Approach to Computer Networking, Addison-Wesley, 1997, ISBN 0-201-63442-2
  • G. Varghese: Network Algorithmics. Elsevier. 2005.
  • D. Medhi, K. Ramasamy: Network Routing. Algorithms, Protocols, and Architecture. Elsevier, 2007.
  • W. Stallings: High-speed Networks and Internets. Performance and Quality of Service, 2nd Edition, Prentice Hall, 2001.
Study literature:
 
  • Farrel, A.: The Internet and Its Protocols - A Comparative Approach. Morgan Kaufmann, 2004, ISBN 1-55860-913-X
  • Keshav, S.: An Engineering Approach to Computer Networking. Addison-Wesley, 1997, ISBN 0-201-63442-2
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: 54.162.165.158
Switch to IPv6 connection

DNSSEC [dnssec]