| Title: | Data Communications, Computer Networks and Protocols |
|---|
| Code: | PDS |
|---|
| Ac.Year: | 2011/2012 |
|---|
| Term: | Summer |
|---|
| Study plans: | |
|---|
| Language: | Czech, English |
|---|
| Private info: | http://www.fit.vutbr.cz/study/courses/PDS/private/ |
|---|
| Credits: | 5 |
|---|
| Completion: | examination (written&verbal) |
|---|
Type of instruction: | | Hour/sem | Lectures | Sem. Exercises | Lab. exercises | Comp. exercises | Other |
|---|
| Hours: | 39 | 4 | 2 | 0 | 7 |
|---|
| | Examination | Tests | Exercises | Laboratories | Other |
|---|
| Points: | 60 | 15 | 0 | 0 | 25 |
|---|
|
|---|
| Guarantee: | Švéda Miroslav, prof. Ing., CSc., DIFS |
|---|
| Lecturer: | Švéda Miroslav, prof. Ing., CSc., DIFS |
| Instructor: | Grégr Matěj, Ing., DIFS Trchalík Roman, Mgr., DIFS Veselý Vladimír, Ing., DIFS |
|---|
| Faculty: | Faculty of Information Technology BUT |
|---|
| Department: | Department of Information Systems FIT BUT |
|---|
| Substitute for: | |
|---|
| Schedule: | | Day | Lesson | Week | Room | Start | End | Lect.Gr. | St.G. | EndG. |
|---|
| Tue | exercise | lectures | D105 | 08:00 | 08:50 | 1MIT | 17 | 18 |
| Tue | exercise | lectures | D105 | 08:00 | 08:50 | 1MIT | 14 | 14 |
| Tue | exercise | lectures | D105 | 08:00 | 08:50 | 1MIT | 11 | 12 |
| Tue | exercise | lectures | D105 | 08:00 | 08:50 | 2MIT | xx | xx |
| Tue | lecture | lectures | D105 | 09:00 | 11:50 | 1MIT | 11 | 12 |
| Tue | lecture | lectures | D105 | 09:00 | 11:50 | 1MIT | 14 | 14 |
| Tue | lecture | lectures | D105 | 09:00 | 11:50 | 1MIT | 17 | 18 |
| Tue | lecture | lectures | D105 | 09:00 | 11:50 | 2MIT | xx | xx |
| Thu | exercise - demonstrační cvičení | 2012-03-01 | D105 | 17:00 | 18: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. 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. |
| 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: |
|---|
- Coding for error detection and correction, error control.
- Bit and packet synchronization.
- Switching techniques.
- Label switching.
- Packet-error control.
- Router architecture.
- Queue theory, network of queues.
- Multicast addressing and routing.
- BGP routing. Routing in IPv6.
- WLAN routing, routing in sensors networks.
- Resource reservation and QoS.
- Protocol engineering.
- Formal specification and verification.
|
| Syllabus of laboratory exercises: |
|---|
- BGP routing.
|
| Syllabus of computer exercises: |
|---|
- Coding.
- Programming in Libnet. Modeling and simulation in Omnet++.
|
| Syllabus - others, projects and individual work of students: |
|---|
- Design, modeling and implementation of a simple switch.
|
| 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 2 projets in due dates. |
| Exam prerequisites: |
|---|
Requirements for class accreditation are not defined. |
| |