A method for transparent admission control and request scheduling in e-commerce web sites

Elnikety, Sameh; Nahum, Erich; Tracey, John; Zwaenepoel, Willy

doi:10.1145/988672.988710

Cited by 217 publications

(179 citation statements)

References 30 publications

Supporting

Mentioning

168

Contrasting

Unclassified

Order By: Relevance

“…Several studies investigated the effects of request scheduling and prioritization on web server performance, for general database-driven dynamic web sites (Elnikety et al, 2004), and for eCommerce web sites in particular (Schroeder et al, 2006;Alonso et al, 2007;Zhou et al, 2006). It was shown that request response times and server throughput can be improved by employing such scheduling algorithms as Shortest Job First (SJF) (Elnikety et al, 2004) and Shortest Remaining Processing Time First (Verma and Ghosal, 2003).…”

Section: Related Work and Discussionmentioning

confidence: 99%

“…It was shown that request response times and server throughput can be improved by employing such scheduling algorithms as Shortest Job First (SJF) (Elnikety et al, 2004) and Shortest Remaining Processing Time First (Verma and Ghosal, 2003). Some of these studies used request scheduling algorithms combined with admission control policies (Chen et al, 2001;Elnikety et al, 2004).…”

Section: Related Work and Discussionmentioning

confidence: 99%

“…A dominant fraction of these models (Menascé et al, 1999;Carlstrom and Rom, 2002;Singhmar et al, 2004;Elnikety et al, 2004;Chen and Mohapatra, 2002), as well as workload generators of web server performance benchmarks, such as TPC-W (TPC-W, 2005), use first or higher-order Markov chains to model session structure.…”

Section: Web Workload Modelmentioning

confidence: 99%

“…Processing times for individual requests in typical e-Commerce services, including our TPC-W application, can vary widely by as much as two-to-three orders of magnitude. However, there tends to be much more variation across request types than for requests within the same type but with different request parameters (Chen et al, 2001;Elnikety et al, 2004). Information about the relative execution costs permits the RDRP Bayesian inference algorithm to be able to make adequate predictions of future server resource consumption by a session.…”

Section: Session Reward and Request Cost Specificationmentioning

confidence: 99%

See 3 more Smart Citations

RDRP: Reward-Driven Request Prioritization for e-Commerce web sites

Totok

Karamcheti

2010

Electronic Commerce Research and Applications

View full text Add to dashboard Cite

Meeting client Quality-of-Service (QoS) expectations proves to be a difficult task for the providers of e-Commerce services, especially when web servers experience overload conditions, which cause increased response times and request rejections, leading to user frustration, lowered usage of the service and reduced revenues. In this paper, we propose a server-side request scheduling mechanism that addresses these problems. Our Reward-Driven Request Prioritization (RDRP) algorithm gives higher execution priority to client web sessions that are likely to bring more service profit (or any other application-specific reward). The method works by predicting future session structure by comparing its requests seen so far with aggregated information about recent client behavior, and using these predictions to preferentially allocate web server resources. Our experiments using the TPC-W benchmark application with an implementation of the RDRP techniques in the JBoss web application server show that RDRP can significantly boost profit attained by the service, while providing better QoS to clients that bring more profit.

show abstract

Section: Related Work and Discussionmentioning

confidence: 99%

Section: Related Work and Discussionmentioning

confidence: 99%

Section: Web Workload Modelmentioning

confidence: 99%

Section: Session Reward and Request Cost Specificationmentioning

confidence: 99%

See 2 more Smart Citations

RDRP: Reward-Driven Request Prioritization for e-Commerce web sites

Totok

Karamcheti

2010

Electronic Commerce Research and Applications

View full text Add to dashboard Cite

show abstract

“…Admission control is already widely used in telecommunications. Research has also been performed on the use of admission control for Web Servers; see for instance [1]- [3], [7]. The use of WAC to prevent overload for stand alone Web Services has been discussed in [4]- [5].…”

Section: Introductionmentioning

confidence: 99%

Intelligent Overload Control for Composite Web Services

Meulenhoff¹,

Ostendorf²,

Živković³

et al. 2009

Service-Oriented Computing – ICSOC 2007

View full text Add to dashboard Cite

Abstract.In this paper, we analyze overload control for composite web services in service oriented architectures by an orchestrating broker, and propose two practical access control rules which effectively mitigate the effects of severe overloads at some web services in the composite service. These two rules aim to keep overall web service performance (in terms of end-to-end response time) and availability at agreed quality of service levels. We present the theoretical background and design of these access control rules as well as performance evaluation results obtained by both simulation and experiments. We show that our access control rules significantly improve performance and availability of composite web services.

show abstract

Discovery of Water‐Soluble Antioxidant Flavonols without Vasorelaxant Activity

Yap¹,

Loft²,

Woodman³

et al. 2008

ChemMedChem

View full text Add to dashboard Cite

3',4'-Dihydroxyflavonol (DiOHF) is a cardioprotective flavonol that can decrease ischaemia/reperfusion injury in the heart. DiOHF exhibits antioxidant and vasorelaxant properties that are thought to underlie its cardioprotective activity. A major limitation to its use for the treatment or prevention of cardiovascular disease is its poor water solubility, preventing intravenous administration at the required dosage. In this study, three novel flavonols were synthesised that bear an ionisable succinamic acid substituent at the 6-position of the A ring with zero, one, or two hydroxy groups on the B ring. The ionised compounds possess improved aqueous solubility, dissolving at concentrations up to 10(-1) m, whereas DiOHF is insoluble in water (<10(-7) m). Pharmacological analysis revealed that the DiOHF-6-succinamic acid derivative was the best antioxidant, possessing activity similar to DiOHF, whereas vasorelaxant activity was attenuated. This compound was able to effectively scavenge superoxide from the autoxidation of pyrogallol, preventing oxidant-induced endothelial dysfunction. DiOHF-6-succinamic acid represents the first antioxidant flavonol that lacks vasorelaxant activity and in the future will enable studies to cast light on the specific biological activity required for cardioprotection.

show abstract

A method for transparent admission control and request scheduling in e-commerce web sites

Cited by 217 publications

References 30 publications

RDRP: Reward-Driven Request Prioritization for e-Commerce web sites

RDRP: Reward-Driven Request Prioritization for e-Commerce web sites

Intelligent Overload Control for Composite Web Services

Discovery of Water‐Soluble Antioxidant Flavonols without Vasorelaxant Activity

Contact Info

Product

Resources

About