Information Networks
-
Time/Place: Sunday/Tuesday 10:15-11:45 in B9-3135
-
Required textbook: Mor Harchol-Balter, "Performance Modeling and Design of Computer Systems Queueing Theory in Action", Cambridge University Press, 2013. [Available in Library]
-
Reference books:
-
E. Lazowska, J. Zahorjan, G. Graham, K. Sevcik, Quantitative System Performance, Computer System Analysis using Queueing Network Models, Prentice-Hall, [URL]
-
Leonard Kleinrock, Queueing Systems, vol. 1: Theory, John Wiley, 1975.
-
Thomas G. Robertazzi, Computer Networks and Systems, Springer, 2002.
-
Andrew S. Tanenbaum , Computer Networks, Prentice Hall, 2002
-
Research papers.
-
-
Course description: probability. Network structure of the Internet and the Web, performance modeling, experimental design, performance measurement, model development, analytic modeling, single queue facility, networks of queues, stochastic systems, deterministic systems, birth-death model analysis, closed network model, bottleneck, interactive networks, M/M/m queues, M/G/1 priority queues, Markovian queuing model, random numbers, discrete event simulation, verification and validation of simulation models, workload characterization and benchmarks.
-
Prerequisites: Students must have excellent understanding of computer networks, excellent skills in programming e.g., C/C++ or Java, understanding of probabilities, general background on network simulators, working with Linux systems.
Student must obtain the passing grade (70%) in the Homework and the final project to pass the course.
The course will include a major modeling and simulation project component that requires performing several paper reviews and simulations.
-
Grading:
-
Homework: 40%
-
Presentation: 10%
-
Final Projects: 50%
-
Exams: None
-
-
Homework policy: all assignments, including contributions to discussion, submitted by students in the course of this class should be work written by themselves specifically for this class. Students must clearly cite and reference each and every source that was used in their development. Where students use the actual words of a source, they must put those words inside quotation marks.
-
Lecture Content was mainly shared with Prof. Pin-Han Ho, UW, lecture notes.
-
Calendar:
Date | Topic | Content | Others |
29/08 |
Introduction to queueing theory concepts |
||
31/08 | Assignment 1 Due date: 14/09 | Assignment 1 | Solution [PDF] |
05/09 |
Introduction to system performance evaluation methods |
[PDF] Lecture | |
07/09 |
Introduction to system performance measurement methods |
[PDF] Lecture | |
14/09 | Assignment 2 Due date: 28/09 | Assignment 2 | Solution [PDF] |
14/09 |
Performance modeling |
[PDF] Lecture | |
19/09 |
Analytic modeling and stochastic systems |
[PDF] Queuing Models with Single Service Facility [PDF] Deterministic Model |
|
28/09 | Assignment 3 Due date: 19/10 | Assignment 3 | Solution [PDF] |
28/09 |
Birth-Death stochastic model |
[PDF] Stochastic Model [PDF] Birth-Death Model [PDF] Birth-Death Model Solution Method |
|
05/10 |
Markovian queuing model |
[PDF] Lecture [PDF] Lecture [PDF] M/G/1 Analysis [PDF] M/G/1 with vacations |
|
17/10 | Mid-Semester Break | ||
19/10 | Assignment 4 Due date: 09/11 | Assignment 4 | Solution [PDF] |
19/10 |
Queuing network model |
[PDF] Lecture | |
19/10 |
Open network model |
[PDF] Lecture | |
26/10 |
Closed network model |
[PDF] Lecture [PDF] Computing G(N) |
|
07/11 | Final project proposals Due date: 05/12 | ||
07/11 |
Application to computer networks |
[PDF] Store & forward, Shortest-path Routing [PDF] Window Flow Control |
|
21/11 |
Verification and validation |
[PDF] Lecture | |
23/11 | Event-Based Simulations | [PDF] Lecture | |
28/11 |
|
||
28/11 |
|
||
30/11 |
|
||
05/12 | Final Project Submission | ||
07/12 | Final Project Presentation |