EE 644 Computer Communication Networks

Syllabus, Spring 1998

Instructor: Galen Sasaki

• Office: Holmes 436. Office Hrs: MWF 3:30-4:20pm
• Tel: 956-6103. Email: sasaki@spectra.eng.hawaii.edu

Prerequisites: EE 342 or equivalent, i.e., a good background in undergraduate probability theory.

Textbook: "Data Networks" by Bertsekas and Gallager

Time: MWF 2:30-3:20. Room: Holmes 242.

Goals: This is a first year graduate level course on computer communication networks focusing on research issues. It will cover computer network architectures, performance evaluation techniques, optimization methods for design and control, and distributed network algorithms.

Lecture Topics:

1. An Overview of Computer Network Architecture: Store-and-forward and circuit switching, layered network architecture, the OSI network model. Discussion of network functions at the Data Link Control and Network Layers.
2. Performance Evaluation Techniques -- Queueing Theory: Markov chains, queueing models, Little theorem, single server queueing systems, multiple server queueing systems, prioritized and multiuser queueing systems, and product form solutions.
3. Local Area Networks (LANs): token ring, token bus, register insertion ring, ALOHA protocol, CSMA, CSMA/CD.
4. Network Algorithms for Control: e.g., spanning tree algorithms, shortest path algorithms, search algorithms, etc.
5. Optimal Routing: modeling network routing as nonlinear optimization problems, flow deviation method, and gradient projection algorithms.
6. Flow Control: flow control mechanisms for throughput and fairnes. For example, stop-wait, go-back-n or sliding window, link by link flow control, leaky bucket, max-min fair access.
7. Other Topics (Time permiting): optical networks, switches, quality of service.

Grading: The final grade will be based on Midterm Exam 1 (20%), Midterm Exam 2 (20%), Final Exam (20%), Homeworks (20%), and Projects (20%). The midterm exams, final exam, and the project will each be given a score of up to 100. The letter grade assigned to a score is

For homeworks, a score is computed as follows. Each homework problem is assigned a number of points, and the points awarded is 100% for the correct answer, 50% for a reasonable attempt, and 0% for little or no attempt. The homework score is computed using the formula (T/M)x100, where T = Total number of homework points, and M = Maximum number of homework points possible. The letter grade assigned to a homework score is

The following is a tentative list of projects which is subject to change:

• Simulation project 1 (5 pts): single server queueing system.
• Simulation project 2 (5 pts): multiaccess system.
• Simulation project 3 (10 pts): network or switch.
• Project based upon a research paper.
  • Oral Presentation, 20-30 min (30 pts).
  • Final Written Report (50 pts)