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

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

• Journal of Korea Multimedia Society
• /
• v.18 no.5
• /
• pp.620-630
• /
• 2015

This research suggests a load balancing method for a volume rendering system which supports concurrent users. When concurrent users use a volume rendering server system, the computational resources are occupied by a particular user by turns because each process consumes the computational resources as much as possible. In this case, the previous method shows acceptable throughput but the latency is increased for each user. In this research, we suggest a method to improve the latency without performance degradation. Each process makes concessions for taking the resources according to the number of users connected to the system. And we propose a load balancing method in the dynamic situation in which the number of users can vary. Using our methods, we can improve the latency time for each user.

• Journal of Industrial Technology
• /
• v.28 no.A
• /
• pp.105-111
• /
• 2008

A typical AP (Access Point) selection policy is to select an AP based on the received signal strength indicator (RSSI), ignoring its load. If multiple stations are deployed densely at a particular area, a typical AP selection policy will bring about the overall network throughput degradation. This paper proposes a novel AP selection policy taking into consideration not only signal strength of the APs but also AP loads to avoid Hotspot congestion. An experiment on Alinker implementing proposed AP selection policy, demonstrates that the proposed policy achieves close to optimal load balancing and grants the maximum transmission rate to stations in comparison with SSF (Strongest-Signal-First) and LLF (Least-Loaded-First).

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.6
• /
• pp.1083-1088
• /
• 2001

In this paper, we propose a new CBT(core-based tree)multicast routing Mechanism by load balancing mechanism. CBT may result in traffic concentration and bottlenecks near the core routers since traffic from all sources nodes the same set of links as approaches the core. So the router have to load packet to new core router for such congestion. Congestion information is given by rtt(round trip time) between designed core router and the other router.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.13 no.4
• /
• pp.153-162
• /
• 2017

Advances in communication technologies and the decreasing cost of computers have made distributed computer systems an attractive alternative for satisfying the information needs of large organizations. This paper presents a distributed algorithm for performance improvement through load balancing and file migration in distributed systems. We employed a sender initiated strategy for task migration and used learning automata with several internal states for file migration. A task can be migrated according to the load information of a computer. A file is migrated to the destination processor when it is in the right boundary state. We also described an analytical model for load balancing with file migration to verify the proposed algorithm. Analytical and simulation results show that our algorithm is very well-suited for distributed system environments.

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.2
• /
• pp.303-311
• /
• 1996

The Self Healing Ring (SHR) is one of the most Intriguing schemes which provide survivability for telecommunication networks. To design a cost effective SONET ring it is necessary to consider load balancing problems by which the link capacity is determined. The load balancing problem in SONET ring when demand splitting is not allowed is considered in this paper. An efficient algorithm is presented which provides the best solution starting from various Initial solutions. The initial solution is obtained by routing ell demands such that no demands pass through an are In the ring. The proposed algorithm iteratively improves the Initial solution by examining each demand and selecting the maximum load are in its path. The demand whose maximum arc load is biggest is selected to be routed in opposite direction. Computational results show that the proposed algorithm is excellent both in the solution quality and in the computational time requirement. The average error bound of the algorithm is 0.11% of the optimum and compared to dual-ascent approach which has good computational results than other heuristics.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.12
• /
• pp.5694-5711
• /
• 2017

The technology of cloud computing is growing very quickly, thus it is required to manage the process of resource allocation. In this paper, load balancing algorithm based on honey bee behavior (LBA_HB) is proposed. Its main goal is distribute workload of multiple network links in the way that avoid underutilization and over utilization of the resources. This can be achieved by allocating the incoming task to a virtual machine (VM) which meets two conditions; number of tasks currently processing by this VM is less than number of tasks currently processing by other VMs and the deviation of this VM processing time from average processing time of all VMs is less than a threshold value. The proposed algorithm is compared with different scheduling algorithms; honey bee, ant colony, modified throttled and round robin algorithms. The results of experiments show the efficiency of the proposed algorithm in terms of execution time, response time, makespan, standard deviation of load, and degree of imbalance.

• 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 Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.154-157
• /
• 2001

In this paper, we propose a new CBT(core-based tree)multicast routing Mechanism by load balancing mechanism. CBT may result in traffice concentration and bottlenecks near the lore routers since traffice from all sources nodes the same set of links as approaches the core. So the router have to load packet to new core router for such congestion. Congestion information is given by rtt(round trip time) between designed core router and the other router.

• Proceedings of the KIEE Conference
• /
• 1999.07a
• /
• pp.21-23
• /
• 1999

The alternative precise method for voltage balancing and load compensation using the susceptances control of a STATCOM is discussed. With the control of STATCOM's output current, it is confirmed that the compensation susceptances can be variable. And then the STATCOM's control method about compensation susceptances for load compensation and voltage balancing/regulation is derived. Finally, the effectiveness of load compensation and voltage balancing/regulation is confirmed through computer simulation.