Distributed Web Server 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.

Dissection of the experimental outcome of split-protocol

The split-protocol theory was developed for load balancing and quicker data communication. Split-protocol computing paradigm uses web services on geographically distributed web servers on the cloud. A system of large split-servers that form the cloud to handle computing and storage task that would otherwise create a massive CPU utilisation if we work with the traditional individual server. In an earlier paper, we established that the application split-protocol produces higher performance compared to traditional clusters. Based on the necessity, diverse types of split configurations are applied for higher throughput, better response and connection time. The experiential throughput enhancement was within the range 6.5%-25% over non-split systems. This paper examines empirical results split systems to understanding its behaviour compared with non-split systems. Split-protocol was implemented on private cloud for internal data servers of the organisation, not made available to the general public. The split concept emerged from the HTTP/TCP/IP network protocol implementation. The split-system model with given sets of constraints can produce better throughput than conventional equivalent server systems. In this paper, we have presented the analytical model to support a high performance of split-protocol implementation. We have also mathematically evaluated the inherent reliability characteristics of the split-system.

Research on Request Handling Mechanism of Web Server Clusters

This paper analyzes the factors that affect the performance of Web architecture cluster system characteristics studied two typical Web server cluster architecture, proposed a new distributed Web server cluster architecture, and in-depth analysis of its structural features, this architecture is verified in terms of scalability and reliability has advantages.

DISTRIBUTION OF LOAD USING MOBILE AGENT IN DISTRIBUTED WEB SERVERS

The continuing growth of the World-Wide Web is placing increasing demands on popular Web servers. Many of the sites are now using distributed Web servers (i. e., groups of machines) to service the increasing n umber of client requests, as a single server cannot handle t he workload. Incoming client requests must be distr ibuted in some fashion among the machines in the distributed Web server to improve the performance. In the existing work, reducing the high message complexity is a challenge. This study introduces a novel algorithm, wh ich has low message complexity named Load Distribution by dynamically Fixing input to the server using Mobile agent (LDFM) which distributes the incoming request, as i t arrives from the client world, to avoid overloadi ng of the distributed web servers. LDFM uses prefetch techniques to balance the load among the distributed web s ervers. Mobile agents are susceptible to failure. This issu e is also addressed to bring reliability to the alg orithm. The simulation results confirm that the proposed method is reliable. The relative improvement in throughpu t, comparing with the exiting methods is appreciable.

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.

Elastic management of web server clusters on distributed virtual infrastructures

AbstractCluster‐based solutions are being widely adopted for implementing flexible, scalable, low‐cost and high‐performance web server platforms. One of the main difficulties to implement these platforms is the correct dimensioning of the cluster size, so as to satisfy variable and peak demand periods. In this context, virtualization is being adopted by many organizations as a solution not only to provide service elasticity, but also to consolidate server workloads, and improve server utilization rates. A virtualized web server can be dynamically adapted to the client demands by deploying new virtual nodes when the demand increases, and powering off and consolidating virtual nodes during periods of low demand. Furthermore, the resources from the in‐house infrastructure can be complemented with a cloud provider (cloud bursting), so that peak demand periods can be satisfied by deploying cluster nodes in the external cloud, on an on‐demand basis. In this paper, we analyze the scalability of hybrid virtual infrastructures for two different distributed web server cluster implementations: a simple web cluster serving static files and a multi‐tier web server platform running the CloudStone benchmark. Copyright © 2011 John Wiley & Sons, Ltd.

A Load Balancing Policy for Distributed Web Service

The proliferation of web services; and users appeal for high scalability, availability and reliability of web servers to provide rapid response and high throughput for the Clients’ requests occurring at anytime. Distributed Web Servers (DWSs) provide an effective solution for improving the quality of web services. This paper addresses un-regulated jobs/tasks migration among the servers. Considering distributed web services with several servers running, a lot of bandwidth is wasted due to unnecessary job migration. Having considered bandwidth optimization, it is important to develop a policy that will address the bandwidth consumption while loads/tasks are being transferred among the servers. The goal of this work is to regulate this movement to minimize bandwidth consumption. From literatures, little or no attention was given to this problem, making it difficult to implement some of these policies/schemes in bandwidth scarce environment. Our policy “Cooperative Adaptive Symmetrical Initiated Dynamic/Diffusion (CASID)” was developed using Java Development Environment (JADE) a middle ware service oriented environment which is agent-based. The software was used to simulate events (jobs distribution) on the servers. With no job transfer allowed when all servers are busy, any over loaded server process jobs internally to completion. We achieved this by having two different agents; static cognitive agents and dynamic cognitive agents. The results were compared with the existing schemes. CASID policy outperforms PLB scheme in terms of response time and system throughput.

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.

A Survey on Load Balancing Based on Mobile Agents in Distributed Web Servers

i-manager's Journal on Future Engineering and Technology, i-manager's Journal on Software Engineering, i-manager's Journal on Electrical Engineering, i-manager's Journal on Electronics Engineering, i-manager's Journal of Educational Technology, i-manager's Journal on Educational Psychology, i-manager's Journal on School Educational Technology, i-manager's Journal on English Language Teaching, i-manager's Journal on Mechanical Engineering, i-manager's Journal on Civil Engineering, i-manager's Journal on Embedded Systems, i-manager's Journal on Information Technology, i-manager's Journal on Structural Engineering, i-manager's Journal on Communication Engineering and Systems, i-manager's Journal on Wireless Communication Networks, i-manager's Journal on Instrumentation and Control Engineering, i-manager's Journal on Circuits and Systems, i-manager's Journal on Digital Signal Processing, i-manager's Journal on Power Systems Engineering, i-manager's Journal on Computer Science, i-manager's Journal on Material Science, i-manager's Journal on Cloud Computing, i-manager's Journal on Image Processing, i-manager's Journal on Mobile Applications and Technologies, i-manager's Journal on Pattern Recognition, i-manager's Journal on Mathematics, i-manager's Journal on Management, i-manager's Journal on Nursing, i-manager's Journal on Physical Sciences, i-manager's Journal on Chemical Sciences, i-manager's Journal on Economics & Commerce , i-manager's Journal on Humanities & Social Sciences, i-manager's Journal on Life Sciences , i-manager's Journal on Construction Management, i-manager's Oyla , ,India best Journal Publication Website,World Best Plication SIte,Free atrticle published website,Journal Publised,Published Journal,Research Paper Published,indian research paper publications,how to published your article/research paper in india for free,journal’s instructions for authors

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.

Reliable Partial Replication of Contents in Web Clusters: Getting Storage without losing Reliability

Traditionally, distributed Web servers have used two strategies for allocating files on server nodes: full replication and full distribution. While full replication provides a highly reliable solution, it limits storage capacity to the capacity of the smallest node. On the other hand, full distribution provides higher storage capacity at the cost of lower reliability. A hybrid solution is partial replication where every file is allocated to a small number of nodes. The most promising architecture for a partial replication strategy is the Web cluster architecture. However, Web clusters present a big flaw from reliability perspective as they contain a single point of failure. To correct this flaw, in this paper we present a modified architecture: the Web cluster with distributed Web switch. Reliability of Web clusters is evaluated for different replication strategies. System evaluations show that our proposal leads to a highly reliable solution with high scalability.

POCA : A User Distributions Algorithm in Enterprise Systems with Clustering

As enterprises worldwide race to improve real-time management to im- prove productivity, customer services and flexibility, huge resources have been invested into enterprise systems (ESs). All modern ESs adopt an n-tier client-server architec- ture, which includes several application servers to hold users and applications. As in any other multi-server environment, the load distributions, and user distributions in particular, become a critical issue in tuning system performance. In stateful ESs, a user who logs onto an application server and stays connected to the server for an entire working session, which can last for days, evokes each application. Therefore, admitting a user onto an application server affects not only current but also future performance of that server. Although the n-tier architecture may involve web servers, there is little in the literature in Distributed Web Server Architectures that considers the effects of distributing users instead of individual requests to servers. The algorithm proposed in this paper gives specific suggestions in user distributions and the minimal number of servers required based on the application reusability threshold. A heuristic version of the algorithm is also presented to improve the performance. The paper also discusses how to apply association rules to predict new user behavior when distributing users in the run-time. The distributions recommended by the algorithms are compared against the Round-Robin distributions on a set of real data derived from a mid size company. The result shows that the user distributions suggested have better performance than Round Robin distributions.

Approximate algorithms for document placement in distributed Web servers

We study approximate algorithms for placing a set of documents into M distributed Web servers in this paper. We define the load of a server to be the summation of loads induced by all documents stored. The size of a server is defined in a similar manner. We propose five algorithms. Algorithm 1 balances the loads and sizes of the servers by limiting the loads to k/sub l/ and the sizes to k/sub s/ times their optimal values, where 1/k/sub l/-1 + 1/k/sub n/-1. This result improves the bounds on load and size of servers in (L.C. Chen et al., 2001). Algorithm 2 further reduces the load bound on each server by using partial document replication, and algorithm 3 by sorting. Algorithm 4 employs both partial replication and sorting. Last, without using sorting and replication, we give algorithm 5 for the dynamic placement at the cost of a factor Q(log M) in the time-complexity.

A framework of using cooperating mobile agents to achieve load sharing in distributed web server groups

This paper studies the issues of using mobile agents to achieve load sharing for network services in a wide-area network environment such as the Internet. Traditionally, load sharing algorithms are based on the message-passing paradigm. In this paper, we propose the use of mobile agents as an aid to design fully distributed and dynamic load-sharing mechanisms for wide-area network services, which provide several advantages over the pure message-passing-based approach. A framework (called MALS—mobile agent-enabled load-sharing) for structuring and designing load sharing in wide-area network services is presented. In particular, we describe the design of a mobile agent-enabled distributed dynamic load-sharing scheme within the MALS framework. A simulation environment of the load-sharing protocol is being implemented using Aglet™, a Java-compliant mobile agent platform from IBM. Preliminary experimental results demonstrated that the proposed framework is effective.

Document replication and distribution in extensible geographically distributed web servers

A geographically distributed web server (GDWS) system consists of multiple server nodes interconnected by a metropolitan area network (MAN) or a wide area network (WAN). It can achieve better efficiency in handling ever-increasing web requests than centralized web servers because its throughput will not be limited by available bandwidth connecting to a central server. The key research issue in the design of GDWS is how to replicate and distribute the documents of a website among the server nodes. This paper proposes a density-based replication scheme and applies it to our proposed Extensible GDWS architecture. We adopted a partial duplication scheme where document replication targets only at hot objects in a website. To distribute the replicas generated via the density-based replication scheme, we propose four different document distribution algorithms: Greedy-cost, Maximal-density, Greedy-penalty, and Proximity-aware. A proximity-based routing mechanism is designed to incorporate these algorithms for achieving better web server performance in a WAN environment. Simulation results show that the Greedy-penalty algorithm yields most stable load-balancing performance, and the Greedy-cost algorithm causes least internal traffic. Our scheme can achieve 80% of the performance of full-replication, with half the disk space.