Lecture21

# Lecture21 - Lecture 21 Optimal Routing Eytan Modiano Eytan...

This preview shows pages 1–5. Sign up to view the full content.

Lecture 21 Optimal Routing Eytan Modiano Eytan Modiano Slide 1

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Optimal Routing View routing as a “global” optimization problem Assumptions: The cost of using a link is a function of the flow on that link The total network cost is the sum of the link costs The required traffic rate between each source-destination pair is known in advance Traffic between source-destination pair can be split along multiple paths with infinite precision Find the paths (and associated traffic flows) along which to route all of the traffic such that the total cost is minimized Eytan Modiano Slide 2
Formulation of optimal routing Let Dij (fij) be the cost function for using link (i,j) with flow fij Fij is the total traffic flow along link (i,j) Dij() can represent delay or queue size along the link Assume Dij is a differentiable function Let D(F) be the total cost for the network with flow vector F Assume additive cost: D(F) = Sum (ij) Dij (fij) For S-D pair w with total rate r w P w is the set of paths between S and D X p is the rate sent along path p P w S . t . X p = r w , w W fij = X p p P w all pcontaining ( i , j ) Eytan Modiano Slide 3

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Formulation continued Optimal routing problem can now be written as: Min D ( F ) S . t . X
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 11/07/2011 for the course AERO 16.26 taught by Professor Dimitribertsekas during the Fall '02 term at MIT.

### Page1 / 14

Lecture21 - Lecture 21 Optimal Routing Eytan Modiano Eytan...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online