• ETRI Journal
• /
• v.45 no.3
• /
• pp.433-447
• /
• 2023

Critical issues such as connection congestion, long transmission delay, and packet loss become even worse during epidemic, disaster, and so on. In this study, a link load balancing method is proposed to address these issues on the data plane, a plane of the software-defined network (SDN) architecture. These problems are NP-complete, so a meta-heuristic approach, discrete particle swarm optimization, is used with a novel hybrid cost function. The superiority of the proposed method over existing methods in the literature is that it provides link and switch load balancing simultaneously. The goal is to choose a path that minimizes the connection load between the source and destination in multipath SDNs. Furthermore, the proposed work is dynamic, so selected paths are regularly updated. Simulation results prove that with the proposed method, streams reach the target with minimum time, no loss, low power consumption, and low memory usage.

• 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 KIPS Transactions:PartC
• /
• v.13C no.6 s.109
• /
• pp.757-766
• /
• 2006

Mobile Ad-hoc Network(MANET) is an autonomous network consisted of mobile hosts. A considerable number of studies have been conducted on the MANET with studies of ubiquitous computing. Several studies have been made on the clustering schemes which manage network hierarchically to Improve flat architecture of MANET. But the conventional schemes have the lack of multi-hop clustering and load balancing. This paper proposes a clustering scheme to support multi-hop clustering and to consider load balancing between cluster heads. We define the split of clusters and states of cluster, and propose join, merge, divide, and election of cluster head schemes for load balancing of between cluster heads

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1685-1688
• /
• 2002

Application Routing Load Balancing (ARLB) is a novel load balancing mode that combines QoS routing and load balancing in per application to support QoS far real-time application based on wired network. Zone Routing Protocol (ZRP) is a recent hybrid proactive/reactive routing approach in an attempt to achieve scalability of ad-hoc network. This routing approach has the potential to be efficient in the generation of control traffic than traditional routing schemes. Up to now, without proper load balancing tools, the ZRP can actually guarantee QoS for delay-sensitive applications when congestion occurred in ad-hoc network. In this paper, we propose the ARLB to improve QoS fur delay-sensitive applications based on ZRP in ad-hoc network when congestion occurred and to be forwarding mechanism fur route coupling to support QoS for real-time applications. The critical point is that the routing metric of ARLB is originally designed for wired network environment. Therefore, we study and present an appropriate metric or cost computation routing of ARLB for recently proposed ZRP over ad-hoc network environment.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.12
• /
• pp.3456-3468
• /
• 1999

Most of previous parallel join algorithms assume a database partition system(DPS), where each database partition is owned by a single processing node. While the DPS is novel in the sense that it can interconnect a large number of nodes and support a geographically distributed environment, it may suffer from poor facility for load balancing and system availability compared to the database sharing system(DSS). In this paper, we propose a dynamic load balancing strategy by exploiting the characteristics of the DSS, and then extend the conventional hash join algorithms to the DSS by using the dynamic load balancing strategy. With simulation studies under a wide variety of system configurations and database workloads, we analyze the effects of the dynamic load balancing strategy and differences in the performances of hash join algorithms in the DSS.

• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.5
• /
• pp.97-104
• /
• 2010

In this paper, mesh network structure is applied to solve the load balancing problems in the Grid database. Data of the Grid database is replicated to several node for enhanced performance. Therefore, load balancing for user's query is selected node that evaluated workload in it. Existing researches are using passive load balancing method that selected another node after then node overflowed workload. It is inefficient to be applied to Gird database that has a number of node and user's queries almost changes dynamically. The proposed method connected each node which includes the same data through mesh network structure. When user's query occurs, it select node that has the lowest workload. The performance evaluation shows that proposed method performs better than the existing methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1618-1637
• /
• 2014

Clustering wireless sensor network is an efficient way to reduce the energy consumption of individual nodes in a cluster. In clustering, multihop routing techniques increase the load of the Cluster head near the sink. This unbalanced load on the Cluster head increases its energy consumption, thereby Cluster heads die faster and create an energy hole problem. In this paper, we propose an Energy Balancing Cluster Head (EBCH) in wireless sensor network. At First, we balance the intra cluster load among the cluster heads, which results in nonuniform distribution of nodes over an unequal cluster size. The load received by the Cluster head in the cluster distributes their traffic towards direct and multihop transmission based on the load distribution ratio. Also, we balance the energy consumption among the cluster heads to design an optimum load distribution ratio. Simulation result shows that this approach guarantees to increase the network lifetime, thereby balancing cluster head energy.

• Korean Journal of Computational Design and Engineering
• /
• v.22 no.1
• /
• pp.1-9
• /
• 2017

This research develops dispatching rule for a wafer FABs with dedication constraints. Dedication, mostly considered in a photolithography step, is a feature in a modern FABs in order to increase the yield of machines and achieve the advance of manufacturing technology. However, the dedication has the critical problem because it causes dedication load of machines to unbalance. In this paper, we proposes the dedication load based dispatching rule for load balancing in order to resolve the problem. The objective of this paper is to balance dedication load of photo machines in wafer FABs with dedication constraint. Simulation experiments show that the proposed rule improves the performance of wafer FABs as well as load balance for dedication machines compared to open-loop control based conventional dispatching rule.

• ETRI Journal
• /
• v.27 no.1
• /
• pp.110-113
• /
• 2005

The resilient packet ring (RPR) is a data optimized ring network, where one of the key issues is on load balancing for competing streams of elastic traffic. This paper suggests three efficient traffic loading algorithms on the RPR. For the algorithms, we evaluate their efficiency via analysis or simulation.

• 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과 지연, 패킷 전송률 등을 비교하여 평가하였다.