• The KIPS Transactions:PartA
• /
• v.10A no.6
• /
• pp.635-642
• /
• 2003

The radical development of recent network technology provides the basic foundation which can establish a high speed and cheap cluster system. It is a general trend that conventional cluster systems are built as the system over a fixed level based on stabilized and high speed local networks. A multi-distributed web cluster group is a web cluster model which can obtain high performance, high efficiency and high availability through mutual cooperative works between effective job division and system nodes through parallel performance of a given work and shared memory of SC-Server with low price and low speed system nodes on networks. For this, multi-distributed web cluster group builds a sub-cluster group bound with single imaginary networks of multiple system nodes and uses the web distributed shared memory of system nodes for the effective data transmission within sub-cluster groups. Since the presented model uses a load balancing and parallel computing method of large-scale work required from users, it can maximize the processing efficiency.

• The KIPS Transactions:PartA
• /
• v.14A no.5
• /
• pp.269-278
• /
• 2007

Caching in a cache sorrel cluster environment has an advantage that minimizes the request and response tine of internet traffic and web user. Then, one of the methods that increases the hit ratio of cache is using the hash function with cooperative caching. It is keeping a fixed size of the total cache memory regardless of the number of cache servers. On the contrary, if there is no cooperative caching, the total size of cache memory increases proportional to the number of cache sowers since each cache server should keep all the cache data. The disadvantage of hashing method is that clients' requests stress a few servers in all the cache servers due to the characteristics of hashing md the overall performance of a cache server cluster depends on a few servers. In this paper, we propose the method that distributes uniformly client requests between cache servers using dynamic server information. We performed experiments using 16 PCs. Experimental results show the uniform distribution o

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.12
• /
• pp.708-713
• /
• 2003

For many years clustered heterogeneous web server architecture has been formed on the internet because the explosive internet services and the various quality of requests. The critical point in cluster environment is the mapping schemes of request to server. and recently this is the main issue of internet architecture. The topic of previous mapping methods is to assign equal loads to servers in cluster using the number of requests. But recent growth of various services makes it hard to depend on simple load balancing to satisfy appropriate latency. So mapping based on requested content to decrease response time and to increase cache hit rates on entire servers - so called “content-based” mapping is highly valuated on the internet recently. This paper proposes Prioritized Highest Random Weight mapping(PHRW mapping) that improves content-based mapping to properly fit in the heterogeneous environment. This mapping scheme that assigns requests to the servers with priority, is very effective on heterogeneous web server cluster, especially effective on decreasing latency of reactive data service which has limit on latency. This paper have proved through algorithm and simulation that proposed PHRW mapping show higher-performance by decrease in latency.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.9
• /
• pp.434-441
• /
• 2001

The concept of network memory was introduced for the efficient exploitation of main memory in a cluster. Network memory can be used to speed up applications that frequently access large amount of disk data. In this paper, we present a memory a management algorithm that does not require prior knowledge of access patterns and that is practical to implement under the web server cluster, In addition, our scheme has a good user response time for various access distributions of web documents. Through a detailed simulation, we evaluate the performance of our memory managment algorithms.

• 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.

• 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.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.554-556
• /
• 2003

최근 웹 서비스가 다양한 컨텐츠와 전자상거래 둥 비즈니스와 관련된 서비스로 변화함에 따라 대용량 서비스뿐만 아니라 고품질 서비스(QoS)를 제공하기 위한 연구가 진행되고 있다. 웹 서버 클러스터에서도 서버 성능 향상과 함께 005를 제공하기 위한 차별화된 서비스가 필요하다. 본 논문에서는 사용자 계층별로 차별화된 서비스를 제공하기 위해서 서버 노드를 동적으로 분할하는 기법을 제안한다.

• The KIPS Transactions:PartA
• /
• v.14A no.1 s.105
• /
• pp.63-72
• /
• 2007

This paper introduces a load-balancing algorithm focusing on distributing web requests evenly into the web cluster servers. The load-balancing algorithms based on conventional periodic load-information update mechanism are not suitable for dynamic page applications, which are common in Cyber Foraging services, due to the problems caused by periodic synchronized load-information updating and the difficulties of work load estimation caused by embedded executing scripts of dynamic pages. Update-on-Finish algorithm solves this problem by using non-periodic load-update mechanism, and the web switch knows the servers' real load information only after their reporting and then distributes new loads according to the new load-information table, however it results in much communication overhead. Our proposed mechanism improve update-on-finish algorithm by using K-Percents-Finish mechanism and thus largely reduce the communication overhead. Furthermore, we consider the different capabilities of servers with a threshold Ti value and propose a load-balancing algorithm for servers with various capabilities. Simulation results show that the proposed K-Percents-Finish Reporting mechanism can at least reduce 50% communication overhead than update-on-finish approach while sustaining better load balancing performance than periodic mechanisms in related work.

• Journal of Power Electronics
• /
• v.10 no.6
• /
• pp.611-620
• /
• 2010

This paper presents a new architecture, called "Power Electronics Remote Wiring and Measurement Laboratory (PermLAB)", that translates a common gateway interface (CGI) string from a remote web user to a web server connected to a 3-dimension switching matrix board, can be used to switch on and off, and to control a cluster of instruments and components. PermLAB addresses real-time connection, switching, and data acquisition over the Internet instead of using simulated data. A software procedure uses a signature system to identify each instrument and component in a complex system. The Web-server application is developed in HTML, JavaScript and Java, and in C language for the CGI interface, which resides in a controller portion of LabVIEW. The LabVIEW software fully integrates the Web sever, LabVIEW data acquisition boards and controllers, and the 3-dimensional switching matrix board. The paper will analyze a half-wave rectifier (AC - DC converter) circuit connected over the Internet using the PermLAB. PermLAB allows students to obtain real data by real-time wiring of real circuits in the laboratory using a "virtual breadboard" on the Web. The software for the Web-based 3-dimensional system is flexible, portable, can be integrated into many laboratory applications or expanded, and easily accessible worldwide.

• Journal of Korea Multimedia Society
• /
• v.4 no.6
• /
• pp.534-542
• /
• 2001

Recent content-based image retrieval systems make use of a local single server contained a limited number of images. So these systems are not satisfactory for the Web user's needs that make request for various images on the Web. A content-based image retrieval system that has regard for a great number of Web images has to stand on the basis of real-time first of all. Therefore, to implement the above system we have to resolve a problem of large waste time to take for an image collection and feature extractions. In recent, PC clusters with a load distribution are implemented for the purpose of high-performance data processing. In this paper, we decreased the whole retrieval time by distributing the tasks of image collection and feature extraction to take much time among the slave computers of the PC cluster, and so we found the possibility of the real-time processing in the retrieval of Web images.