lecture08: Convex Optimization (and intra-domain routing)

The lecture considers non-linear, convex, objective functions for the routing problem.

Topics covered

• Recap link-state routing
• Link loads
• Example cost calculation
• Example loads on links
• Alternative cost calculation
• Link loads
• Non-linear cost functions
• Differentiable functions
• Linear cost example
• Convex sets
• Convex functions
• Convex differentiable functions
• Example
• Simple queueing model
• Minima
• Feasible routing changes
• Separable cost functions
• Shortest path with non-linear costs
• Shortest path with convex costs
• Descent Methods
• Descent Methods: notes
• Descent Methods
• Calculating the new cost
• Descent Method 1
• Descent Method 1: example
• Descent Method 2
• Methods: Dynamic feedback
• Greedy vs Hill Climbing
• Now a'days
• Planning horizons
• Traffic Engineering