
Course Name: CSC0056 Data Communication 資料通訊 (Fall 2025)
Instructor: Chao Wang 王超
Teaching Assistant: Yongdian Lai 賴勇典
Course Meetings: Thursdays 09:10–12:10 (all are physical meetings)
Office Hours: Mondays and Wednesdays, 2–4pm @ room 511, Applied Science Building, Gongguan Campus; or by appointment
配合教育部雙語政策,此課程為 EMI 英文授課。
Contents
- Course Syllabus
- Course Schedule
- Textbooks and Other Resources
- Accessibility
- Academic Integrity
- Homework Assignment
Course Syllabus
This course is designed for graduate students, but motivated senior undergraduates are also welcome. This course is no substitution for fundamental courses in networking (e.g., Introduction to Computer Networks), and we shall not repeat topics therein.
This semester we will use broker-based data communication as a driving vehicle for our study of design, implementation, and evaluation of modern data communication amond computing hosts and devices. Students must know C and have working knowledge in Linux system. We will use both C and Golang (and some Python) for homework assignments. If you know C you should be able to learn Golang yourself. We will not teach Golang in class.
Students who want to take this course will also need to buy a WiFi-enabled Raspberry Pi (for example, Pi Zero 2 W ). We will use that for real data communication experiments.
Note that this course is no longer offered in hybrid format. All lectures are delivered physically in class hours.
Grading:
- Homework Assignments 60%
- Online/Offline Participation 10%
- Final presentation 20%
- Study note composition 10%
Course Schedule
- Course Introduction
- Data Communication Mechanisms
- Broker-Based Data Communication (1) Model and Design
- Broker-Based Data Communication (2) Implementation
- Broker-Based Data Communication (3) Evaluation
- The Queueing Model
- Markov Chains
- Poisson Process
- Queueing Systems
- Case Studies
- Data Communication Buses
- Communication Error Handling
- Research Paper Study and Student Presentation
Textbook and References
We will select materials from the following textbooks and references:
Textbook:
[1] Harchol-Balter, Mor. Performance modeling and design of computer systems: queueing theory in action. Cambridge University Press, 2013. ISBN 9781107027503. (Read it at NTNU library. Our library also owns an e-copy; click here via campus network.)
[2] Bertsekas, Dimitri and Gallager, Robert. Data networks (2nd edition). Prentice Hall, 1992. ISBN 0132009161. (Read it at NTNU library) (author’s page)
Additional References (non-exhaustive):
[1] William Feller. An Introduction to Probability Theory and Its Applications, Volume I (3rd edition). Wiley, 1968. ISBN 0471257087.
[2] Kurose, Jim and Ross, Keith. Computer Networking: A Top-Down Approach (5th edition or newer). Pearson, 2010. ISBN 0136079679.
Accessibility
Students in need are encouraged to bring their considerations to the instructor.
Academic Integrity
All homework assignments and exams must be completed individually and independently, 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
All homework assignments will be announced on Moodle.