1. A SLA Framework for QoS Provisioning and Dynamic Capacity Allocation Rahul Garg (IBM India Research Lab), R. S. Randhawa (Stanford University), Huzur Saran (IIT Delhi) and Manpreet Singh (Cornell University)

2. Roadmap Current SLAs and Related Work Drawbacks Proposed SLA Merits Applications Simulation results Conclusion and Future work

3. What is SLA? Service level agreement between customer and service provider. QoS parameters Committed info rate Transit delay Packet loss rate Pricing information

4. Current SLAs Static (peak) Provisioning Flat rate pricing 95-5 model Drawbacks: Need for bandwidth is time-varying Hard to predict Charges based on peak consumption Actual usage is typically much lower Under-utilization of resources Lower revenue for service provider

5. Advanced Schemes in Research Literature Continuous bandwidth auction (Semret et.al. 1999) Usage based pricing (Anantharam et.al. 2000) Drawbacks: Difficult to implement Significant departure from traditional pricing Hard for bandwidth providers to plan Users may not get bandwidth in case of overload

6. Proposed SLA: TTPP Three Tier Pricing with Penalties Revenue Discount Premium

7. Proposed SLA: TTPP Static QoS parameters Reliability Availability Mean Time to Failure Grade of Service Committed info rate Long-term expected capacity Pricing Information: Charging rate r Discount rate d Premium rate p Penalty rate q

8. Service Provider Customer 1 Customer 2 TTPP: An Illustration TTPP SLA

9. Revenue TTPP: An Illustration (Contd.)

12. Discount TTPP: An Illustration (Contd.)

13. Premium Discount TTPP: An Illustration (Contd.)

14. Premium Give me back!!! TTPP: An Illustration (Contd.)

15. Premium Penalty TTPP: An Illustration (Contd.)

16. Choices for Penalty Fixed Penalty Delay Dependent Penalty Proportional Penalty

17. Need for Admission Control

18. Request at Low Premium Admission Control: Illustration

19. Paying low premium Admission Control: Illustration

20. Paying low premium Admission Control: Illustration Request at high premium

21. Paying low premium Admission Control: Illustration Sorry, no resource

22. Paying low premium Admission Control: Illustration I should not have given resource to customer II

23. Admission Control Resize request to increase usage Non-preemptive May lose higher premium in future May have to pay penalties in future Accept or not??? Objective: Maximize the total earnings

24. Trunk Reservation based Scheme What is Trunk Reservation? No, Not This!!!

25. What is Trunk Reservation? Consider Capacity of C units shared by two customers Customer I has higher priority than customer II Trunk reservation of t units against customer II The scheme: Whenever possible, accept requests of type I Accept requests of type II only if more than t units are available.

26. Calculation of Trunk Reservation Used in Telecommunications Even small trunk reservation parameter is effective (Reiman, 1991) Assigns absolute priority to one class over the other Markov Decision Theory can be used Solution space increases Difficult for online implementation

27. Calculating trunk reservation Theoretical analysis to find optimal trunk reservation for the case of revenues only. tr = k log(r 1 /r 2 ) / log(C 1 /C 2 ) Get trunk reservation parameter based on the SLA Heuristic used for the general case Replace r i by priority of the customer Priority(i ) = d i + q i i if usage < prov. Capacity = p i otherwise Constraint: no trunk reserved for a customer with usage above the provisioned capacity

28. Applications of TTPP Application Service Provider (ASP) Dynamic resource(bandwidth/server) allocation Pricing the web hosting service Customer books committed resource in advance, at a negotiated price Sends resize request Perceived need for bandwidth QoS and traffic requirements

29. Applications of TTPP (Contd.) Pay revenue for his booked resources Earn discount for releasing unused resources Pays premium for usage beyond the booked resources Get penalty if provider does not return back your released resources

30. Applications of TTPP (Contd. ) Virtual Private Networks (VPN) Mechanism for traffic engineering for VPN’s Set up MPLS LSP’s with provisioned bandwidth (e.g. using CR-LDP)

31. Simulation Model Discrete Event Simulator Realistic traffic model Actual web traces (Internet Traffic Archive) Fixed data transfer rate of 20Kbps Comparison with Peak Provisioning model Fixed r (= 1), d (= 0.5), p (= 2) Fixed penalty q (= 5)

32. Performance Metric Capacity allocated to customers under TTPP adjusted to give same blocking probability as in peak provisioning Customer payoff Total payment made in Peak Provisioning Total payment made in TTPP SLA Payoff for service provider Total earnings in TTPP SLA per unit installed capacity Total earnings in Peak Provisioning per unit installed capacity

33. Hits per second vs Time

34. Instantaneous Capacity vs Time

35. Simulation Results ASP: Customer payoffs: 1.3 to 5.02 ASP payoff: 1.06 VPN: Customer payoff: 1.07 to 1.88 Network payoff: 1.13

36. FCFS vs Trunk-based scheme User No.Blocking Prob (FCFS) Blocking Prob (Trunk) 10.2520.179 20.2740.098 30.3640.265 40.2570.165 50.3700.468

37. Merits of TTPP Significant statistical multiplexing gains Committed information rate helps the service provider in planning resource allocation Evolutionary in nature Coexist with the current fixed capacity SLA Frequency of resize requests Tradeoff between complexity and degree of dynamic pricing Low overheads of the scheme Idea generalizable to any resource sharing

38. Future Work How to select the parameters of the proposed SLA long-term committed bandwidth Resize frequency Pricing parameters Different forms of penalty Other admission control algorithms

39. ??? || /***/

40. References Aurel Lazar and Nemo Semret. Design and analysis of the progressive second price auction for network bandwidth sharing. Telecommunication Systems: Special issue on Network Economics, 1999. Internet Traffic Archive, http://ita.ee.lbl.gov/html/traces.html Richard La and Venkat Anantharam. Charge sensitive TCP and rate control in the internet. In Proceedings of INFOCOM 2000. Martin I. Reiman. Optimal trunk reservation for a critically loaded link, ITC 1991.