• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4207-4222
• /
• 2016

In a P2P (Peer-to-Peer) VoD (video-on-Demand) streaming system, the nodes' load is an important factor which affects the system performance. In the system, some nodes may receive too many requests, which leads to overload. On the other hand, some other nodes may receive too few requests, which leads to low utilization. Therefore, designing a reasonable load balancing strategy is important. However, existing related studies cannot handle this problem effectively, because they don't have an efficient dynamic load information management mechanism, and they don't distinguish the difference of requests when transfer the nodes' load. In this paper, to manage the dynamic load information efficiently, we design a load management table for each node. Based on the load information, we propose a load balancing strategy which uses a request migration algorithm (LBRM). Through simulations, our scheme can handle the load imbalance problem effectively and improve the users' playback fluency.

• Journal of Information Processing Systems
• /
• v.7 no.1
• /
• pp.53-62
• /
• 2011

With the steady growth of mobile technology and applications, demand for more storage in mobile devices has also increased. A lightweight block-level protocol, Internet Advanced Technology Attachment (iATA), has been developed to deliver a cost-effective storage network solution for mobile devices to obtain more storage. This paper seeks to contribute to designing and implementing Load Balancing (LB), Network Monitoring (NM) and Write Replication (WR) modules to improve the protocol's scalability and data availability. LB and NM modules are invoked to collect system resources states and current network status at each associate node (server machine). A dynamic weight factor is calculated based on the collected information and sent to a referral server. The referral server is responsible to analyze and allocate the most ideal node with the least weight to serve the client. With this approach, the client can avoid connecting to a heavily loaded node that may cause delays in subsequent in-band I/O operations. Write replication is applied to the remaining nodes through a WR module by utilizing the Unison file synchronization program. A client initially connected to node IP A for write operations will have no hindrances in executing the relevant read operations at node IP B in new connections. In the worst case scenario of a node crashing, data remain recoverable from other functioning nodes. We have conducted several benchmark tests and our results are evaluated and verified in a later section.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.22 no.3
• /
• pp.256-262
• /
• 2017

This paper presents the control algorithm of a single-phase AC/DC/AC PWM converter for the linear compressor of a refrigerator. The AC/DC/AC converter consists of a full-bridge PWM converter for the control of the input power factor and a half-bridge PWM inverter for the control of the single-phase linear compressor. At the DC-link of this topology, two capacitors are connected in series. These DC-link voltages must be balanced for safe operation. Thus, a new control method of DC voltage balancing for the half-bridge PWM inverter is proposed. The balancing algorithm uses the Integral-Proportional controller and inserts the DC-offset current at the Proportional-Resonant current controller of the inverter to solve the DC-link unbalanced voltages between the two capacitors. The proposed algorithm can be easily implemented without much computation and additional hardware circuit. The usefulness of the proposed algorithm is verified through several experiments.

• ETRI Journal
• /
• v.39 no.3
• /
• pp.301-309
• /
• 2017

In this paper, we propose a parallelization method for a High Efficiency Video Coding (HEVC) deblocking filter with transform unit (TU) split information. HEVC employs a deblocking filter to boost perceptual quality and coding efficiency. The deblocking filter was designed for data-level parallelism. In this paper, we demonstrate a method of distributing equal workloads to all cores or threads by anticipating the deblocking filter complexity based on the coding unit depth and TU split information. We determined that the average time saving of our proposed deblocking filter parallelization method has a speed-up factor that is 2% better than that of the uniformly distributed parallel deblocking filter, and 6% better than that of coding tree unit row distribution parallelism. In addition, we determined that the speed-up factor of our proposed deblocking filter parallelization method, in terms of percentage run-time, is up to 3.1 compared to the run-time of the HEVC test model 12.0 deblocking filter with a sequential implementation.

• Proceedings of the KIEE Conference
• /
• 1998.07a
• /
• pp.193-195
• /
• 1998

In this paper, condition of aluminum die cast and rotor balancing were considered to develope a low vibrational induction motor which is called V3 class. Condition of die cast is more important factor than rotor balancing to reduce motor vibration in low vibrational region.

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

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.4
• /
• pp.515-521
• /
• 2020

Recently, data traffic has exploded due to development of various industries, which causes problems about losing of efficiency and overloaded existing networks. To solve these problems, network slicing, which uses a virtualization technology and provides a network optimized for various services, has received a lot of attention. In this paper, we propose a resource allocation method using credit value. In the method using the clustering technology, an operation for selecting a cluster is performed whenever an allocation request for various services occurs. On the other hand, in the proposed method, the credit value is set by using the residual capacity and balancing so that the slice request can be processed without performing the operation required for cluster selection. To prove proposed method, we perform processing time and balancing simulation. As a result, the processing time and the error factor of the proposed method are reduced by about 13.72% and about 7.96% compared with the clustering method.

• Journal of the Korea Society for Simulation
• /
• v.16 no.1
• /
• pp.1-9
• /
• 2007

The development of efficient Qualify of Service (QoS) routing algorithms in high speed networks is extremely difficult to achieve, because in order to operate, divergent services require various quality conditions. If the parameter of concern is to measure the delay on a specific link, the routing algorithm obtains the Least Delay (LD) path. Meanwhile, if the parameter is to measure the link cost, the Least Cost (LC) path is calculated. The Delay Constrained Least Cost (DCLC) path problem of the mixed issues on the LD and LC has been shown to be NP-hard. The path cost of LD path is relatively more expensive than that of the LC path, and the path delay of the LC path is relatively higher than that of the LD path in the DCLC problem. In this paper, we introduce the new factor for balancing cost and delay. The simulation result shows that our introduced factor is satisfied to solve the DCLC problem.

• ETRI Journal
• /
• v.40 no.5
• /
• pp.604-612
• /
• 2018

To solve the problem of unbalanced loads and the short network lifetime of heterogeneous wireless sensor networks, this paper proposes a node-selection algorithm based on energy balance and dynamic adjustment. The spacing and energy of the nodes are calculated according to the proximity to the network nodes and the characteristics of the link structure. The direction factor and the energy-adjustment factor are introduced to optimize the node-selection probability in order to realize the dynamic selection of network nodes. On this basis, the target path is selected by the relevance of the nodes, and nodes with insufficient energy values are excluded in real time by the establishment of the node-selection mechanism, which guarantees the normal operation of the network and a balanced energy consumption. Simulation results show that this algorithm can effectively extend the network lifetime, and it has better stability, higher accuracy, and an enhanced data-receiving rate in sufficient time.

• 제어로봇시스템학회:학술대회논문집
• /
• 1987.10b
• /
• pp.300-306
• /
• 1987

This paper deals with a modeling of manufacturing system and a model analysis by a SIMAN language. A flow of production process is analyzed, and a mathematical model on the basis of the analyzed data is simulated by a SIMAN language. An object of this study is to achieve an optimization of production a reduction of cost, and an improvement of quality by a applicable line-balancing technique and an optimization technique in a real factor induced an analysis and synthesis of the result of simulation.