3 Credits

Wednesday 3:00pm-5:40pm, Fall 2007

JAB 673

1. Network Design Problem Modeling

2. Optimization Methods

3. Multi-Commodity Flow Routing

4. Location and Topological Design

5. Fair Network

6. Resilient Network Design

7. Robust Network Design

8. Multi-Layer Networks

Related Courses: EL623, EL735, CS603, CS604

Michal Pióro, Deepankar Medhi

ISBN: 0125571895, Publisher: Morgan Kaufmann (July 1, 2004)

- “Data Networks (2nd Edition)”, D. Bertsekas and R. Gallager.
- “Telecommunications Network Design Algorithms”, A. Kershenbaum.
- “Network Optimization: Continuous and Discrete Models”, D. Bertsekas.
- “Introduction to Linear Optimization”, D. Bertsimas and J. N. Tsitsiklis
- “Convex
Optimization”, S. Boyd and L. Vandenberghe, [online
version], [slides]

- “Integer Programming”, L.Wosley.

Midterm: 40 Points;

Final/Projects: 40 Points

Class 2: (09/12/2007) Network Design Problems (NDP): Notations and Illustration. slides, pdf

Class 3: (09/19/2007) NDP: Technical Examples, and Modeling. slides, pdf

Class 4: (10/03/2007) NDP Extensions. slides, pdf

Class 5: (10/10/2007) Optimization Methods (I): Linear Programming, Integer Programming, Mixed Integer Programming. slides, pdf

Class 6: (10/17/2007) Optimization Methods (II): Stochastic Heuristics, AMPL/CPLEX Package. slides, pdf

Class 7: (10/24/2007) Location and Topological Design. slides, pdf

Class 8: (10/31/2007) Networks with Shortest-Path Routing. slides, pdf

Class 9: (11/14/2007) Fair Networks. slides, pdf

Class 10: (11/28/2007) Resilient Network Design. slides, pdf

Class 11: (12/05/2007) Multi-Hour and Multi-Layer Network Modeling and Design. slides, pdf

Reference: Sample Projects from Class of 2006

Phone : (718) 260-3959

FAX: (718) 260-3906

yongliu@poly.edu