Faculty of Information Technology, BUT

Course details

Data Communications, Computer Networks and Protocols

PDS Acad. year 2011/2012 Summer semester 5 credits

Current academic year

Coding for error detection and correction, error control. Bit and 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. Routing in wireless and sensor networks. Resource reservation and QoS. Protocol engineering. Formal specifications and verification of network communication.

Guarantor

Language of instruction

Czech, English

Completion

Examination (written+oral)

Time span

39 hrs lectures, 4 hrs exercises, 2 hrs laboratories, 7 hrs projects

Assessment points

60 exam, 15 half-term test, 25 projects

Department

Lecturer

Instructor

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.

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.

Prerequisite kwnowledge and skills

The sets, relations and mappings. The elementary notions of the graph theory. The elementary notions of communication protocols. Principles of Internet.

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

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.

Syllabus of lectures

  1. Coding for error detection and correction, error control.
  2. Bit and packet synchronization.
  3. Switching techniques.
  4. Label switching.
  5. Packet-error control.
  6. Router architecture.
  7. Queue theory, network of queues.
  8. Multicast addressing and routing.
  9. BGP routing. Routing in IPv6.
  10. WLAN routing, routing in sensors networks.
  11. Resource reservation and QoS.
  12. Protocol engineering.
  13. Formal specification and verification.

Syllabus of laboratory exercises

  • BGP routing.

Syllabus of computer exercises

  1. Coding.
  2. Programming in Libnet. Modeling and simulation in Omnet++.

Syllabus - others, projects and individual work of students

  • Design, modeling and implementation of a simple switch.

Progress assessment

Written mid-term exam and submitting 2 projets in due dates.

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.

Exam prerequisites

Requirements for class accreditation are not defined.
Back to top