Search

Today, web services rapidly increased and are accessed by many users, leading to massive traffic on the Internet. Hence, the web server suffers from this problem, and it becomes challenging to manage the total traffic with growing users. It will be overloaded and show response time and bottleneck, so this massive traffic must be shared among several servers. Therefore, the load balancing technologies and server clusters are potent methods for dealing with server bottlenecks. Load balancing techniques distribute the load among servers in the cluster so that it balances all web servers. The motivation of this paper is to give an overview of the several load balancing techniques used to enhance the efficiency of web servers in terms of response time, throughput, and resource utilization. Different algorithms are addressed by researchers and get good results like the pending job, and IP hash algorithms achieve better performance.

The purpose of this study is to analyze and then model, using neural network models, the performance of the Web server in order to improve them. In our experiments, the parameters taken into account are the number of instances of clients simultaneously requesting the same Web page that contains the same SQL queries, the number of tables queried by the SQL, the number of records to be displayed on the requested Web pages, and the type of used database server. This work demonstrates the influences of these parameters on the results of Web server performance analyzes. For the MySQL database server, it has been observed that the mean response time of the Web server tends to become increasingly slow as the number of client connection occurrences as well as the number of records to display increases. For the PostgreSQL database server, the mean response time of the Web server does not change much, although there is an increase in the number of clients and/or size of information to be displayed on Web pages. Although it has been observed that the mean response time of the Web server is generally a little faster for the MySQL database server, it has been noted that this mean response time of the Web server is more stable for PostgreSQL database server.

In the industrialized world many companies are using web as a form of promotion or online transactions such as e-commerce. It handles millions of hit visits on the web server. There are many things that can cause the failure hit. One of them is the number of requests or transactions to the web server that is not able to be handled or the slowness of the response, which is very dangerous and detrimental for the company. The single web server with extremely expensive brands is a way to face the constraints overload, but only certain companies are able to have it. The issues faced, how to use some of the PCs as a web server with a reasonable economic value, could be empowered by implementing network load balancing technology. Network load balancing is a technology solution that is used, and expected to be able to handle the simultaneous load of web server with small output failure. Web server performance measurement at the round robin algorithm and least connection include parameters against components such as throughput, request loss, response time and cpu utilization, from the result of the measurement, it will be seen which is the best algorithm to use.

OSI reference model illustrates a layered architecture, at every layer specific actions, functions, and services take place. In this model, layers 5–7 are considered as the upper layers, and they deal with application-level of data, and lower layers 1–4 mostly with moving data around. The networks function on one elementary norm: "pass it on." Each layer is responsible for a particular task and then pushes the data into the subsequent layer. There are many methods frequently used to upsurge server availability or for distributing the load among a group of servers. To improve web server performance, we propose a high performance and secure technique of multilayer Split-protocol (MLSP) for a web application. This work continues improvement of our previous work. In this paper, we demonstrate new contribution as a multilayer splitting concept in an Internet setting and offer performance outcomes that highlight several exciting features of MLSP.

The high level of activity of internet users, which will have a negative impact on information providers. Requests from many users can cause performance capabilities on the web-server to decrease. The large number of requests results in crashes or overloads that have an impact on requests that cannot be served by a single server. Web balancing technology is needed so that the incoming request load is not only served by one server. Some scheduling algorithms that will be applied to web balancing testing in this study are round-robin and weight round-robin. In this study using ipvsadm as a means of making web balancing. This test aims to determine the performance of web servers when using web balancing technology by measuring the QoS parameters of web server services. The results show, the best value for measuring QoS parameters is respons time, request error, throughput, in the weight round-robin scheduling algorithm method.

Popular web sites are expected to handle huge number of requests concurrently within a reasonable time frame. The performance of these web sites is largely dependent on effective thread management of their web servers. Although the implementation of static and dynamic thread policies is common practice, remarkably little is known about the implications on performance. Moreover, the commonly used policies do not take into account the complex interaction between the threads that compete for access to a shared resource. We propose new dynamic thread-assignment policies that minimize the average response time of web servers. The web server is modeled as a two-layered tandem of multi-threading queues, where the active threads compete for access to a common resource. This type of two-layered queueing model, which occurs naturally in the performance modeling of systems with intensive software-hardware interaction, are on the one hand appealing from an application point of view, but on the other hand are challenging from a methodological point of view. Our results show that the optimal dynamic thread-assignment policies yield strong reductions in the response times. Validation on an Apache web server shows that our dynamic thread policies confirm our analytical results. © 2008 Elsevier B.V. All rights reserved.

This paper introduces an adaptive cache proxy to improve the performance of web access in soft real-time applications. It consists of client proxies and cooperative proxy servers with a server-side pushing schema. The large amount of heterogeneous data will be stored in the proxy servers and delivered to clients through computer networks to reduce the response time and network traffic. The adaptive proxy pre-fetches and replaces heterogeneous data dynamically in consideration of networks cost, data size, data change rate, etc. The simulation results show that the modified LUV algorithm has better performance in terms of hit rate, byte hit rate, and delay saving rate. With the cooperative proxy caching, it is shown that the performance of the proxy caching system is more predictable even if the proxies need to deal with a variety of data. The modified adaptive TTL algorithm has better performance in terms of the combination of temporal coherency and system overheads.

This paper describes httperf, a tool for measuring web server performance. It provides a flexible facility for generating various HTTP workloads and for measuring server performance. The focus of httperf is not on implementing one particular benchmark but on providing a robust, high-performance tool that facilitates the construction of both micro- and macro-level benchmarks. The three distinguishing characteristics of httperf are its robustness, which includes the ability to generate and sustain server overload, support for the HTTP/1.1 protocol, and its extensibility to new workload generators and performance measurements. In addition to reporting on the design and implementation of httperf this paper also discusses some of the experiences and insights gained while realizing this tool.

The chapter concerns the issue of overloaded Web server performance evaluation using a simulation-based approach. We focus on a Business-to-Consumer (B2C) environment and consider server performance both from the perspective of computer system efficiency and e-business profitability. Results of simulation experiments for the Web server system under First-In-First-Out (FIFO) scheduling are discussed. Much attention has been paid to the analysis of the impact of a limited server system capacity on business-related performance metrics.

Bu çalışma web sunucu ve uygulamalarını izleme, değerlendirme, sınıflama ve performans analizi tahmini amacıyla yapılmıştır. Bu amaçla kullanılan bazı istemci ve sunucularda işlemci, hafıza kullanım oranı, farklı web uygulama teknolojileri, web sunucusunun hizmet edebileceği maksimum istek sayıları kullanılmıştır. Uygulanan web uygulamasının bahsedilen özelliklerinin değişmesiyle randımanda ve performansta meydana gelen değişiklikler araştırılmış ve bunların değişmesiyle ortaya çıkacak uygulama performansı Bayes Teoremi ile tahmin edilmeye çalışılmıştır. Çalışmada 7 adet farklı özelliklerde web sayfası kullanılarak deneme ve test yapılmıştır., This study has been done for pursuing, scoring, classification of the web server and its practice and for prediction of performance analyzing. Therefore some different web applications used for get statistics from clients, web servers CPU, memory using percent, handled maximum requests per second. When the explained features changed in applicated web server were done the differences in the output and the performance were researched and the application performances after changes were made to predict with Naïve Bayes Teorem. In this study 7 different web pages, applications with different features were used for attempting and testing.

The Quality of Service (QoS) perceived by users is the dominant factor for the success of an Internet-based Web service. Thus, capacity planning has become essential for deploying Web servers. The aim of this study is to understand the key elements in Web server performance. We created a controlled test-bed environment, which allows one to analyze Web server performance in a simple and effective way. In this paper we present an analysis of two different Web server architectures and their performance, with particular focus on discovering bottlenecks.

In this paper we present a new model of Web traffic and its applications in the performance evaluation of Web servers. We consider typical behavior of a user's hypertext navigation within a Web server. We propose a traffic model at the session level, formulated as a stochastic marked point process, which describes when users arrive and how they browse the server. We provide results of statistical analyses and goodness-of-fit of various simple parametric distributions and of their mixtures. We developed a Web server benchmark: WAGON (Web trAffic GeneratOr and beNchmark), and we validated the traffic model by comparing various characteristics of the synthetic traffic generated by WAGON against measurements. We then report benchmark and analysis results on the Apache server, the currently most used Web server software. We analyze the impact of the traffic parameters on the HTTP request arrival process and the packet arrival process. We also show that the aggregate traffic is self-similar in most cases, and that, more importantly, the Hurst parameter is increasing in the traffic intensity. We further provide performance comparison results between HTTP1.0 and HTTP1.1 and show that HTTP1.1 could be much worse for users as well as for servers if some control parameters of the server and of browsers are incorrectly set. Indeed, when the server load is relatively high, the page response time under HTTP1.1 increases exponentially fast with the number of parallel persistent connections and with the timeout value used in Apache for persistent connections. We investigate the impact of user network conditions on the server performance. We also propose a queueing model to analyze the workload of persistent connections on the Apache server, and we establish optimal solution of the timeout parameter for the minimization of workload. Based on our analyses, we suggest the following practical guidelines. It is usually beneficial for both Web servers and Web clients to use HTTP1.1 instead of HTTP1.0. When HTTP1.1 is used, it should be used with pipeline. In terms of the management of persistent connections, it is useful for browsers to implement Early Close policy which combines the advantages of both HTTP1.0 and HTTP1.1. Browsers should in general, except for users with low bandwidth network connections (such as Modem), avoid establishing multiple parallel persistent connections from one browser window to the same Web server. On the server side, servers should set small timeout values for persistent connections if fixed timeout control mechanism is used (as in Apache) or if dynamic timeout control mechanism is used and the measured workload is high.