Data Communications, Computer Networks and Protocols
|Language of Instruction:||Czech|
|Guarantor:||Ryšavý Ondřej, doc. Ing., Ph.D. (DIFS)|
|Deputy guarantor:||Matoušek Petr, Ing., Ph.D., M.A. (DIFS)|
|Lecturer:||Matoušek Petr, Ing., Ph.D., M.A. (DIFS)|
Ryšavý Ondřej, doc. Ing., Ph.D. (DIFS)
Švéda Miroslav, prof. Ing., CSc. (DIFS)
|Instructor:||Grégr Matěj, Ing., Ph.D. (DIFS)|
Marek Marcel, Ing. (FIT)
Veselý Vladimír, Ing., Ph.D. (DIFS)
|Faculty:||Faculty of Information Technology BUT|
|Department:||Department of Information Systems FIT BUT|
|Fri||lecture||lectures||D105 ||08:00||10:50||1MIT 2MIT ||MBS MGM MIS MPV MSK xx |
|Fri||exercise||lectures||D105 ||11:00||11:50||1MIT 2MIT ||MBS MGM MIS MPV MSK xx |
| || ||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.|
| || ||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:|
- L2 and L3 technologies.
- Technologies for network and traffic control.
- Transport layer, flow-control and congestion-control.
- Switch architecture.
- Routing and switching theory.
- Router architecture.
- Packet processing in operating system.
- Software Defined Networks.
- Architecture of peer-to-peer networks.
- Anonymity on the Internet.
- IDS and IPS.
- Protocol engineering and formal methods in protocol design.
- Net neutrality.
|Syllabus of laboratory exercises:|
|Syllabus of computer exercises:|
- Packet traversal
- Network troubleshooting
- Bitcoin P2P network
|Syllabus - others, projects and individual work of students:|
- Design, modeling and implementation of a network application.
- 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.
- 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
| || ||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.|
| || ||Written mid-term exam and submitting project in due dates.|
| || ||Requirements for class accreditation are not defined.|