Back to Courses


CDS 270

CDS 270 -- Fall 2006
First Term

Optimization, Game and Layering in Communication Networks

Basic optimization theory, basic knowledge in communication networks.

Course Description

This course discusses various equilibrium solution concepts and convergent algorithms in optimization and game theory, and their applications to network design and control. The underlying theme is “network protocols as distributed algorithms achieving various equilibria”. The objective is to introduce mathematically rigorous tools for analyzing current network protocols and designing new ones. Topics will include: Equilibrium solution concepts and convergent algorithms in optimization and game theory, the utility maximization framework of TCP congestion control, layering as optimization decomposition, path algebra and routing, contention control, power control, and distributed mechanism design for network problems.

Units and Grading

6 units (2-0-4); pass/fail, or letter grade.
Wednesday 4 PM - 6 PM; 114 Steele
Lijun Chen (
Office hours: by appointment
Office: room 5 Steele; Ext. 3367


  • 01 Dec: The report will be due Monday, December 11th, if you take letter grade.
  • 15 Nov: We will add a class this Friday, November 17th in 110 Steele at 4:00pm.
  • 07 Nov: We will move this week's class to this Thursday, November 9th.
  • 30 Oct: There will be no class this Wednesday, November 1st. We will re-schedule this class to another time.
  • 27 Sep: I've requested the library to reserve the reference texts for the course.
  • 23 Sep: Syllabus is posted.
  • 21 Sep: The organizing meeting will be on Wednesday, September 27, 2006 in 114 Steele at 4:00 PM. The lectures will begin in the second week.
  • 21 Sep: The course announcement.

Course Material

Useful Links


Thanks to Prof. John Doyle and Dr. Maryam Fazel for their support and help. Many thanks also go to Prof. Steven Low for letting me to use and modify some of his lecture slides on congestion control, and Prof. Jennifer Rexford for letting me use and modify some of her lecture slides on routing.