ECE567 HOME PAGE

http://courses.ece.uiuc.edu/ece567/

Communication Network Analysis, Fall 2006

Remaining office hour: Tuesday, December 12, 1 p.m., at my CSL office (room 105 or 101).

The final exam will be in the usual classroom on Wednesday, December 13, 1:30-4:30 p.m. The exam will be comprehensive, with a bit more emphasis on problem sets 6 and 7. You may bring three pages of notes to consult during the exam.

Homework Assignments:
Problem set 1 solutions
Problem set 2 solutions
Notes on Foster-Lyapunov stability criteria (serves as problem set 3 and solutions)
Exam 1 solutions
Problem set 4 solutions
Problem set 5 solutions
Exam 2 solutions
Revised chapter 7 of notes
Problem set 6 solutions
Routing example for dynamic programming
Problem set 7 solutions Final Exam solutions

Instructor: Bruce Hajek
Office Hours: Tuesdays, 4-5 p.m. and Fridays 2-3 p.m. in Room 105 CSL

Some old exams
S02Examl , S02Exam2 , S02Final

This is a first high-level course in performance analysis and design of communication networks. Emphasis is on analytical and computational methods. Topics include:

Markov/Poisson/Renewal random processes
Basic queuing theory, including priority queues
Effective bandwidths
Deterministic delay calculus
Use of utility functions, fairness, prices
Multiple access, scheduling
Stochastic models of networks
Calculus of deterministic delay and service constraints
Dynamic programming applied to stochatic network problems
Distributed algorithms (time permitting)

Topics NOT included:

Internet protocols (see ECE/CS 338, )
Simulation techniques and packages (see CS 441)
Some proofs are not given, for discrete Markov processes, see Math 461
Collections of research papers (see research seminar, CS 491 Section RHK)

Prerequisites: CS/ECE 338 (Computer Communication Networks), and either ECE 434 (Random processes) or Math 366 (Applied probability), or consent of instructor.

Reading material: The course topics will closely follow the course notes. Each registered student will be given a copy of the notes, and they are available for download in pdf form here. The notes are required reading. Two recommended (not required) texts are on reserve in Grainger Library: (1) Kleinrock, Queueing Systems Volume 1: Theory and (2) Bertsekas and Gallager, Data Networks (2nd Ed.). A small amount of required reading from these two books will be assigned, and additions to the notes may be distributed during the semester.

Credit: One unit

Grading:
10% Problem sets (Roughly 7 problem sets will be assigned.)
20% Hour Exam 1 (Monday, October 16, 7-8:15 p.m., 245 Everitt Lab, one crib sheet allowed)
20% Hour Exam 2 (Monday, November 13, 7:8:15 p.m., 245 Everitt Lab, two crib sheets allowed)
50% Final Exam (Wednesday, December 13, 1:30-4:30 p.m., location to be announced, three crib sheets allowed)
Running scores for ECE 534 will be maintained on the Illinois Compass system (blue stem password required).

Miscellaneous policy: Reading assignments will be given with problem sets, and some reading material may be covered on exams, even if not discussed in class. Hour exams and the final will be closed book, except you may bring one sheet of notes (two-sided, no smaller than size 10 font or equivalent handwriting) to the first exam, two sheets to the second exam and three sheets to the final, to consult during the exams.

Collaboration on the homework is permitted, however each student must write and submit independent solutions. Homework is due within the first 5 minutes of the class period on the due date. No late homework will be accepted (unless an extension is granted in advance by the instructor).