Note: This page is for the past semester. For historical data, see the archives.
Course Name: CSC0056 Data Communication 資料通訊 (Fall 2019)
Instructor: Chao Wang 王超
Course Meetings: Mondays 9:10 - 12:10 in room C007, Gongguan Campus
Office Hours: Wednesdays and Fridays, 10am-noon, in my office (room 511, Applied Science Building, Gongguan Campus), or by appointment
First Exam: Nov 4, 9:10 - 12:10, in class
Final Exam: Jan 6, 9:10 - 12:10, in class
This course is offered as an all-English course.
Contents
- Course Syllabus
- Course Schedule
- Textbooks and Other Resources
- Accessibility
- Academic Integrity
- Homework Assignment
Course Syllabus
Description:
Data communication is an essential part of modern computer networks and Internet-of-Things (IoT) systems. The objectives of this course are for each student to:
- learn classic data communication algorithms and protocols;
- gain insight into analyzing data communication systems; and
- engage in recent advances in data communication systems.
The first half of this course (i.e., before the first exam) will focus on how to analyze a data communication network. The second half will cover some classic algorithms and protocols in data communications, followed by recent advances in this field.
Prerequisites:
This course is for both senior undergraduate students and graduate students. Students are recommended to be familiar with materials taught in Computer Networks or an equivalent course.
Grading:
Course Schedule
| # | Date | Topic | Readings |
|---|---|---|---|
| 1 | Sep 9 | Course Introduction | [1] Sections 1.1-1.2 |
| 2 | Sep 16 | Layered Network Architecture | [1] Sections 1.3, 2.1-2.3 |
| 3 | Sep 23 | Point-to-Point Protocols | [1] Sections 2.3-2.4.2, 2.8.1-2.8.2, 2.9.1-2.9.4 |
| 4 | Sep 30 | (cancelled due to typhoon) | same as above |
| 5 | Oct 7 | Point-to-Point Protocols (2) | same as above, plus 2.4.3 and 2.8.4 |
| 6 | Oct 14 | Queueing Model and Little’s Theorem | [1] Sections 3.1-3.2 |
| 7 | Oct 21 | Markov Chain and Queueing Systems | [1] Sections 3.3-3.3.1 and Appendix A |
| 8 | Oct 28 | More on Queueing Systems | [1] Sections 3.3.1-3.4.1 |
| 9 | Nov 4 | First Exam | |
| 10 | Nov 11 | Multiaccess Communication | [1] Sections 4.1-4.2 |
| 11 | Nov 18 | Aloha protocols | [1] Sections 4.2, 4.4-4.4.1, 4.5 before 4.5.1, and 4.6 |
| 12 | Nov 25 | Shortest Path Routing | [1] Sections 5.2-5.2.3 |
| 13 | Dec 2 | Network Flow Algorithms | [1] Section 5.4 before 5.4.1; Sections 5.5-5.6 |
| 14 | Dec 9 | Flow Control | [1] Sections 6.1-6.2.1, 6.3, and 6.5.1 |
| 15 | Dec 16 | Real-Time Data Communication | see page 4 in the lecture slides |
| 16 | Dec 23 | Time Synchronization and Timely Data Replication | see page 4 in the lecture slides |
| 17 | Dec 30 | Error Correction Code, CAN, and Course Review | (i) and (j) |
| 18 | Jan 6 | Final Exam |
The readings assignment each week is designed for you to gain some background of the topic before class. Read them and note where you found interesting and/or challenging. Bring your findings to class for further discussion. I will also cover additional materials in class.
Textbooks and Other Resources
Textbooks:
[1] Bertsekas, Dimitri and Gallager, Robert. Data networks (2nd edition). Prentice Hall, 1992. ISBN 0132009161. (Required) (NTNU library) (author’s page)
[2] Harchol-Balter, Mor. Performance modeling and design of computer systems: queueing theory in action. Cambridge University Press, 2013. ISBN 9781107027503. (author’s book intro)
[3] Kurose, Jim and Ross, Keith. Computer Networking: A Top-Down Approach (5th edition or newer). Pearson, 2010. ISBN 0136079679
[4] Andrew S. Tanenbaum. Computer Networks (4th edition or newer). Peason, 2003. ISBN 0130384887
[5] William Feller. An Introduction to Probability Theory and Its Applications, Volume I (3rd edition). Wiley, 1968. ISBN 0471257087
Other Resources:
A wealth of helpful and relevant articles/tools may be found on-line. Here I picked some for the materials taught in this course:
(a) AUTOSAR (in particular, its layered software architecture).
(b) Industrial Internet Reference Architecture.
(c) Further reading on error detection/correction (access it via our campus network to get a proper access authorization).
(d) A good visual demonstration of Markov chains
(e) Industrial Internet Reference Architecture v1.9
(f) Chao Wang, Christopher Gill, and Chenyang Lu. Real-Time Middleware for Cyber-Physical Event Processing. ACM Transactions on Cyber-Physical Systems 3, 3, Article 29 (August 2019)
(g) Chao Wang, Christopher Gill, Chenyang Lu. FRAME: Fault Tolerant and Real-Time Messaging for Edge Computing. IEEE International Conference on Distributed Computing Systems (ICDCS), 2019.
(h) Time synchronization: Difference between accuracy and precision in measurement
(i) Joseph A. Gallian. Contemporary Abstract Algebra (7th edition). Brooks/Cole, 2010. ISBN 9780495831532
(j) CAN Specification, Version 2.0. You can learn a lot from this very good documentation.
Accessibility
Students with disabilities are encouraged to bring considerations to the attention of the instructor, potentially including accommodations for exams.
Academic Integrity
Homeworks must be completed individually and independently. Exams must be completed individually and independently without reference to materials or devices, except as specifically allowed by the instructor.
Academic integrity is a key component of your education, which is for your benefit. Anyone found to be cheating or helping someone else cheat will receive zero score for that homework/exam. Please reflect on the university’s motto: Sincerity 誠, Integrity 正, Diligence 勤, Simplicity 樸.
Homework Assignment
Students should submit all their homework assignments via Moodle.
- Homework1
- Homework2
- Homework3
- Homework4
- Homework5
- Homework6