• Title, Summary, Keyword: Load Balancing

Search Result 831, Processing Time 0.07 seconds

Soft Load Balancing Using the Load Sharing Over Heterogeneous Wireless Networks (이기종 무선 환경에서 Load sharing을 이용한 Soft Load Balancing 기술)

  • Son, Hyuk-Min;Lee, Sang-Hoon;Kim, Soo-Chang;Shin, Yeon-Seung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.7A
    • /
    • pp.757-767
    • /
    • 2008
  • Start Ongoing next generation networks are expected to be deployed over current existing networks, in the form of overlayed heterogeneous networks, in particular, in hot spot areas. Therefore, it will be necessary to develop an interworking technique such as load balancing, to achieve increased overall resource utilization in the various heterogeneous networks. In this paper, we present a new load balancing mechanism termed 'soft' load balancing where the IP(Internet Protocol) traffic of a user is divided into sub-traffic, each of which flows into a different access network. The terminology of soft load balancing involves the use of both load sharing and handover techniques. Through a numerical analysis, we obtain an optimal LBR (Load Balancing Ratio) for determining the volume of traffic delivered to each network over an overlayed multi-cell environment. Using the optimal LBR, a more reliable channel transmission can be achieved by reducing the outage probability efficiently for a given user traffic.

Load Balancing Policy in Clustered Web Server Using IP Filtering (IP 필터링 방식을 사용하는 클러스터드 웹서버의 부하 분산 정책)

  • 김재천;최상방
    • Proceedings of the IEEK Conference
    • /
    • /
    • 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.

  • PDF

GA-based Adaptive Load Balancing Method in Distributed Systems

  • Lee, Seong-Hoon;Lee, Sang-Gu
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.2 no.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.

End-to-end Reliable Message Transmission Considering Load Balancing in Wireless Networks

  • Tran, Anh Tai;Kim, Myung Kyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.9
    • /
    • pp.3094-3109
    • /
    • 2014
  • This paper proposes a load balanced reliable routing protocol called LBR (Load Balanced Reliable routing) in wireless networks. The LBR protocol transmits messages through a reliable path considering the balancing of the traffic load. Recently, the authors have proposed a multipath-based reliable routing protocol called MRFR, which is an appealing protocol for fault tolerant reliable data transmission. However, However, MRFR has no concern with the problem of load balancing, which results in increasing congestion and consuming high energy at some network nodes. As a result, the problem affects negatively the performance of the network. Taking account of load balancing as a route selection criteria can avoid routing through the congested nodes and allows to find better routes. In this paper, we extend MRFR by considering load balancing in the route discovery process of reliable communication. The simulation results showed that the proposed protocol outperforms AODV in terms of end-to-end delay, packet delivery radio, and average jitter. Compared to MRFR, the LBR protocol has the same packet delivery ratio, and obtains a better efficiency of load balancing.

Load Balancing Strategies for Network-based Cluster System

  • Jung, Hoon-Jin;Choung Shik park;Park, Sang-Bang
    • Proceedings of the IEEK Conference
    • /
    • /
    • 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.

  • PDF

Modeling and Simulation of Efficient Load Balancing Algorithm on Distributed OCSP (분산 OCSP에서의 효율적인 로드 밸런싱 기법에 관한 모델링 및 시뮬레이션)

  • Choi Ji-Hye;Cho Tae Ho
    • Journal of the Korea Society for Simulation
    • /
    • v.13 no.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.

  • PDF

The Load Balancing Destage Algorithm of RAID5 Controller using Reference History (참조 정보를 이용한 RAID5 제어기의 부하 균형 반출 기법)

  • Jang, Yun-Seok;Kim, Bo-Yeon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.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.

  • PDF

An adaptive load balancing method for RFID middlewares based on the Standard Architecture (RFID 미들웨어 표준 아키텍처에 기반한 적응적 부하 분산 방법)

  • Park, Jae-Geol;Chae, Heung-Seok
    • The KIPS Transactions:PartD
    • /
    • v.15D no.1
    • /
    • pp.73-86
    • /
    • 2008
  • Because of its capability of automatic identification of objects, RFID(Radio Frequency Identification) technologies have extended their application areas to logistics, healthcare, and food management system. Load balancing is a basic technique for improving scalability of systems by moving loads of overloaded middlewares to under loaded ones. Adaptive load balancing has been known to be effective for distributed systems of a large load variance under unpredictable situations. There are needs for applying load balancing to RFID middlewares because they must efficiently treat vast numbers of RFID tags which are collected from multiple RFID readers. Because there can be a large amount of variance in loads of RFID middlewares which are difficult to predict, it is desirable to consider adaptive load balancing approach for RFID middlewares, which can dynamically choose a proper load balancing strategy depending on the current load. This paper proposes an adaptive load balancing approach for RFID middlewares and presents its design and implementation. First we decide a performance model by a experiment with a real RFID middleware. Then, a set of proper load balancing strategies for high/medium/low system loads is determined from a simulation of various load balancing strategies based on the performance model.

Modeling and Analysis of Load-Balancing Based on Base-Station CoMP with Guaranteed QoS

  • Feng, Lei;Li, WenJing;Yin, Mengjun;Qiu, Xuesong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.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.

Bio-inspired Load Balancing Routing for Delay-Guaranteed Services in Ever-Changing Networks

  • Kim, Young-Min;Kim, Hak Suh;Jung, Boo-Geum;Park, Hea-Sook;Park, Hong-Shik
    • ETRI Journal
    • /
    • v.35 no.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.