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

• Proceedings of the Korea Contents Association Conference
• /
• 2003.11a
• /
• pp.113-119
• /
• 2003

Both the highly developed computing environment and the rapid increase of the internet users enable the present web based cluster system accounting service to help many users access to numerous data at high speed. However, the information security of users and data is also as important as the convenience of the systematic environment. Especially, the significance of damage to the individuals and organizations resulted from the data outflow, hacking and malicious coding has risen up to one of the most essential problems in the internet service business. In this study, I suggest a more safe web based cluster system accounting service solution applying SEED, the Korean Telecommunications Technology Association (TTA) standard encryption algorithm.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.6
• /
• pp.507-513
• /
• 2004

In this paper, we consider the methodology of efficient resource usage, specially web clustering system. We develope an algorithm that distributes the load on the web cluster system to use the system resources, such as system memory equally. The response time is chosen as a performance measure on the various clustering models. And based on the concurrent user to the web cluster system, the response time is also examined as the number of users increases. Simulation experience with this algorithm shows that the response time seems to have a good results compare to those with the other algorithm. And, also the effectiveness of clustered system becomes better as long as the number of concurrent user increases. The usage of developed algorithm is more useful when the system consists of many different sub-systems, a heterogeneous clustering system.

• Journal of Communications and Networks
• /
• v.8 no.3
• /
• pp.330-338
• /
• 2006

Many web cache systems and policies concerning them have been proposed. These studies, however, consider large objects less useful than small objects in terms of performance, and evict them as soon as possible. Even if this approach increases the hit rate, the byte hit rate decreases and the connections occurring over congested links to outside networks waste more bandwidth in obtaining large objects. This paper puts forth a client-cluster approach for improving the web cache system. The client-cluster is composed of the residual resources of clients and utilizes them as exclusive storage for large objects. This proposed system achieves not only a high hit rate but also a high byte hit rate, while reducing outgoing traffic. The distributed hash table (DHT) based peer-to-peer lookup protocol is utilized to manage the client-cluster. With the natural characteristics of this protocol, the proposed system with the client-cluster is self-organizing, fault-tolerant, well-balanced, and scalable. Additionally, the large objects are managed with an index based allocation method, which balances the loads of all clients well. The performance of the cache system is examined via a trace driven simulation and an effective enhancement of the proxy cache performance is demonstrated.

• Journal of information and communication convergence engineering
• /
• v.2 no.2
• /
• pp.106-109
• /
• 2004

This study designs a load balancer via direct routing that share a virtual service on a single IP address in the Linux system and suggests an efficient load balancing method to improve transmission speed in the web server cluster environment. It will increase performance and scalability with fast packet transfer and removing bottleneck problem by using TCP Splicing and Content-Aware Distributor method. This method is expected to be the noticeable technology that provides an important interface, which make application services for e-commerce effectively be applied to high-speed network infrastructure. At this time, it is required to study further on the optimum balancing method in the web server cluster environment so as to apply the hybrid (optimum load balancing method by software and hardware) method and improve the reuse of security cession based on high-speed TCP connections.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.680-699
• /
• 2015

The use of web service has been increased rapidly, with an increase in the number of available services, finding the exact service is the challenging task. Service discovery is the most significant job to complete the service discoverers needs. In order to achieve the efficient service discovery, we focus on designing a cluster based service discovery model for service registering and service provisioning among all mobile nodes in a mobile ad hoc network (MANETs). A dynamic backbone of nodes (i.e. cluster heads) that forms a service repository to which MANET nodes can publish their services and/or send their service queries. The designed model is based on storing services with their service description on cluster head nodes that are found in accordance with the proposed cluster head election model. In addition to identifying and analyzing the system parameters for finding the effectiveness of our model, this paper studies the stability analysis of the network, overhead of the cluster, and bandwidth utilization and network traffic is evaluated using analytic derivations and experimental evaluation has been done.

• Journal of Korea Multimedia Society
• /
• v.7 no.8
• /
• pp.1097-1106
• /
• 2004

The typical web cluster architecture consists of replicated real servers and a virtual server that routes client requests among the real servers. In this paper, we proposed an efficient dynamic load distribution method with load prediction for the web cluster systems. The virtual server transmit status request message to real servers in other to get load states. However the load states dose not accurate during load distribution, thus the virtual server predict the load status of real servers and assign a request of the client to the minimum loaded real server. The proposed distribution methods works not related to partial breakdown of real servers, thus the system works with high availability. We also show that the proposed distribution method preserve scalable property and improve the throughput through a set of simulations.

• The KIPS Transactions:PartA
• /
• v.10A no.4
• /
• pp.285-294
• /
• 2003

The request scheduling algorithms being used for the cluster web servers are mostly in two categories : load-balancing and contents-based cache affinity The goal of the load-balancing algorithms is to balance the loads between real servers. On the other hand, contents-based scheduling algorithm exploits the cache affinity in a way that the same type of requests are to be directed to a dedicated real server allowing load imbalance. So the performance comparison of the two algorithms is necessary, nevertheless the related experiment results are not much suggested. In this paper, performance evaluations have been done to compare the performance of the two scheduling algorithms. To accomplish this, we first implement a linux cluster web server, and then present the performance measurement results. The main contribution of this paper is to help the cluster web server administrators to select an algorithm fitting in with their circumstances from the two algorithms.

• Journal of Digital Convergence
• /
• v.6 no.2
• /
• pp.117-125
• /
• 2008

High-volume web sites often use clusters of servers with load balancing as a way to increase the performance, scalability, and availability of the sites. Load balancing, usually performed by load balancer in front of such clusters, is a technique to spread workload between several computers or resources, in order to get optimal resource utilization or response time. In this paper we examine the performance for several configurations of cluster-based web servers using a simulation approach. We investigate two types of buffering scheme (common and local) for web clusters and three load balancing policies (uniformly random, round robin, and least queue first), using response time as a performance measure. We also examine two basic approaches of scaling web clusters: adding more servers of same type or upgrading the capacity of the servers in the clusters.

• Journal of Information Science Theory and Practice
• /
• v.8 no.4
• /
• pp.6-19
• /
• 2020

The objective of this research is to analyze which functions make up web-based as well as mobile social media services and messengers. Services are clustered by their functionality. A total of 640 individual functions were identified, while investigating altogether 44 selected services in their web and mobile versions. Applying content analysis, functions were assigned to the services. The services were ranked by the number of implemented functions, and the functions were ranked by their occurrence in the services. Cluster analysis was applied to classify the services according to their functionality. Facebook and VKontakte were found to be the ones with the most functions; the most frequently implemented functions are support, profile, and account-related. Cluster analysis revealed six classes for mobile and seven classes for web applications. There is a noteworthy difference regarding the functionality scope between web and mobile applications of the same services. An example for this is Mendeley with 38 functions in the mobile and 91 functions in the web version. This is the first empirical attempt at clustering social media services based on their functionality.