Distributed Web Server System Research Articles

Performance Analysis of an E-commerce Website Using Distributed Servers (Case Study: Ecommerce Bumdes Sarining Kukuh Winangun)

Digital transformation has significantly altered our interactions by leveraging the internet for fast global information exchange and collaboration. This shift impacts businesses, individuals, organizations, and governments by increasing the demand for fast, reliable web services. To meet these demands, many organizations are turning to distributed server infrastructures, which help handle large storage needs and avoid performance issues. This research focuses on creating a distributed web server system that uses Round-Robin load balancing to evenly distribute traffic and enhance performance. The Round-Robin algorithm’s simplicity and effectiveness in balancing loads, combined with the advantages of virtualization, such as cost efficiency, improved performance, and better resource management are central to this approach. Virtualization also offers improved scalability, accuracy, and security, further enhancing overall system efficiency and effectiveness in data centers. This research evaluates and contrasts the performance of websites utilizing distributed servers against those using single servers. The findings indicate that websites with distributed servers significantly outperform those with single servers. Specifically, distributed servers offer response times that are 5.8 times faster, achieve 2.2 times more successful responses, and transfer 2.1 times more data than single servers. Additionally, single servers experience a much higher rate of timeouts, with 14.2 times more occurrences compared to distributed servers.

Algoritme penggantian cache proxy terdistribusi untuk meningkatkan kinerja server web

The performance of web processing needs to increase to meet the growth of internet usage, one of which is by using cache on the web proxy server. This study examines the implementation of the proxy cache replacement algorithm to increase cache hits in the proxy server. The study was conducted by creating a clustered or distributed web server system using eight web server nodes. The system was able to provide increased latency by 90 % better and increased throughput of 5.33 times better.

Performance of Hybrid Load Balancing Algorithm in Distributed Web Server System

The challenges that load balancing (LB) faces are that there may not always be enough physical servers to be able to handle the demand requested at any one time. If a huge influx of players comes online at the same time, there may just not be enough room for them all. In this case, the server would usually initiate a queue system where players are held before they are allowed to attempt to connect to the world server. If too many requests are made however, the load balancer itself may stop working and deny players access completely. These challenges are specific to the Client/Server model of game content distribution. The proposed hybrid Grid model has a slightly different set of challenges. The load balancer in this model has to constantly check the network for player disconnections so that any outstanding events can be cleaned up by the dedicated hosts. It also has to balance load like normal to these hosts as they will appear as one entity on the network but can be scaled to as many machines as are needed. The popularity of decentralization over recent years has led to issues with the demand on server hardware and the need for LB which generates increased costs for companies and affects the quality of service. The aim of this work was to design and construct a Hybrid load balancing solution for Grid and compare it to the other load balancing algorithms. Grid with a load balancer was written in Java using a modular construction which allowed code reuse between different network models. Four common algorithms, one of which was redeveloped to improve its performance, were compared to determine load balancing efficiency for selecting servers from a pool.

DNS Based Approach Load Balancing In Distributed Web Server System

In this paper, we consider the high level scheduling and load sharing properties offered by the Domain Name System, as implemented in popular DNS software packages. We explore the performance and capabilities of high-level DNS-based load balancing, where we draw special attention to the choice of caching policy (time-to-live) for DNS data. Further, we analyze the use of a database-supported DNS service for allowing highly dynamical query responses, and show that this approach has both potentially negative (single point of failure) and positive (improved balancing flexibility) properties. The objective of this paper is we discuss the performance requirements of the DNS, and argue that the robustness and performance of the DNS could be improved and also discuss the impact of TTL on response time in DNS

An Data Replication and Deletion Algorithm for Web Objects

The phenomenal growth of the object has brought huge increase in the traffic on World Wide Web. Long read latency of service experienced by the end-users, especially during the peak hours, continues to be the common problem to the popular web servers while retrieving popular objects. A replication and deletion algorithm is presented to solve object replication problem, which is a NP-hard problem and can be formulated as a 0-1 constraint optimization problem. The algorithm defines an appropriate replica distribution with the objective to decrease the number of object access operations over excessive distances, balance the load of popular web servers, and then minimize the network traffic of the object. Object deletion in a distributed web-server environment is one of the possible solutions to extend available memory and reduce the load of the server. During the adaptive time period due to different object update frequency, objects are dynamically duplicated and deleted in a distributed web server system with limited storage capacity. Simulation results demonstrate the performance of the proposed algorithm.

An Analytical Model of Web Server Load Distribution by Applying a Minimum Entropy Strategy

 Abstract—This paper presents an analytical model and the way of simulation for distributing workload on a distributed web server system. The increase in the Internet traffic has also necessitated the conventional Domain Naming Service (DNS) to operate at a much lower efficiency. Among a number of problems associated with the DNS, a key problem has to do with the authoritative DNS not being able to process complete knowledge of the proximity. This makes the authoritative DNS less effective in monitoring server availability and routing incoming requests around failed servers. The workload distribution strategy on the other hand, keeps track of the state and health of the web server. This avoids connection delay due to, for example, a failed server, which can be temporarily by passed by workload distribution. From a modeling standpoint, the conventional DNS assumes equal queue size for each web server in a round-robin setting. Under load balancing, the queue size for each web server differs based on the probability of accessing that server. This probability is based on such factors as the geography, server health, server response, server threshold, session capacities, and the round trip time. In this paper, both conventional and global workload distribution strategies are developed and compared based on a finite set of practical traffic scenarios.

Performance Study of a Distributed Web Server: An Analytical Approach

With the rapid expansion of the Internet, Web servers have played a major role in accessing the enormous mass of Web pages to find the information needed by the user. Despite the exponential growth of the WWW, a very negligible amount of research has been conducted in Web server performance analysis with a view to improve the time a Web server takes to connect, receive, and analyze a request sent by the client and then sending the answer back to client. In this paper, we propose a multi-layer analytical approach to study the web server performance. A simple client-server model is used to represent the WWW server in order to demonstrate how to apply the proposed approach. We developed a systematic, analytical methodology to quantify the communication delay and queuing overhead in a distributed web server system. The approach uses the Computation Structure Model to derive server processing time required to process a request sent from a client and queueing model to analyze the communication between the clients and the server.

Replicating web contents using a hybrid particle swarm optimization

We consider the problem of placing copies of objects in a distributed web server system to minimize the cost of serving read and write requests when the web servers have limited storage capacities. We formulate the problem as a 0–1 optimization problem and present a hybrid particle swarm optimization algorithm to solve it. The proposed hybrid algorithm makes use of the strong global search ability of particle swarm optimization (PSO) and the strong local search ability of tabu search to obtain high quality solutions. The effectiveness of the proposed algorithm is demonstrated by comparing it with the genetic algorithm (GA), simple PSO, tabu search, and random placement algorithm on a variety of test cases. The simulation results indicate that the proposed hybrid approach outperforms the GA, simple PSO, and tabu search.

Dynamic replication of web contents

The phenomenal growth of the World Wide Web has brought huge increase in the traffic to the popular web sites. Long delays and denial of service experienced by the end-users, especially during the peak hours, continues to be the common problem while accessing popular sites. Replicating some of the objects at multiple sites in a distributed web-server environment is one of the possible solutions to improve the response time/latency. The decision of what and where to replicate requires solving a constraint optimization problem, which is NP-complete in general. In this paper, we consider the problem of placing copies of objects in a distributed web server system to minimize the cost of serving read and write requests when the web servers have limited storage capacity. We formulate the problem as a 0–1 optimization problem and present a polynomial time greedy algorithm with backtracking to dynamically replicate objects at the appropriate sites to minimize a cost function. To reduce the solution search space, we present necessary conditions for a site to have a replica of an object in order to minimize the cost function. We present simulation results for a variety of problems to illustrate the accuracy and efficiency of the proposed algorithms and compare them with those of some well-known algorithms. The simulation results demonstrate the superiority of the proposed algorithms.

Object Grouping and Replication on a Distributed Web Server System

Object replication is a well-known technique to improve performance of a distributed Web-server system. This article first presents an algorithm to group correlated Web objects that are most likely to be requested by a given client in a single session so that they can be replicated together, preferably, on the same server. A centralized object replication algorithm is then proposed to replicate the object groups to a cluster of Web-server systems in order to minimize the user’s perceived latency, which is subject to certain constraints. Due to the dynamic nature of Web content and users’ access patterns, a distributed object replication algorithm also is proposed where each site locally replicates the object groups based on the local access patterns. The performance of the proposed algorithms is compared with three well-known algorithms, and the results are reported. The results demonstrate the superiority of the proposed algorithms.