• 한국통신학회논문지
• /
• 제33권7A호
• /
• pp.757-767
• /
• 2008

차세대 이동 통신망의 발전으로 상용 망과 이 기종 망이 서로 겹쳐진 다중 망 구조가 형성될 것이다. 이러한 여러 망이 겹쳐진 다중 망 구조에서 전체 무선자원의 사용 효율을 높이고 Eb/Io (bit energy-to-interference plus noise density ratio)를 개선하기 위해 이기종망간 혹은 동종망간 상호 연동 기술이 필요하다. 본 논문에서는 이러한 동종망과 이기종망들이 서로 겹쳐져 있는 다중 셀 환경에서 load를 효율적으로 분산시킴으로써 무선 자원의 효율을 높이고 신호의 간섭양을 줄여 사용자의 QoS 보장 및 성능 개선을 위한 soft load balancing algorithm을 제안 및 분석한다. 본 논문에서는 수학적 분석을 통해 효율적인 load sharing을 위한 최적의 LBR (load balancing ratio) 을 구하고 이를 이용하여 각 network에 traffic 양을 할당하여 서비스한다. 그러므로 soft load balancing 알고리듬은 보다 안정적인 데이터 전송을 가능하게 한다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 하계종합학술대회 논문집(3)
• /
• pp.105-108
• /
• 2000

As Internet and WWW grow rapidly, the role of web servers is getting more important, and the number of users in a few popular site is also explosively increasing. Load balancing in clustered web server systems is important task to utilize whole system effectively, so dynamic load balancing is required to overcome the limit of static load balancing. In this paper, we propose two dynamic load balancing schemes, and analyzed load model and Performance improvement and also compare existing load balancing methods and IP filtering method. In case of load balancing with threshold, little extra traffic was required for better performance, but in case of load balancing with load weight, we found that the performance mainly depends on information exchange rate.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제2권1호
• /
• pp.59-64
• /
• 2002

In the sender-initiated load balancing algorithms, the sender continues to send an unnecessary request message fur load transfer until a receiver is found while the system load is heavy. Meanwhile, in the receiver-initiated load balancing algorithms, the receiver continues to send an unnecessary request message for load acquisition until a sender is found while the system load is light. These unnecessary request messages result in inefficient communications, low CPU utilization, and low system throughput in distributed systems. To solve these problems, in this paper, we propose a genetic algorithm based approach fur improved sender-initiated and receiver-initiated load balancing. The proposed algorithm is used for new adaptive load balancing approach. Compared with the conventional sender-initiated and receiver-initiated load balancing algorithms, the proposed algorithm decreases the response time and increases the acceptance rate.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -1
• /
• pp.314-317
• /
• 2000

Cluster system provides attractive scalability in terms of computation power and memory size. With the advances in high speed computer network technology, cluster systems are becoming increasingly competitive compared to expensive parallel machines. In parallel processing program, each task load is difficult to predict before running the program and each task is interdependent each other in many ways. Load imbalancing induces an obstacle to system performance. Most of researches in load balancing were concerned with distributed system but researches in cluster system are few. In cluster system, the dynamic load balancing algorithm which evaluates each processor's load in runtime is purpose that the load of each node are evenly distributed. But, if communication cost or node complexity becomes high, it is not effective method for all nodes to attend load balancing process. In that circumstances, it is good to reduce the number of node which attend to load balancing process. We have modeled cluster systems and proposed marginal dynamic load balancing algorithms suitable for that circumstances.

• 한국시뮬레이션학회논문지
• /
• 제13권4호
• /
• pp.43-53
• /
• 2004

The distributed OCSP (Online Certificate Status Protocol), composed of multiple responders, is a model that enhances the utilization of each responder and reduces the response time. In a multi-user distributed environment, load balancing mechanism must be developed for the improvement of the performance of the whole system. Conservative load balancing algorithms often ignore the communication cost of gathering the information of responders. As the number of request is increased, however, fail to consider the communication cost may cause serious problems since the communication time is too large to disregard. We propose an adaptive load balancing algorithm and evaluate the effectiveness by performing modeling and simulation. The principal advantage of new algorithm is in their simplicity: there is no need to maintain and process system state information. We evaluated the quality of load balancing achieved by the new algorithm by comparing the queue size of responders and analyzing the utilization of these responders. The simulation results show how efficiently load balancing is done with the new algorithm.

• Journal of Information Processing Systems
• /
• 제19권5호
• /
• pp.702-712
• /
• 2023

Load balancing plays a crucial role in ensuring the stable operation of information management systems during periods of high user access requests; therefore, load balancing approaches should be reasonably selected. Moreover, appropriate load balancing techniques could also result in an appropriate allocation of system resources, improved system service, and economic benefits. Nginx is one of the most widely used loadbalancing software packages, and its deployment is representative of load-balancing application research. This study introduces Nginx into an educational administration system, builds a server cluster, and compares and sets the optimal cluster working strategy based on the characteristics of the system, Furthermore, it increases the stability of the system when user access is highly concurrent and uses the Nginx reverse proxy service function to improve the cluster's ability to resist illegal attacks. Finally, through concurrent access verification, the system cluster construction becomes stable and reliable, which significantly improves the performance of the information system service. This research could inform the selection and application of load-balancing software in information system services.

• 한국정보처리학회논문지
• /
• 제7권3호
• /
• pp.776-787
• /
• 2000

Write requests which stored in disk cache of the RAID5 controller should be destaged to disk arrays according to the destage algorithm. As the response performance of the parallel IO request is being hit by the effect of the destage, several destage algorithms have been studied to enhance the performance of he RAID5 controller. Among the destage algorithms, the load balancing destage algorithm has better performance than other destage algorithms when system load is highly increased. But the load balancing destage algorithm gives priority to load balance among the disks in disk arrays, therefore, when some disks are affected by the very heavy system load caused by small data requests, the load balancing destage algorithm cannot enhance the performance of parallel IO requests effectively since it makes effort to maintain the load balance without the benefit of the locality of the write requests. This paper proposes a new RAID5 controller that applied reference-load balancing destage algorithm which decides the destage priority based on the reference history and load distribution of the disks. The simulation results show that RAID5 controller with the reference-load balancing destage algorithm has better performance than previous load balancing destage algorithm.

• 정보처리학회논문지D
• /
• 제15D권1호
• /
• pp.73-86
• /
• 2008

최근 RFID(Radio Frequency Identification) 기술은 사물에 대한 자동적인 인식을 가능케 함으로써 물류, 의료, 식품관리 등과 같은 분야에 적용되고 있다. 부하 분산은 과부하 상태인 노드로부터 부하가 적은 노드로 작업 부하를 이동시켜 시스템의 확장성을 향상시키는 기본 기술이다. 시스템의 부하를 예측하기 어렵고 부하량의 편차가 큰 경우에는 적응적 부하 분산이 효과적인 것으로 알려져 있다. RFID 미들웨어는 많은 수의 리더로부터 수신된 태그 정보를 효율적으로 처리하기 위하여 기존의 부하 분산기술이 도입될 필요가 있다. RFID 시스템이 부하량을 예측하기 힘들고 편차가 큰 환경에 적용될 경우 실행시간에 시스템의 전체 부하량에 따라 적합한 정책으로 변경할 수 있는 적응적 부하 분산 기법을 사용하는 것이 바람직하다. 본 논문에서는 RFID 미들웨어에 적응적 부하 분산 기법을 도입하기 위한 접근 방법과 결과를 제시한다. 먼저 RFID 미들웨어의 작업 부하 모델을 결정한다. 그리고 부하 모델을 바탕으로 다양한 부하 분산 정책을 시스템의 부하 상태 별로 적용하여 시스템의 부하 상태에 적합한 부하 분산 정책을 선택한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권9호
• /
• pp.2982-3003
• /
• 2014

With the explosive deployment of the wireless communications technology, the increased QoS requirement has sparked keen interest in network planning and optimization. As the major players in wireless network optimization, the BS's resource utilization and mobile user's QoS can be improved a lot by the load-balancing technology. In this paper, we propose a load-balancing strategy that uses Coordinated Multiple Points (CoMP) technology among the Base Stations (BS) to effectively extend network coverage and increase edge users signal quality. To use universally, different patterns of load-balancing based on CoMP are modeled and discussed. We define two QoS metrics to be guaranteed during CoMP load balancing: call blocking rate and efficient throughput. The closed-form expressions for these two QoS metrics are derived. The load-balancing capacity and QoS performances with different CoMP patterns are evaluated and analyzed in low-dense and high-dense traffic system. The numerical results present the reasonable CoMP load balancing pattern choice with guaranteed QoS in each system.

• ETRI Journal
• /
• 제35권3호
• /
• pp.414-424
• /
• 2013

We consider a new load balancing routing for delay-guaranteed services in the network in which the traffic is dynamic and network topologies frequently change. For such an ever-changing network, we propose a new online load balancing routing called AntLBR, which exploits the ant colony optimization method. Generally, to achieve load balancing, researchers have tried to calculate the traffic split ratio by solving a complicated linear programming (LP) problem under the static network environment. In contrast, the proposed AntLBR does not make any attempt to solve this complicated LP problem. So as to achieve load balancing, AntLBR simply forwards incoming flows by referring to the amount of pheromone trails. Simulation results indicate that the AntLBR algorithm achieves a more load-balanced network under the changing network environment than techniques used in previous research while guaranteeing the requirements of delay-guaranteed services.