• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.3
• /
• pp.236-242
• /
• 2004

In this paper, we propose an approach to parallelize a load balancing algorithm that was shown to be very effective in distributing workload for parallel computations. Load balancing algorithms are required in executing parallel program efficiently As a parallel computation model, we used dynamically growing tree structure that can be found in many application problems. The load balancing algorithm tries to balance the workload among processors while keeping the communication cost under certain limit. We show how the load balancing algorithm is effectively parallelized on mesh and hypercube interconnection networks, and analyzed the time complexity for each case to show that parallel algorithm actually reduced the various overhead.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.04a
• /
• pp.164-166
• /
• 2015

Recently, the implementations of private and public cloud service (IaaS: Infrastructure as a Service) have been growing rapidly. As a result, the need to provide High-Availability and Load-Balancing for the users has also increased. Openstack which is one of cloud computing solutions currently offers a feature to meet the need through an extension called Load Balancing as a Service (LBaaS). This paper will provide a detailed explanation about Openstack's LBaaS and its operation principle will be analyzed through the actual implementation.

• International Journal of Computer Science & Network Security
• /
• v.21 no.3
• /
• pp.212-218
• /
• 2021

Low-power and Lossy Networks (LLNs) have become the common network infrastructure for a wide scope of Internet of Things (IoT) applications. For efficient routing in LLNs, IETF provides a standard solution, namely the IPv6 Routing Protocol for LLNs (RPL). It enables effective interconnectivity with IP networks and flexibly can meet the different application requirements of IoT deployments. However, it still suffers from different open issues, particularly in large-scale setups. These include the node unreachability problem which leads to increasing routing losses at RPL sink nodes. It is a result of the event of memory overflow at LLNs devices due to their limited hardware capabilities. Although this can be alleviated by the establishment of multi-sink topologies, RPL still lacks the support for effective load balancing among multiple sinks. In this paper, we address the need for an efficient multi-sink load balancing solution to enhance the performance of PRL in large-scale scenarios and alleviate the node unreachability problem. We propose a new RPL objective function, Multi-Sink Load Balancing Objective Function (MSLBOF), and introduce the Memory Utilization metrics. MSLBOF enables each RPL node to perform optimal sink selection in a way that insure better memory utilization and effective load balancing. Evaluation results demonstrate the efficiency of MSLBOF in decreasing packet loss and enhancing network stability, compared to MRHOF in standard RPL.

• Journal of KIISE:Information Networking
• /
• v.33 no.3
• /
• pp.231-246
• /
• 2006

A server load balancer is used to accept and distribute client requests to one of servers in a wireless internet proxy server cluster. LVS(Linux Virtual Server), a software based server load balancer, can support several load balancing algorithms where client requests are distributed to servers in a round robin way, in a hashing-based way or in a way to assign first to the server with the least number of its concurrent connections to LVS. An improved load balancing algorithm to consider server performance was proposed where they check upper and lower limits of concurrent connection numbers to be allowed within each maximum server performance in advance and apply the static limits to load balancing. However, they do not apply run-time server load information dynamically to load balancing. In this paper, we propose a dynamic load balancing scheme where the load balancer keeps each server CPU load information at run time and assigns a new client request first to the server with the lowest load. Using a cluster consisting of 16 PCs, we performed experiments with static content(image and HTML). Compared to the existing schemes, experimental results show performance improvement in the cases of client requests requiring CPU-intensive processing and a cluster consisting of servers with difference performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.7
• /
• pp.2454-2467
• /
• 2015

Increasing traffic and bandwidth requirements bring challenges to the next generation wireless networks (5G). As one of the main technology in 5G networks, Ultra-Dense Network (UDN) can be used to improve network coverage. In this paper, a radio over fiber based model is proposed to solve the load balancing problem in ultra-dense network. Stochastic differential game is introduced for the load balancing algorithm, and optimal load allocated to each access point (RAP) are formulated as Nash Equilibrium. It is proved that the optimal load can be achieved and the stochastic differential game based scheme is applicable and acceptable. Numerical results are given to prove the effectiveness of the optimal algorithm.

• International Journal of Contents
• /
• v.3 no.1
• /
• pp.9-13
• /
• 2007

This paper proposes a policy on efficient load balancing that can reduce the network game server load burdened by surging number of users. The study adopted a contents-based clustering technique. Recently, skyrocketing number of clients in on-line games causes overloads on specific game servers, and the consequent server-instability brings the worst situation: a server failure. To cope with this problem, one can install more high-powered servers or be equipped with back-up servers, which is often inefficient in terms of cost performance. To solve this problem, the present study examined the technology enhancing the performance and efficiency of game servers by reducing the loads of specific game servers. In doing this, this study used the clustering technology to compose game servers classified by their contents and carried out appropriate load balancing to numerous clients with load balancers in each region.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.1 no.1
• /
• pp.8-13
• /
• 2006

In mobile ad hoc networks, most of on demand routing protocols such as DSR and AODV do not deal with traffic load during the route discovery procedure. To achieve load balancing in networks, many protocols have been proposed. However, existing load balancing schemes do not consider the remaining available buffer size of the interface queue, which still results in buffer overflows by congestion in a certain node which has the least available buffer size in the route. To solve this problem, we propose a load balancing protocol called Dynamic Congestion Aware Routing Protocol (DCAR) which monitors the remaining buffer length of all nodes in routes and excludes a certain congested node during the route discovery procedure. We also propose two buffer threshold values to select an optimal route selection metric between the traffic load and the minimum hop count. Through simulation study, we compare DCAR with other on demand routing protocols and show that the proposed protocol is more efficient when a network is heavily loaded.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04a
• /
• pp.151-153
• /
• 2000

본 논문은 분산 서버 시스템을 위한 Load Balancing Architecture를 제안한다. 이 구조는 기존에 구현된 클라이언트/서버 시스템을 그대로 사용하면서 규모를 확장할 수 있는 특징을 가지고 있다. Load Balancing Service가 동작하기 위해서는 서버의 성능과 구성상태에 대한 정보를 주고받는 것이 필요하다. 이를 위하여 본 논문에서는 Load Balacing Information Transfer Protocol을 제시한다. 본 논문이 제시하는 구조는 DCOM 및 EJB 등의 Component 서버에서도 사용되어서 확장성을 가지게 할 수 있다.

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

Peer-to-Peer Network에서의 object위치 정보의 배치 및 라우팅 방법인 Chord시스템은 node ID와 object ID생성에 있어서 SHA-1과 같은 해쉬 함수를 사용한다. Chord object위치 정보 관리에 있어서 해쉬에 의해 저절로 load-balancing을 기대하나 실험에 의하면 노드별 load에는 상당한 편차가 있음이 나타난다. 그러므로 이 논문에서는 각 node간 협력을 통하여 보다 효과적인 load-balancing을 제공하는 CLCS 기법을 제안한다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.2
• /
• pp.53-58
• /
• 2013

A Fat-Tree topology has multiple paths between any pair of hosts. The delay for the multiple paths with an equal number of hops depends mainly on the queuing delay. However, most of the existing load-balancing schemes do not sufficiently exploit the characteristics of Fat-Tree. In most schemes load-balancing is performed at a flow level. Packet-level load-balancing schemes usually require the availability of special transport layer protocols to address packet reordering. In this paper, we propose a new packet-level load-balancing scheme which can enhance network utilization while minimizing packet reordering in Fat-Trees. Simulation results show that the proposed scheme provides as high TCP throughput as a randomized flow-level Valiant load balancing scheme for a best case.