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.

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.

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.