Syllabus


Instructor Jorg Liebeherr, BA 4126, (416) 946-3403, jorg@comm.utoronto.ca
Office hours: Tuesday, 13:00-14:00, or by appointment (via email).
Prerequisites ECE361 (must be completed before taking this course)
Content:
  • Network traffic traces
  • Deterministic network analysis
  • Traffic shaping
  • Fairness and scheduling
  • Bandwidth estimation
  • Statistical multiplexing and stochastic analysis
Textbook: There is no required textbook for this course. There are typed class notes available on Quercus.
Lectures: Tuesday, Thursday, Friday, 12:00-13:00, all in MC 252.
  • Attendance of lectures is mandatory.
Labs: Monday , 9:00-12:00, GB243 (alternate weeks, see web page for schedule)
  • There are 5 labs. Each lab requires programming in Matlab (Lab 1) or Java (all other labs). Each lab requires the preparation of a lab report.
  • Dates of lab sessions and due dates are posted on the course website.
  • Lab instructions and supplemental material can be downloaded from the course website.
  • Lab reports are submitted individually or in groups of two. Submissions from groups with more than two students are not permitted.
  • Lab reports are submitted via Quercus. Instructions are posted on the course website.
  • Late submissions of lab reports are penalized by 20% of the total grade per day.
Tutorials: Weekly tutorial sessions
  • TUT 101: Thursday, 11:00-12:00, WB 219. The first tutorial is Jan 17.
  • TUT 102: Friday, 17:00-18:00, HA 401. The first tutorial is Jan 18.
  • Problem sets will be listed on the course web page.
  • Tutorials discuss problems that are relevant to quizzes and the final exam.
Class Participation:
  • Attendance of lectures
  • Active participation on discussion board (Piazza)
  • Participation in course evaluation by Dec 5 (class-wide mark)
Evaluation:
Final Exam (Type D) 45%
Quiz 1 15%
Quiz 2 15%
Labs 20%
Class Participation 5%
  • Quiz 1 and Quiz 2 are closed book, closed notes exams. They are given during a lecture and are 50 minutes long.
  • Type 2 Calculators are allowed in quizzes and final exam.
  • 1 (single-sided) handwritten sheet is permitted for Quiz 1. 2 (single-sided) or 1 (double-sided) handwritten sheet(s) are allowed in Quiz 2 and and final exam.
Remarking Policy The remarking policy is detailed on the course website.
Academic Integrity Academic misconduct will be handled according to university guidelines. Software may be used to verify integrity of electronically submitted materials.
Course Outcomes:
  • Knowledge of characeristics of network traffic.
  • Ability to conduct deterministic network analysis (delay, throughput, backlog).
  • Ability to provision buffer and delay requirements for network traffic.
  • Understanding of network control algorithms: shaping, scheduling, bandwdith estimation.
  • Exposure to fair scheduling and statistical multiplexing in packet networks.
  • Design of traffic regulators, link scheduling, and bandwdith estimation methods.
Detailed Schedule:
  • Week 1: Traffic Examples, Introduction to deterministic analysis, Buffered link.
  • Week 2: Min-plus convolution, Service curves.
  • Week 3: Min-plus deconvolution, Subadditive functions, Traffic envelopes.
  • Week 4: Minimal envelopes, Traffic regulators (Token bucket).
  • Week 5: Min-plus deconvolution (Part 2), Performance bounds.
  • Week 6: Capacity requirements, End-to-end delay analysis.
  • Week 7: Link scheduling, Residual service curve, FIFO, SP, EDF Scheduling.
  • Week 8: Fair bandwidth allocation, Fair queuing.
  • Week 9: Rate guarantees, Service Curve Earliest Deadline First (SCED), Max-plus network calculus.
  • Week 10: Guaranteed rate schedulers (Virtual Clock, PSRG), Min-plus system theory, Bandwidth estimation.
  • Week 11: Probability review, Introduction to statistical multiplexing.
  • Week 12: Central limit theorem, Chernoff bound, Bufferless multiplexer.
  • Week 13: Statistical multiplexing, Review and exam preparation.





 

 

 

 

 

 

 

 

 

Main Page