1 / 28

Optimization-based approach to congestion control

Optimization-based approach to congestion control. Resource allocation as optimization problem: how to allocate resources (e.g., bandwidth) to optimize some objective function may not possible that optimality exactly obtained but…

vin
Download Presentation

Optimization-based approach to congestion control

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Optimization-based approach to congestion control Resource allocation as optimization problem: • how to allocate resources (e.g., bandwidth) to optimize some objective function • may not possible that optimality exactly obtained but… • optimization framework as means to explicitly steer network towards desirable operating point • practical congestion control as distributed asynchronous implementations of optimization algorithm • systematic approach towards protocol design

  2. User 1 cA cB User 0 Us(xs) User 2 xs Model • network: links {l}, capacities {cl} • sources S:(L(s), Us(xs)), sS • L(s) - links used by source s • Us(xs) – utility, strictly concave function of source rate xs

  3. Kelly’s System Problem subject to

  4. Optimization Problem • maximize system utility (note: all sources “equal) • constraint: bandwidth used less than capacity • centralized solution to optimization impractical • must know all utility functions • impractical for large number of sources • we’ll see: congestion control as distributed asynchronous algorithms to solve this problem “system” problem

  5. Issues • will users truthfully reveal their utility functions? • if not, can we design a pricing scheme (mechanism) to induce truth-telling? • is there a distributed algorithm to compute the prices? • what are good choices for utilities?

  6. Max-min Fairness rates {xr} max-min fair if for any other feasible rates {yr}, if ys > xs, then  p, such that xp xs and yp < xp

  7. Proportional fairness • rates {xr} are proportionally fair if for any feasible {yr}, • corresponds to Ur (xr) = log xr • weighted proportional fairness if Ur (xr) = wr log xr

  8. Minimum potential delay fairness • rates {xr} are minimum potential delay fair if Ur (xr) = -wr/xr Interpretation: if wr is file size, then wr/xr is transfer time; optimization problem is to minimize sum of transfer delays

  9. Max-min Fairness rates {xr} max-min fair if for any other feasible rates {yr}, if ys > xs, then  p, such that xp xs and yp < xp What is corresponding utility function?

  10. Solve optimization problem: remove constraints • consider following problem • gl(y) – penalty function • gl (y) non decreasing, continuous and gl (y) ∞ as y ∞ • fl (y) = dgl (y)/dy

  11. max V(x)

  12. pl (t) price of link l at time t pl (t) = fl(yl(t)) U’r(xr) – qr = 0, rS

  13. Source Algorithm • source needs only its path price: • kr() nonnegative nondecreasing function • above algorithm converges to unique solution for any initial condition • example: qr – loss/marking probability

  14. Proportionally-Fair Controller • If utility function is then a controller that implements it is given by

  15. Proportionally-Fair Controller If utility function is then a controller that implements it is given by

  16. TCP-Reno • condition for optimality is or if we have an expression for xi, we can use to obtain Ui

  17. Simplified TCP-Reno • suppose • then, • interpretation: minimize (weighted) delay

  18. Solve optimization problem (method 2)

  19. Solve optimization problem (method 2) : duality

  20. Solve optimization problem (method 3): primal-dual algorithm

  21. Another angle: Pricing • can network choose pricing scheme to achieve fair resource allocation? • suppose network charges price qr ($/bit) where qr=pl • user’s strategy: spend wr ($/sec.) to maximize

  22. Pricing: Optimal User Strategy • equivalently,

  23. Pricing: Distributed Computation • with optimal choice of wr, controller becomes • we have already seen that this solves

  24. Price Takers vs. Strategic Users • Kelly Mechanism: users are price takers, i.e., user does not know the impact of its action on the price • strategic users:

  25. Price Takers vs. Strategic Users: Efficiency and Competition • price takers: selfish users can maximize social welfare • strategic users: competition leads to loss of efficiency, i.e., social welfare is not maximized

  26. Multicast • single rate • sender determines rate • U(x) = |R|V(x) preferred • multirate • each rcvr determines rate • each rcvr has own utility function

  27. Other issues • joint congestion control and routing • high performance environments

  28. Optimization-based congestion control: summary • bandwidth allocation as optimization problem: • practical congestion control (TCP) as distributed asynchronous implementations of optimization algorithm • optimization framework as means to explicitly steer network towards desirable operating point • systematic approach towards protocol design

More Related