• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5B
• /
• pp.295-303
• /
• 2005

Recently, according to the rapid increase of Web users, various kinds of Web applications have been being developed. Hence, Web QoS(Quality of Service) becomes a critical issue in the Web services, such as e-commerce, Web hosting, etc. Nevertheless, most Web servers currently process various requests from Web users on a FIFO basis, which can not provide differentiated QoS. This paper presents a load balancing method to provide differentiated Web QoS in clustering web server. The first is the kernel-level approach, which is adding a real-time scheduling process to the operating system kernel to maintain the priority of user requests determined by the scheduling process of Web server. The second is the load-balancing approach, which uses IP-level masquerading and tunneling technology to improve reliability and response speed upon user requests. The third is the dynamic load-balancing approach, which uses the parameters related to the MIB-II of SNMP and the parameters related to load of the system such as memory and CPU.

• 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 Korea Game Society
• /
• v.12 no.3
• /
• pp.69-76
• /
• 2012

At MMORPGs that has the numerous game users with many interactions at the same virtual world, massive loading that results in delays, resource shortages, and other such problems occur. To solve this, many developers devote research to load-balancing servers, yet due to steady and dynamic map divisions, such research is unreliable. This paper proposes a game user-oriented load balancing scheme for the load balancing of MMORPG servers. This scheme shows effectiveness at dealing with hot-spots and other gatherings of game users at specific servers compared to previous methods.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.768-776
• /
• 1995

In a distributed computer system with star topology, the processing power of central node may be greater than that of peripheral nodes and the job arrival rate of each node may be different. The performance of load balancing may be very different according to the selection of sender criteria and receiver criteria for job transfer. But the optimal decision of sender and receiver criteria is very difficult in heterogeneous distributed computer systems. In this paper we propose effective destination decision policies using dynamic criteria such as mean job response time of a node and estimated response time of a job, instead of fixed threshold for dynamic load balancing.

• Convergence Security Journal
• /
• v.6 no.1
• /
• pp.13-23
• /
• 2006

It is more desirable to execute AV software on server systems rather than on clients for the minimization of damages due to malicious codes. AV software on server system, however, may aggravate the load of server system. In this paper, we propose a new AV software executed on server system without additional loads with a monitor and multi-agent model. The new AV software supports dynamic load balancing that reflects the features of AV engine, and thus it can be executed efficiently on server systems. The results of performance evaluation on the AV software attest to the strong points of the new AV software.

• 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 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.5A
• /
• pp.348-357
• /
• 2012

Recently, smartphone, notebook, PC and other supporting wireless LAN device have come into wide use. By increasing user that use wireless LAN device, wireless traffic also increased. If wireless traffic through one AP is increase, it causes throughput decrease. To solve this problem, wireless LAN service provider install more AP where overload occurred. But this is not enough. Because stations can't know AP's load factor, and APs do nothing for load balancing. In this paper, we propose Multi-Interface Access Point(MIAP) to solve this problem. MIAP operate same as multiple APs with multi-interface, and MIAP measure each interface's load periodically. If MIAP detect overloaded interface, MIAP transfer station from overloaded interface to under-loaded interface. We conducted an experiment for verifying existing problem, and we found this problem occurred. We plan an experiment scenario for a comparison between existing AP and MIAP, and excute these experiment. In the result, we show MIAP with load balancing can improve total throughput about 72% and stabilize delay jitter than existing AP.

• KIISE Transactions on Computing Practices
• /
• v.23 no.10
• /
• pp.605-610
• /
• 2017

In distributed environments, dynamic partitioning is needed to resolve the load on a particular server or the load caused by communication among servers. In heterogeneous environments, existing dynamic partitioning schemes can distribute the same load to a server with a low physical performance, which results in a delayed query response time. In this paper, we propose a dynamic partitioning scheme for large RDF data in heterogeneous environments. The proposed scheme calculates the query loads with its frequency and the number of vertices used in the query for load balancing. In addition, we calculate the server loads by considering the physical performance of the servers to allocate less of a load to the servers with a smaller physical performance in a heterogeneous environment. We perform dynamic partitioning to minimize the number of edge-cuts to reduce the traffic among servers. To show the superiority of the proposed scheme, we compare it with an existing dynamic partitioning scheme through a performance evaluation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4103-4121
• /
• 2018

Quality of Service (QoS) awareness is recognized as a key point for the success of Internet of Things (IOT).Realizing the full potential of the Internet of Things requires, a real-time task scheduling algorithm must be designed to meet the QoS need. In order to schedule tasks with diverse QoS requirements in cloud environment efficiently, we propose a task scheduling strategy based on dynamic priority and load balancing (DPLB) in this paper. The dynamic priority consisted of task value density and the urgency of the task execution, the priority is increased over time to insure that each task can be implemented in time. The scheduling decision variable is composed of time attractiveness considered earliest completion time (ECT) and load brightness considered load status information which by obtain from each virtual machine by topic-based publish/subscribe mechanism. Then sorting tasks by priority and first schedule the task with highest priority to the virtual machine in feasible VMs group which satisfy the QoS requirements of task with maximal. Finally, after this patch tasks are scheduled over, the task migration manager will start work to reduce the load balancing degree.The experimental results show that, compared with the Min-Min, Max-Min, WRR, GAs, and HBB-LB algorithm, the DPLB is more effective, it reduces the Makespan, balances the load of VMs, augments the success completed ratio of tasks before deadline and raises the profit of cloud service per second.