A pdf version of this document is available here.
CRN | 30322 |
Course Number | ECEC-633 |
Section Number | 501 |
Credits | 3.0 |
Time | Thursdays 6pm - 8:50pm |
Room | LeBow 241 |
Instructor | Steven Weber |
Restrictions | ECEC-632 |
Department | Electrical and Computer Engineering |
Perspectives in the areas of switch/router architectures, scheduling for best-effort and guaranteed services, QoS mechanisms and architectures, web protocols and applications, network interface design, optical networking, and network economics. The course also includes a research project in computer networking involving literature survey, critical analysis, and finally, an original and novel research contribution.
![]() |
Primary text (required) | |
Title | Fundamentals of Queueing Networks: Performance, Asymptotics, and Optimization | |
Authors | Hong Chen and David D. Yao | |
Publisher | Springer | |
ISBN | 0387951660 | |
Edition | 1st |
We will cover Chapters 4-12, one chapter each of the 9 non-exam weeks of the quarter. In addition to the material in the text, a paper from the networking literature will be assigned each week.
Homework (one problem set per week) | 30% |
Midterm Exam (Lectures 1-4) | 30% |
Final Exam (Lectures 5-9) | 40% |
Makeup exams are only available if you are unable to attend due to a severe health problem or a death in your family. Homeworks are due at the beginning of class, one week following the class in which they were assigned. Late homeworks will not be accepted.
In accordance with Drexel University policy, any student with a documented disability who needs accommodations is encouraged to contact the Office of Disability Services (215-895-1401) or speak directly to the professor for further information about this office. Students must register with the Office of Disability Services and receive an Accommodation Verification Form prior to receiving accommodations. Contact with the Office of Disability Services is strictly confidential. Please make contact as early in the term as possible in order to receive timely accommodations.
All students sitting in the classroom during the class must be registered for the course and on the class list supplied to the instructor for the second class. Any student not on the list at that time will be asked to leave until proper registration is obtained.
The Drexel University policy on academic dishonesty may be found here and will be strictly enforced. Plagiarism, fabrication, and cheating will, at the discretion of the instructor, constitute grounds for failure of the course.
Please read the assigned materials for the lecture before the class in which it is covered.
Class | Date | Subject | Text Chapters |
1 | 4/1 | Kelly Networks | Chen & Yao, Chapter 4 |
2 | 4/8 | Technical Desiderata | Chen & Yao, Chapter 5 |
3 | 4/15 | Single-Station Queues | Chen & Yao, Chapter 6 |
4 | 4/22 | Generalized Jackson Networks | Chen & Yao, Chapter 7 |
5 | 4/29 | Midterm Exam | Chen & Yao, Chapter 4-7 |
6 | 5/6 | A Two-Station Multiclass Network | Chen & Yao, Chapter 8 |
7 | 5/13 | Feedforward Networks | Chen & Yao, Chapter 9 |
8 | 5/20 | Brownian Approximations | Chen & Yao, Chapter 10 |
9 | 5/27 | Conservation Laws | Chen & Yao, Chapter 11 |
10 | 6/3 | Scheduling of Fluid Networks | Chen & Yao, Chapter 12 |
11 | 6/10 | Final Exam | Chen & Yao, Chapter 8-12 |