Web Service Hosting and Revenue Maximization

Mazzucco,; Mitrani,; Palmer,; Fisher,; McKee, Marc D.

doi:10.1109/ecows.2007.8

Cited by 13 publications

(29 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hence, a composite service provider is increasing his own gross by decreasing provider"s total costs. Mazzucco et al [25] describe a framework for gross increasing in web services hosting using dynamic admission methods. Likely, techniques to optimize application servers in a distribute environment have been proposed in [26].…”

Section: Related Workmentioning

confidence: 99%

Efficient Techniques for Service Oriented Application

Anoop¹

2014

IOSRJCE

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 99%

Efficient Techniques for Service Oriented Application

Anoop¹

2014

IOSRJCE

View full text Add to dashboard Cite

“…Similar models have been investigated in many related areas before. For instance, [38] describes a model for revenue maximizing in Web services hosting using dynamic admission policies. Similarly, techniques to optimize application servers in a way to maximize the provider profit in distributed systems have been proposed in [39].…”

Section: Related Workmentioning

confidence: 99%

Cost-Based Optimization of Service Compositions

Leitner

Hummer

Dustdar

2013

IEEE Trans. Serv. Comput.

View full text Add to dashboard Cite

For providers of composite services preventing cases of SLA violations is crucial. Previous work has established runtime adaptation of compositions as a promising tool to achieve SLA conformance. However, in order to get a realistic and complete view of the decision process of service providers, the costs of adaptation need to be taken into account. In this paper we formalize the problem of finding the optimal set of adaptations, which minimizes the total costs arising from SLA violations and the adaptations to prevent them. We present possible algorithms to solve this complex optimization problem, and detail an end-to-end system based on our earlier work on the PREvent (prediction and prevention based on event monitoring) framework, which clearly indicates the usefulness of our model. We discuss experimental results that show how the application of our approach leads to reduced costs for the service provider, and explain the circumstances in which different algorithms lead to more or less satisfactory results. Abstract-For providers of composite services preventing cases of SLA violations is crucial. Previous work has established runtime adaptation of compositions as a promising tool to achieve SLA conformance. However, in order to get a realistic and complete view of the decision process of service providers, the costs of adaptation need to be taken into account. In this paper we formalize the problem of finding the optimal set of adaptations, which minimizes the total costs arising from SLA violations and the adaptations to prevent them. We present possible algorithms to solve this complex optimization problem, and detail an end-to-end system based on our earlier work on the PREvent (prediction and prevention based on event monitoring) framework, which clearly indicates the usefulness of our model. We discuss experimental results that show how the application of our approach leads to reduced costs for the service provider, and explain the circumstances in which different algorithms lead to more or less satisfactory results.

show abstract

“…Revenue-based systems are also becoming increasingly important in software systems, spanning from middlewares for web-service composition to software-as-a-service applications which differentiate performance across customers depending on their subscription model [20,26,42].…”

Section: Related Workmentioning

confidence: 99%

“…Continuity (in p) of X r (kN, p) is obvious. Continuity of X * r (p) follows by the theorem of the Maximum [12, Chapter 6] applied to the characterization (26). The pointwise convergence of r c r X r (kN, p) is shown in Proposition 2.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Heavy-traffic revenue maximization in parallel multiclass queues

Anselmi

Casale

2013

Performance Evaluation

View full text Add to dashboard Cite

Motivated by revenue maximization in server farms with admission control, we investigate optimal scheduling in parallel processor-sharing queues. Incoming customers are distinguished in multiple classes and we define revenue as a weighted sum of class throughputs. Under these assumptions, we describe a heavy-traffic limit for the revenue maximization problem and study the asymptotic properties of the optimization model as the number of clients increases. Our main result is a simple heuristic that is able to provide tight guarantees on the optimality gap of its solutions. In the general case with M queues and R classes, we prove that our heuristic is (1 + 1 M −1 )-competitive in heavy-traffic. Experimental results indicate that the proposed heuristic is remarkably accurate, despite its negligible computational costs, both in random instances and using service rates of a web application measured on multiple cloud deployments. 1

show abstract

Web Service Hosting and Revenue Maximization

Cited by 13 publications

References 9 publications

Efficient Techniques for Service Oriented Application

Efficient Techniques for Service Oriented Application

Cost-Based Optimization of Service Compositions

Heavy-traffic revenue maximization in parallel multiclass queues

Contact Info

Product

Resources

About