• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.868-870
• /
• 2004

ad-hoc 망에서 라우팅 프로토콜의 부하균등(load balancing)은 이동성과 전송 지연사이의 trade-off로 인하여 성능 관점에서 중요한 이슈가 되어왔다. 부하균등을 고려한 SLAP(Simple Load-balancing Ad-hoc routing Protocol)이 제안되었으나 혼잡이 발생하거나 망의 토폴로지가 변화하였을 때 유연하게 대처하지 못한다. 본 논문에서는 ad-hoc 망에서 트래픽 혼잡 제어와 망의 이동성에 적응하기 위하여 동적인 임계치를 사용하는 부하균등 라우팅 프로토콜을 제안하였다. 제안된 프로토콜은 성능은 GloMoSim으로 시뮬레이션을 수행하여 AODV, DSR, SLAP과 지연, 패킷 전송률 등을 비교하여 평가하였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.8
• /
• pp.1259-1268
• /
• 2002

One of the major goals suggested in distributed system is to improve the performance of the system through the load balancing of whole system. Load balancing among systems improves the rate of processor utilization and reduces the turnaround time of system. In this paper, we design the rule of decision-making and information interchange based on knowledge based mechanism which makes optimal load balancing by sharing the future load state information inferred from past and present information of each nodes. The result of performance evaluation shows that utilization of processors is balanced, the processing time is improved and reliability and availability of systems are enhanced. The proposed mechanism in this paper can be utilized in the design of load balancing algorithm in distributed operating systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.6
• /
• pp.1016-1026
• /
• 1994

In this paper, we have studied load balancing problems in distributed systems. The nodes of distributed systems exchange periodically system state information each other. The information is stored in history. Based on the information, we compute an expected load index(ELI) using a five-degree interpolation polynomial in Newton`s backward difference interpolation formula. A new location policy of dynamic load balancing systems makes use of the ELI. We show that its performance is better than that of the existing load balancing algorithm through a simulation study.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.05b
• /
• pp.175-178
• /
• 2003

현재 다중 링크VPN(Virtual Private Network) 장비들은 회선 장애(Fail-Off) 발생 시 회선 간의 전이(Transition) 기능만 가능할 뿐이고, 부하균등(Load Balancing)은 고려하지 않고 있다. 이럼으로써 다중 회선의 효율성이 크게 떨어지는 결과를 보인다. 본 논문에서는 부하균등을 하면서 회선장애 발생 시 전이되는 기술을 제안하였다.

• The KIPS Transactions:PartA
• /
• v.10A no.1
• /
• pp.49-58
• /
• 2003

In a sender-initiated load balancing algorithm, a sender (overloaded processor) continues to send unnecessary request messages for load transfer until a receiver (underloaded processor) is found while the system load is heavy. Therefore, it yields many problems such as low cpu utilization and system throughput because of inefficient inter-processor communications until the sender receives an accept message from the receiver in this environment. This paper presents an approach based on genetic algorithm (GA) for dynamic load balancing in heterogeneous distributed systems. In this scheme the processors to which the requests are sent off are determined by the proposed GA to decrease unnecessary request messages.

• The KIPS Transactions:PartC
• /
• v.13C no.5 s.108
• /
• pp.621-626
• /
• 2006

A mobile ad hoc network (MANET) is an infrastructureless network that supports multi-hop communication. For the MANET nodes wishing to communicate with nodes in the wired Internet, the global Internet connectivity is required and this functionality can be achieved with the help of the Internet gateway. For the support of reliability and flexibility, multiple Internet gateways can be provisioned for a MANET. In this case, load-balancing becomes one of the important issues since the network performance such as the network throughput can be improved if the loads of the gateways are well-balanced. In this paper, we categorize the load-balancing mechanisms and propose a new metric for load-balancing. Simulation results show that our proposed mechanism using the hop distance and the number of routing table entries as a load-balancing metric enhances the overall network throughput.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.11
• /
• pp.549-560
• /
• 2001

Cluster system provides attractive scalability in terms of compution power and memory size. With the advances in high speed computer network technology, cluster systems are becoming increasingly competitive compared to expensive MPPs (massively parallel processors). Load balancing is very important issue since an inappropriate scheduling of tasks cannot exploit the true potential of the system and can offset the gain from parallelization. In parallel processing program, it is difficult to predict the load of each task before running the program. Furthermore, tasks are interdependent each other in many ways. The dynamic load balancing algorithm, which evaluates each processor's load in runtime, partitions each task into the appropriate granularity and assigns them to processors in proportion to their performance in cluster systems. However, if the communication cost between processing nodes is expensive, it is not efficient for all nodes to attend load balancing process. In this paper, we restrict a processor that attend load balancing by the communication cost and the deviation of its load from the average. We simulate various models of the cluster system with parameters such as communication cost, node number, and range of workload value to compare existing load balancing methods with the proposed dynamic algorithms.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.5
• /
• pp.45-52
• /
• 2008

In this paper, we propose an efficient dynamic workload balancing strategy which improves the performance of high-Performance computing system. The key idea of this dynamic workload balancing strategy is to minimize execution time of each job and to maximize the system throughput by effectively using system resource such as CPU, memory. Also, this strategy dynamically allocates job by considering demanded memory size of executing job and workload status of each node. If an overload node occurs due to allocated job, the proposed scheme migrates job, executing in overload nodes, to another free nodes and reduces the waiting time and execution time of job by balancing workload of each node. Through simulation, we show that the proposed dynamic workload balancing strategy based on CPU, memory improves the performance of high-performance computing system compared to previous strategies.

• Journal of Digital Contents Society
• /
• v.18 no.5
• /
• pp.983-987
• /
• 2017

Multi-homing mobile router separates network for user connection and network for internet access using various interfaces for internet access. This paper proposes a load balancing metric in order that multi-network mobile router distributes its traffic to one of several heterogeneous network interfaces. To evaluate the performance of the load balancing metric, experiments on traffic balancing is performed on real commercial networks were used in Korea and Hong Kong.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.165-171
• /
• 2005

In this paper, the centralized dynamic load-balancing was processed effectively by using the network based parallel genetic algorithm. Unlike the existing method using genetic algorithm, the performance of central scheduler was improved by distributing the process for the searching of the optimal task assignment to clients. A roulette wheel selection and an elite preservation strategy were used as selection operation to improve the convergence speed of optimal solution. A chromosome was encoded by using sliding window method. And a cyclic crossover was used as crossover operation. By the result of simulation for the performance estimation of central scheduler according to the change of flexibility of load-balancing method, it was verified that the performance is improved in the proposed method.