• Journal of Advanced Navigation Technology
• /
• v.13 no.5
• /
• pp.669-676
• /
• 2009

HTTP or audio/video streaming services are good candidates for future centralized navigation system and in order to provide stability for such services, service providers use a cluster of web servers. In this paper, we provide the criteria for web server cluster design of vehicular users with consideration of differentiated access per different user classes. Several feasible scenarios are examined and their performance analysis using queueing theory is presented to provide the foundation for web server cluster design using traffic load balancer. Through the thorough analysis, efficient criteria for traffic load balancer design is derived. In order to satisfy users' service requirements, priority services controlled by traffic load balancer are considered and analyzed. We also provide the evaluation of the accuracy of the analytical model through simulation.

• Journal of the Korea Society for Simulation
• /
• v.19 no.3
• /
• pp.91-98
• /
• 2010

This paper is on the research result for analyzing the performance of GLORY(GLobal Resource management sYstem) used for Web Server Cluster system, which was developed at ETRI(Electronic and Telecommunication Research Institute). The paper includes the definition of Web Server Cluster System, the characteristics of the system, user oriented system performance, current performance enhancement methods, computer simulation model for GLORY and its experimental results for the performance of GLORY. GLORY is composed of 2048~1,000,000 units of PCs, and is used for Internet servers. From the results of the simulation experiments, we notice that GLORY has enough capacity to fully serve the appropriate level of Internet services. Also, the results show that Web server service time is longer than that for network transmission time but requires more DNS than expected, and that 100Mbps LAN is good enough for directly connecting Internet to the Web servers while not affecting the total system performance.

• Journal of Internet Computing and Services
• /
• v.6 no.2
• /
• pp.69-84
• /
• 2005

As the Internet users are increasing rapidly, a cluster web server system is attracted by many researchers and Internet service providers. The cluster web server has been developed to efficiently support a larger number of users as well as to provide high scalable and available system. In order to provide the high performance in the cluster web server, efficient load distribution is important, and recently many content-aware request distribution techniques have been proposed. In this paper, we propose a new content-aware load balancing technique that can evenly distribute the workload to each node in the cluster web server. The proposed technique is based on the hash histogram transformation, in which each URL entry of the web log file is hashed, and the access frequency and file size are accumulated as a histogram. Each user request is assigned into a node by mapping of (hashed value-server node) in the histogram transformation. In the proposed technique, the histogram is updated periodically and then the even distribution of user requests can be maintained continuously. In addition to the load balancing, our technique can exploit the cache effect to improve the performance. The simulation results show that the performance of our technique is quite better than that of the traditional round-robin method and we can improve the performance more than $10\%$ compared with the existing workload-aware load balancing(WARD) method.

• Proceedings of the IEEK Conference
• /
• 2002.06c
• /
• pp.177-180
• /
• 2002

This paper introduces a new distributed QoS (Quality of Service) control system for clusters of web servers. The proposed system can employ not only network bandwidth but also other metrics such as processor load, memory usage, and storage access load that affect the overall system performance. Moreover, it controls over clustered\ulcorner workstations in of-der to utilize idle resources among workstations. This architecture maximizes overall usage of cluster of web servers while it provides predictable and differentiated performance for each contents volume. We implemented a prototype of introduced system, and the test results showed the proposed method can control QoS in a cluster server system.

• The KIPS Transactions:PartA
• /
• v.12A no.7 s.97
• /
• pp.613-620
• /
• 2005

To provide reliable differentiated service for internet clients, many studies on differentiated service are widely done. According to the types of the request of the clients in cluster-based web systems, SLA (Service Level Agreement) between service provider and the clients is considered. In this Paper, we study primary-backup web switch in the web systems that distribute the request of clients to each of web servers and also study performance isolation and admission control schemes of heterogeneous web systems which distinguish the servers into each different function domains. We analyze the availability, the response time and the performance of admission control through various simulated experiments on the proposed web systems.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.60-67
• /
• 2005

A cluster consists of a collection of interconnected stand-alone computers working together and provides a high-availability solution in application area such as web services or information systems. Content-based load distribution for web server clusters uses the detailed data found in the application layer to intelligently route user requests among web servers. In this paper, we propose a content-based load distribution algorithm that considers cache hit and load information of the web servers under the web server clusters. In addition, we expand this algorithm in order to manage user requests for dynamic file. Specially, our algorithm does not keep track of any frequency of access information or try to model the contents of the caches of the web servers.

• Proceedings of the IEEK Conference
• /
• 2003.11b
• /
• pp.65-68
• /
• 2003

In this paper, we consider issues related to the autonomous management of a server cluster Server clustering technique is widely used for high available Internet servers such as a web server, because it provides very scalable and reliable service. However, it is very burden-some to manage the cluster system. For instance, installation or configuration of a new node requires skilled administrators. Also, when a node is failed, it should be recognized and recovered by a human. The management complexity gets higher while increasing the number of machines for higher throughput. Here, we are going to alleviate the management complexity by building an autonomous cluster server with Jini $_{TM}$ technology from Sun Microsystems.

• Journal of Information Technology Applications and Management
• /
• v.12 no.3
• /
• pp.41-56
• /
• 2005

Product recommender system is one of the most popular techniques for customer relationship management. In addition, collaborative filtering (CF) has been known to be one of the most successful recommendation techniques in product recommender systems. However, CF has some limitations such as sparsity and scalability problems. This study proposes hybrid cluster analysis and case-based reasoning (CBR) to address these problems. CBR may relieve the sparsity problem because it recommends products using customer profile and transaction data, but it may still give rise to scalability problem. Thus, this study uses cluster analysis to reduce search space prior to CBR for scalability Problem. For cluster analysis, this study employs hybrid genetic and K-Means algorithms to avoid possibility of convergence in local minima of typical cluster analyses. This study also develops a Web-based prototype system to test the superiority of the proposed model.

• Journal of KIISE:Information Networking
• /
• v.28 no.4
• /
• pp.550-558
• /
• 2001

Although the web is becoming a widely accepted medium, it provides relatively poor performance and low availability. A cluster consists of a collection of interconnected stand-alone computers working together and provides a high-availability solution in application area such as web services or information systems. In this paper, we propose a load balancer architecture under the web server cluster that provides high-availability, high performance and scalability. In addtion, we propose an efficient load balancing algorithm that considers access rate and size of documents. Specially, our algorithm does not require the nodes running under similar configurations and the same operating system. Also, server cache can be utilized more efficiently.

• The KIPS Transactions:PartA
• /
• v.12A no.5 s.95
• /
• pp.427-432
• /
• 2005

I studied about existent load distribution algorithms and the WLC(Weighted Least Connection) algerian that is using much at present to distribute the connection request of users to real servers efficiently in web cluster system. The efficiency of web cluster system is fallen by load imbalance between servers, because there is problem In inaccurate load status measuring of servers and measuring timing at these load distribution algorithms. In this paper, I suggest an algorithm that distributes load base on various load state of servers by real time using broadcasting RPC(Remote Procedure Call) when a user requests connection, and implement a prototype and experiment its performance. The experiment result shows that load imbalance phenomenon between reai sowers was improved greatly than existing method, and performance of web cluster system was improved by efficiency that response time is shortened.