ENG M 680 Section B1
Network Optimization and Reliability
January 2006 - April 2006
Thursdays 3:00 PM to 6:00 PM
NOTE: This course is now available in the Department of Electrical and Computer Engineering as ECE 681 (Survivable Networks). Please contact that department for more information.
Room: NREF 2-090
Instructor: John Doucette, Assistant Professor, Engineering Management
Email:
![]()
Office: 5-8F Mechanical Engineering Building (5th floor West)
Office Hours: Fridays, 9:00 AM to 11:00 PM
Textbook:
Marking Scheme:
Assignments: 30%
Midterm Exam: 30%
Course Project: 30%
Class Participation:10%
Course Content:
Topics include an overview of network technology, network restorability,
reliability, and availability, restoration and protection switching, basics of
graph theory, traffic routing methods (all distinct routes, k-shortest paths,
max-flow min-cut theory, min-cost network flow), optimization methods (linear
programming, simulated annealing, genetic algorithms, tabu search), SONET and
WDM rings, ring types, sizing and loading, multi-ring network design, dual-ring
interconnect and availability, topology considerations, types of mesh-restorable
networks, theory for optimal capacity design, capacity design heuristics, theory
for topological design of mesh networks, distributed mesh restoration, mesh
network availability analysis, and emerging concepts such as self-organizing
networks, over-subscription design theory, p-cycles, and hybrid networks.
Course Outline: here
Lecture Slides and Other Resources: (LINKS REMOVED)
| Lecture # | Date | Topic | Chapters |
| 1 | 12 Jan 2006 | Lecture Slides: Course Introduction Lecture Slides:
Introduction to Transport Networks |
1 – 2 |
| 2 | 19 Jan 2006 | Lecture Slides: Basic network survivability concepts Reading: Doucette, Ph.D. Thesis, Ch 4, 2004 Reading: Doucette, Ph.D. Thesis, Ch 6, 2004 Reading: Grover, IEEE Canadian Review, 1997 Reading: Grover, Proc. IEEE, 1997
Lecture Slides:
Availability and reliability engineering * Posted courtesy of M. Clouqueur, Siemens
AG. |
3 |
| 3 | 26 Jan 2006 | Lecture Slides: Graph theory Reading: Doucette, Ph.D. Thesis, Ch 2, 2004 (Sect. 2.1-2.2) Lecture Slides:
Network routing |
4.1 – 4.10 |
| 4 | 02 Feb 2006 | Lecture Slides: Optimization and linear programming Reading: Doucette, Ph.D. Thesis, Ch 2, 2004 (Sect. 2.3) Reading: Herzberg, Bye, GlobeCom 1994 (hardcopy) Reading: Herzberg, Bye, Utano, Trans Net, 1995 (hardcopy) |
4.11 – 4.14 |
| 5 | 09 Feb 2006 | Lecture Slides: Algorithmic network design methods Reading: Morley, Ph.D. thesis, Ch 11, 2001 (hardcopy) |
4.15 – 4.18 |
| 6 | 16 Feb 2006 | Lecture Slides: Introduction to survivable rings Reading: Morley, Ph.D. thesis, Ch 4, 2001 (hardcopy)
Lecture Slides:
Survivable ring sizing and
loading |
3.4.7 – 3.4.11 |
| - | 23 Feb 2006 | No Lecture - Reading Week | - |
| 7 | 02 Mar 2006 | Lecture Slides: Span restoration Lecture Slides:
Path
restoration |
5 – 6 |
| 8 | 09 Mar 2006 | Midterm Exam | - |
| 9 | 16 Mar 2006 | Lecture Slides: p-Cycles Reading: Grover and Stamatelakis, ICC 1998 Reading: Grover and Stamatelakis, DRCN 2000 Reading: Stamatelakis and Grover, IEEE JSAC, 2000 |
10 |
| 10 | 23 Mar 2006 | Lecture Slides: Forcers and ring-mesh hybrid restoration Supplemental Slides: Ring-to-mesh evolution ("ring mining") In-class discussion: CIDA p-cycle algorithm Reading: Doucette, He, Grover, Yang, DRCN 2003 More in-class discussion: max-latching algorithm Reading: Grover, Rawat, MacGregor, Electronics Letters, 1997 |
11 |
| 11 | 30 Mar 2006 | Lecture Slides: Multi-Ring Network Design (self-study) In-class discussion: course project |
- |
| 12 | 06 April 2006 | Project Presentations | TN7 |
| - | 07 April 2006 | Project Reports Due (12:00 Noon) | - |
Assignments: (LINKS REMOVED)
| # | Assigned Date | Due Date | Solutions |
| Ass't #1 | 12 Jan 2006 | 19 Jan 2006 | Ass't #1 Solution |
| Ass't #2 | 19 Jan 2006 | 26 Jan 2006 | Ass't #2 Solution |
| Ass't #3 | 26 Jan 2006 | 02 Feb 2006 | Ass't #3 Solution |
| Ass't #4 | 02 Feb 2006 | 09 Feb 2006 | Ass't #4 Solution |
| Ass't #5 | 16 Feb 2006 | 02 Mar 2006 | Ass't #5 Solution |
| Ass't #6 | 02 Mar 2006 | 16 Mar 2006 | Ass't #6 Solution |