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

Totok, Alexander; Karamcheti, Vijay

doi:10.1016/j.elerap.2010.03.001

Cited by 17 publications

(19 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our JBoss/Jetty web application server is augmented with the request profiling infrastructure [7,18], implemented in a modular fashion as several pluggable middleware services, with some additional modifications made to the original code of JBoss/Jetty web application server and MySQL JDBC driver. The Jetty HTTP/web server is used to gather information about incoming client requests, which are classified by their type (based on the URL pattern) and session affiliation.…”

Section: Methodsmentioning

confidence: 99%

“…Some of these resources can be shared among concurrent user requests, whereas some are held exclusively by a request for the duration of its execution (or some significant part of it). Therefore, such non-shared server resources become bottleneck points, and the failure to obtain such a resource constitutes a major portion of request rejections under high load or overload conditions [7]. This paper focuses on optimizing utilization of web application server resources that are held exclusively by a service request.…”

Section: Motivationmentioning

confidence: 99%

See 1 more Smart Citation

Optimizing utilization of resource pools in web application servers

Totok

Karamcheti

2010

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

SUMMARYAmong the web application server resources, the most critical for their performance are those that are held exclusively by a service request for the duration of its execution (or some significant part of it). Such exclusively held server resources become performance bottleneck points, with failures to obtain such a resource constituting a major portion of request rejections under server overload conditions. In this paper, we propose a methodology that computes the optimal pool sizes for two such critical resources: web server threads and database connections. Our methodology uses information about incoming request flow and about fine-grained server resource utilization by service requests of different types, obtained through offline and online request profiling. In our methodology, we advocate (and show its benefits) the use of a database connection pooling mechanism that caches database connections for the duration of a service request execution (so-called request-wide database connection caching). We evaluate our methodology by testing it on the TPC-W web application. Our method is able to accurately compute the optimal number of server threads and database connections, and the value of sustainable request throughput computed by the method always lies within a 5% margin of the actual value determined experimentally. Copyright

show abstract

Section: Methodsmentioning

confidence: 99%

Section: Motivationmentioning

confidence: 99%

Optimizing utilization of resource pools in web application servers

Totok

Karamcheti

2010

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

show abstract

“…Additionally, our experiments show that the history-based approach matches the performance of our RDRP mechanisms on the amount of reward attained and response times only if the correlation between the clients' past and future behavior is, respectively, 75% or greater and 50% or greater. Further details on the RDRP techniques, implemented middleware infrastructure, and the performance results can be found in another publication [Totok and Karamcheti 2010b].…”

Section: Problem 1: Maximizing Reward Brought By Internet Servicesmentioning

confidence: 99%

Exploiting Service Usage Information for Optimizing Server Resource Management

Totok

Karamcheti

2011

ACM Trans. Internet Technol.

Self Cite

View full text Add to dashboard Cite

It is often difficult to tune the performance of modern component-based Internet services because: (1) component middleware are complex software systems that expose several independently tuned server resource management mechanisms; (2) session-oriented client behavior with complex data access patterns makes it hard to predict what impact tuning these mechanisms has on application behavior; and (3) component-based Internet services themselves exhibit complex structural organization with requests of different types having widely ranging execution complexity. In this article we show that exposing and using detailed information about how clients use Internet services enables mechanisms that achieve two interconnected goals: (1) providing improved QoS to the service clients, and (2) optimizing server resource utilization. To differentiate among levels of service usage (service access) information, we introduce the notion of the service access attribute and identify four related groups of service access attributes, encompassing different aspects of service usage information, ranging from the high-level structure of client web sessions to low-level fine-grained information about utilization of server resources by different requests. To show how the identified service usage information can be collected, we implement a request profiling infrastructure in the JBoss Java application server. In the context of four representative service management problems, we show how collected service usage information is used to improve service performance, optimize server resource utilization, or to achieve other problem-specific service management goals.

show abstract

“…A number of approaches for overload protection in E-Commerce Web sites have been proposed and developed by researchers. Many of them require extensive changes to the server or operating system [9] and lack integration of concurrency and replication models in the architecture.…”

Section: Summary Of Findingsmentioning

confidence: 99%

“…Select those records where the membership values are above a threshold value [9]. Forward the scheduled request to the server being utilized less (obtain utilization factor from the monitor).…”

Section: Computation Of Expected Reward and Prioritymentioning

confidence: 99%

Admission Control and Request Scheduling for Secured-concurrent-available Architecture

Harini¹,

Padmanabhan²

2013

IJCA

View full text Add to dashboard Cite

The Internet society is continuously growing and the need of performance studies in this field is essential in order to obtain better throughput for the Web users. Moreover, Internet applications and clients have varied service expectations and demand provisioning of different levels of QoS to multiple traffic classes on the Internet. Meeting client QoS expectations prove to be a difficult task for E-Commerce service providers, especially when web servers experience overload conditions that cause increased response time, request rejections, user frustration, lowered usage of the service and reduced revenues. A recently proposed MLF (Multi Layered Filtering) framework manages potential workload; it also guaranties data freshness for all transactions that complete within their deadlines without service differentiation using request filtering and admission control schemes. In this paper, an improved request classifier and class-based admission control scheme called Multi-phase Admission Control (MPAC) that can be integrated with the MLF framework to prioritize user requests into several service classes according to their importance, and offer differentiated quality of service in terms of minimizing the frustration of premium users is presented and evaluated. The performance evaluations carried out confirm that the scheme can significantly boost the reward for having serviced a request while providing better QoS to clients.

show abstract

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

Cited by 17 publications

References 26 publications

Optimizing utilization of resource pools in web application servers

Optimizing utilization of resource pools in web application servers

Exploiting Service Usage Information for Optimizing Server Resource Management

Admission Control and Request Scheduling for Secured-concurrent-available Architecture

Contact Info

Product

Resources

About