Communications Network Design

Home

News

Lecture Notes

Lecture 01						Introduction and brief history of telecoms
Lecture 02						Brief Computer Network History
Lecture 03						Internet Design Principles
Lecture 04						Network Optimization: Goals and Constraints
Lecture 05						Optimization Introduction
Lecture 06						Routing: Intra-Domain (as a kind of optimization, Dijkstra)
Lecture 07						Intra-Domain Routing (Floyd-Warshall, and implementation)
Lecture 08						Convex Optimization (and intra-domain routing)
Lecture 09						The Network Design Problem intro
Lecture 10						concave costs and related issues
Lecture 11						multicommodity flow problems and Minoux's greedy method
Lecture 12						budget constraint model and branch and bound
Lecture 13						branch and bound (cont)
Lecture 14						Randomized algorithms: simulated annealing
Lecture 15						Randomized algorithms: genetic algorithms
Lecture 16						tree-like networks
Lecture 17						Advanced tree-like network design
Lecture 18						Internet Implementation an Tree-like networks
Lecture 19						Inter-Domain Routing (policies)
Lecture 20						BGP
Lecture 21						Input data
Lecture 22						Network Design without complete information
Lecture 23						Revision

Matthew Roughan

Last modified: Thu Oct 27 11:32:47 2011