Instructor/TA
Office
Phone
Email
Office Hours

Basem Shihada

4210

 

Basem.shihada

By Appointment

  • Time/Place: Sunday/Tuesday 10:30-12:00 noon at Room 3123
  • Website: www.shihada.com/teaching.htm
  • Required textbook: Piet Van Mieghem, Performance analysis of communications networks and systems, Cambridge university press, 2006.
  • 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.
  • Grading:
    • Homework: 20%
    • Exams:
      • Midterm 20%
      • Final 20%
    • Final Projects: 40%
    • Student must obtain the passing grade (70%) in the exams 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.

  • 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 taken from Prof. Pin-Han Ho, UW, lecture notes.
  • Calendar:
Date
Topics
Reading Comments/Exercises
       
System Performance Evaluation
 
Performance Measurement
  • Lecture [PDF]
 
Performance Modeling
  • Lecture [PDF]
 
7/09
Assignment 1
  • Due 21/09
  Analytic Modeling
  • Queuing Models with Single Service Facility
  • Deterministic Model
12/09
No Class
 
14/09
No Class
 
Birth-Death Model
  • Stochastic Model
  • Birth-Death Model
  • Birth-Death Model Solution Method
3/10
Assignment 2
  • Due 19/10
  • Solution [PDF]
5/10 Midterm Exam  
  • Room 3123 from 10:30-11:45AM
  • Solution [PDF]
  Markovian Queuing Model
  • M/G/1 Analysis [PDF]
Queuing Network Model
  • Lecture [PDF]
 
Open Network Model
  • Lecture [PDF]
 
26/10 Assignment 3
  • Due 9/11
  • Solution [PDF]
Closed Network Model
  • Closed Network Model
  • Computing G(N)
2/11 Final Project Proposal
  • 3 page description of your proposed final project. A clear statement of what problem you are modeling, why, how it stands with respect to prior work. The final project should also be simulated using your own simulator that will be studied in the coming weeks. Projects should be in groups of 5 students.
  • Due 9/11
Application to Computer Networks
  • Store & forward, Shortest-path Routing
  • Window Flow Control
14/11
No Class
 
16/11
No Class
 
Simulation
  • Lecture [PDF]
 
23/11 Assignment 4
  • Due 7/12
  • Solution [PDF]
Verification and Validation
  • Lecture [PDF]
 
30/11
Final Projects
  • Group 1 (TBD)
  • Group 2 (TBD)
 
5/12
Final Projects
  • Group 3 (TBD)
  • Group 4 (TBD)
 
7/12
Final Projects
  • Group 5 (TBD)
 
11/12
Final Exam Period
 
 

 

© 2010 Basem Shihada