• Journal of Information Processing Systems
• /
• v.9 no.3
• /
• pp.379-394
• /
• 2013

Cloud computing is an evolving computing paradigm that has influenced every other entity in the globalized industry, whether it is in the public sector or the private sector. Considering the growing importance of cloud, finding new ways to improve cloud services is an area of concern and research focus. The limitation of the available Virtual Machine Load balancing policies for cloud is that they do not save the state of the previous allocation of a virtual machine to a request from a Userbase and the algorithm requires execution each time a new request for Virtual Machine allocation is received from the Userbase. This problem can be resolved by developing an efficient virtual machine load balancing algorithm for the cloud and by doing a comparative analysis of the proposed algorithm with the existing algorithms.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.370-372
• /
• 2004

본 논문에서는 개방형 운영체제인 리눅스상에서 package streaming service를 제공하는 Network Streaming Service(통칭 NSS)를 설계하는 문제를 다룬다. NSS는 client가 serve 측에 설치된 소프트웨어 package를 마치 client 자신의 local disk상에 이미 인스톨된 패키지를 실행하는 것처럼 동작하도록 해준다. NSS는 client측의 NSS Mounter, Package Streaming Consumer, NSS Configurator와 server측의 NSS Load Balancer, Package Streaming Supplier, NSS Manager, Accounting & Security Manager로 구성되며 local disk caching과 background prefetching 기능을 사용하여 향상된 서비스를 제공한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.73-75
• /
• 2001

다수의 단일노드를 고속의 네트웍으로 연결하여 단일 시스템처럼 인식할 수 있는 클러스터 DBMS 를 효율적으로 관리하기 위해서는 클러스터 관리 도구가 필요하나 관련 연구는 미흡한 실정이다. 본 논문에서는 클러스터 DBMS을 위한 관리도구로써 노드상태를 모니터링 할 수 있는 모니터링 도구를 설계한다. 아울러 이러한 모니터링 결과를 기반으로 각 노드의 부하를 측정하고 사용자의 요구를 적절히 분산시킴으로써 클러스터 DBMS의 성능을 향상을 도모할 수 있는 부하 분산 관리기를 설계한다.

• ETRI Journal
• /
• v.41 no.2
• /
• pp.197-206
• /
• 2019

Software-defined networking (SDN) is a modern approach for current computer and data networks. The increase in the number of business websites has resulted in an exponential growth in web traffic. To cope with the increased demands, multiple web servers with a front-end load balancer are widely used by organizations and businesses as a viable solution to improve the performance. In this paper, we propose a load-balancing mechanism for SDN. Our approach allocates web requests to each server according to its response time and the traffic volume of the corresponding switch port. The centralized SDN controller periodically collects this information to maintain an up-to-date view of the load distribution among the servers, and incoming user requests are redirected to the most appropriate server. The simulation results confirm the superiority of our approach compared to several other techniques. Compared to LBBSRT, round robin, and random selection methods, our mechanism improves the average response time by 19.58%, 33.94%, and 57.41%, respectively. Furthermore, the average improvement of throughput in comparison with these algorithms is 16.52%, 29.72%, and 58.27%, respectively.

• Journal of Power Electronics
• /
• v.10 no.5
• /
• pp.538-547
• /
• 2010

This paper deals with a stand-alone wind energy conversion system (WECS) with an isolated asynchronous generator (IAG) and voltage and frequency (VF) control feeding three-phase four-wire loads. The reference generator currents are estimated using the instantaneous symmetrical component theory to control the voltage and frequency of an IAG system. A three-leg voltage source converter (VSC) with an isolated star/delta transformer is used as an integrated VSC. An integrated VSC with a battery energy storage system (BESS) is used to control the active and reactive powers of the WECS. The WECS is modeled and simulated in MATLAB using the Simulink and the Sim Power System (SPS) toolboxes. The proposed VF controller functions as a voltage and frequency regulator, a load leveler, a load balancer and a harmonic eliminator in the WECS. A comparison is made on the rating of the VSC with and without ac capacitors connected at the terminals of an IAG. Simulation and test results are presented to verify the control algorithm.

• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.3
• /
• pp.169-177
• /
• 2016

To realize high-speed intrusion detection by accommodating many regular expression (regex)-based signatures and growing network link capacities, we propose the Service TimE-Aware Load-balancing (STEAL) algorithm. This work is motivated from the observation that utilization of a many-core network intrusion detection system (NIDS) is influenced by unfair computational distribution among many-core NIDS nodes. To avoid such unfair computational distribution, STEAL is designed to dynamically distribute a large volume of traffic among many-core NIDS nodes based on packet service time, which is represented by the deep packet time in many-core NIDS nodes. From experiments, we show that compared to the commonly used load-balancing algorithm based on arrival rate, STEAL increases the number of received packets (i.e., decreases the number of dropped packets) in many-core NIDS. Specifically, by integrating an open source NIDS (i.e. Bro) with STEAL, we show that even under attack-dominant traffic and with many signatures, STEAL can rapidly improve the performance of many-core NIDS to realize high-speed intrusion detection.

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

• Proceedings of the IEEK Conference
• /
• 2004.06a
• /
• pp.99-102
• /
• 2004

Caching is one of essential functions in a wireless internet proxy server cluster. To serve best quality of service and choose suitable a proxy server for user, load balancer have to consider cache cooperation between proxy servers. Usually hashing is a simple way to support cache cooperation. In this paper, we compare and analysis static hashing and MD 5 that can be used for cache cooperation.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2018.10a
• /
• pp.43-45
• /
• 2018

전 세계적으로 클라우드 서버의 가상화 기술이 중요해졌다. VM에서 사용되는 데이터 특징을 기준으로 에너지를 효율적으로 사용하기 위한 연구가 지속적으로 연구되고 있다. 그러나 접속자가 적거나, 특정 시간에만 접속이 되는 경우에도 웹 서버를 작동하기 위하여 VM를 실행되고 있다. 그에 따라 VM 자원 낭비가 되고 있다. 로드 밸런서를 통해 접속 요청이 없는 웹 서버는 동작시키지 않음으로써 자원 효율을 높이고자 한다. 그에 따라 본 논문에서는 에너지 효율이 높은 로드 밸런서를 설계하였다.

• Journal of Communications and Networks
• /
• v.17 no.3
• /
• pp.306-320
• /
• 2015

Due to an explosive growth in services running in different datacenters, there is need for service selection and routing to deliver user requests to the best service instance. In current solutions, it is generally the client that must first select a datacenter to forward the request to before an internal load-balancer of the selected datacenter can select the optimal instance. An optimal selection requires knowledge of both network and server characteristics, making clients less suitable to make this decision. Information-Centric Networking (ICN) research solved a similar selection problem for static data retrieval by integrating content delivery as a native network feature. We address the selection problem for services by extending the ICN-principles for services. In this paper we present Queue and Latency, a network-driven service selection algorithm which maps user demand to service instances, taking into account both network and server metrics. To reduce the size of service router forwarding tables, we present a statistical method to approximate an optimal load distribution with minimized router state required. Simulation results show that our statistical routing approach approximates the average system response time of source-based routing with minimized state in forwarding tables.