1 / 50

Performance Study of Congestion Price Based Adaptive Service

Performance Study of Congestion Price Based Adaptive Service. Xin Wang, Henning Schulzrinne ( Columbia university ). Outline. Resource negotiation & RNAP Pricing strategy User adaptation Simulation model Results and discussion. Resource Negotiation & RNAP.

faunus
Download Presentation

Performance Study of Congestion Price Based Adaptive Service

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. Performance Study of Congestion Price Based Adaptive Service Xin Wang, Henning Schulzrinne (Columbia university)

  2. Outline • Resource negotiation & RNAP • Pricing strategy • User adaptation • Simulation model • Results and discussion

  3. Resource Negotiation & RNAP • Assumption: network provides a choice of delivery services to user • e.g. diff-serv, int-serv, best-effort, with different levels of QoS • with a pricing structure (may be usage-sensitive) for each. • RNAP: a protocol through which the user and network (or two network domains) negotiate network delivery services. • Network -> User: communicate availability of services; price quotations and accumulated charges • User -> Network: request/re-negotiate specific services for user flows. • Underlying Mechanism: combine network pricing with traffic engineering

  4. Resource Negotiation & RNAP (cont’d.) • Who can use RNAP? • Adaptive applications: adapt sending rate, choice of network services • Non-adaptive applications: take fixed price, or absorb price change

  5. Centralized Architecture (RNAP-C) NRN NRN NRN HRN HRN S1 R1 Access Domain - A Access Domain - B Transit Domain Internal Router NRN Network Resource Negotiator Edge Router Host Resource Negotiator Data HRN Host Intra domain messages RNAP Messages

  6. Distributed Architecture (RNAP-D) HRN HRN S1 R1 Access Domain - A Access Domain - B Transit Domain Internal Router HRN Host Resource Negotiator Edge Router RNAP Messages Host Data

  7. Resource Negotiation & RNAP (cont’d.) Query: User enquires about available services, prices Query Quotation Quotation: Network specifies services supported, prices Reserve Reserve: User requests service(s) for flow(s) (Flow Id-Service-Price triplets) Commit Quotation Commit: Network admits the service request at a specific price or denies it (Flow Id-Service-Status-Price) Reserve Periodic re-negotiation Commit Close: tears down negotiation session Close Release: release the resources Release

  8. Pricing Strategy • Current Internet: • Access rate dependent charge (AC) • Volume dependent charge (V) • AC + V AC-V • Usage based charging: time-based, volume-based • Fixed pricing • Service class independent flat pricing • Service class sensitive priority pricing • Time dependent time of day pricing • Time-dependent service class sensitive priority pricing

  9. Pricing Strategy (cont’d.) • Congestion-based Pricing • Usage charge: pu= f (service, demand, destination, time_of_day, ...) cu(n) = pu x V (n) • Holding charge: Phi = i x (pui - pui-1) ch (n) = ph x R(n) x  • Congestioncharge: pc (n) = min [{pc (n-1) + (D, S) x (D-S)/S,0 }+, pmax] cc(n) = pc(n) x V(n)

  10. User Adaptation • Based on perceived value • Application adaptation • Maximize total utility over the total cost • Constraint: budget, min QoS & max QoS

  11. User Adaptation (cont’d.) • An example utility function • U (x) = U0 + log (x / xm) • Optimal user demand • Without budget constraint: xj= j / pj • With budget constraint: xj= (b x j / Σll) / pj • Affordableresource is distributed proportionally among applications of the system, based on the user’s preference and budget for each application.

  12. Simulation Model

  13. Simulation Model

  14. Simulation Model (cont’d.) • Parameters Set-up • topology1: 48 users • topology 2: 360 users • user requests: 60 kb/s -- 160 kb/s • targeted reservation rate: 90% • price adjustment factor: σ = 0.06 • price update threshold: θ = 0.05 • negotiation period: 30 seconds • usage price: pu = 0.23 cents/kb/min

  15. Simulation Model (cont’d.) • Performance measures • Bottleneck bandwidth utilization • User request blocking probability • Average and total user benefit • Network revenue • System price • User charge

  16. Design of the Experiments • Performance comparison of congestion-based pricing system (CPA) with a fixed-price based system (FP) • Effect of system control parameters: • target reservation rate • price adjustment step • price adjustment threshold • Effect of user demand elasticity • Effect of session multiplexing • Effect when part of users adapt • Session adaptation and adaptive reservation

  17. Performance Comparison of CPA and FP

  18. Bottleneck Utilization Request blocking probability

  19. Request blocking probability

  20. Total network revenue ($/min)

  21. Total user benefit ($/min)

  22. Price ($/kb/min)

  23. User bandwidth (kb/s)

  24. Average price ($/kb/min)

  25. Average user bandwidth (kb/s)

  26. Average user charge ($/min)

  27. Effect of target reservation rate

  28. Bottleneck utilization

  29. Request blocking probability

  30. Total user benefit

  31. Effect of Price Adjustment Step

  32. Bottleneck utilization

  33. Request blocking probability

  34. Effect of Price Adjustment Threshold

  35. Request blocking probability

  36. Effect of User Demand Elasticity

  37. Average user bandwidth

  38. Average user charge

  39. Effect of Session Multiplexing

  40. Request blocking probability

  41. Total user benefit

  42. Adaptation by Part of User Population

  43. Bandwidth utilization

  44. Request blocking probability

  45. Session Adaptation & Adaptive Reservation

  46. Bandwidth utilization

  47. Blocking probability

  48. Conclusions • CPA gain over FP • Network availability, revenue, perceived benefit • Congestion price as control is stable and effective • Target reservation rate (utilization): • User benefit , with too high or too low utilization • Too low target rate, demand fluctuation is high • Too high target rate, high blocking rate

  49. Conclusions • Effect of price scaling factor  •  , blocking rate • Too large , under-utilization, large dynamics • Effect of price adjustment threshold  • Too high, no meaningful adaptation • Too low, no big advantage

  50. Conclusions • Demand elasticity • Bandwidth sharing is proportional to its willingness to pay • Portion of user adaptation results in overall system performance improvement

More Related