• Journal of KIISE:Computing Practices and Letters
• /
• v.12 no.2
• /
• pp.111-118
• /
• 2006

In this thesis, we analyze the efficiency of the algorithm to distribute the load in the clustered system, by comparing with the existed algorithm. PWLC algorithm detects each server's load in the system at weighted period, and following the detection of the loads, a set of weights is given to each server. The system allocates new loads to each server according to its weight. PWLC algorithm is compared with DWRR algorithm in terms of variance, waiting time by varying weighted Period. When the weighted period is too short, the system bears a heavy load for detecting load over time. On the other hand, when the weighted period is too long, the load balancing control of the system becomes ineffective. The analysis shows PWLC algorithm is more efficient than DWRR algorithm for the variance and waiting time.

• Proceedings of the KIEE Conference
• /
• 2004.05a
• /
• pp.3-6
• /
• 2004

In this paper, the problem of identifying a time-varying nonlinear system in an adaptive way was considered, whereby the time-varying second-order Volterra series was employed to model the system and the filtered weighted least squares (FWLS) algorithm was utilized for the fast parameter tracking capability with low computational burden. Finally, the performance of the proposed approach was demonstrated by providing some computer simulation results.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.4
• /
• pp.171-176
• /
• 2020

This paper proposes polynomial-time algorithm for maximum weighted independent set(MWIS) problem that is well known as NP-hard. The known algorithms for MWIS problem are polynomial-time to specialized in particular graph type, distributed, or clustering method. But there is no unified algorithm is suitable to all kinds of graph types. Therefore, this paper suggests unique polynomial-time algorithm that is suitable to all kinds of graph types. The proposed algorithm merges the maximum weighted vertex v_i and maximum weighted vertex v_j that is not adjacent to v_i. As a result of apply to undirected graphs and trees, this algorithm can be get the optimal solution. This algorithm improves previously known solution to new optimal solution.

• Journal of IKEEE
• /
• v.26 no.2
• /
• pp.186-195
• /
• 2022

In this paper, we propose a new algorithm to improve the accuracy of indoor positioning techniques using Wi-Fi access points as beacon nodes. The proposed algorithm is based on the Weighted Centroid algorithm, a popular method widely used for indoor positioning, however, it improves some disadvantages of the Weighted Centroid method and also for other kinds of indoor positioning methods, by using the received signal strength correction method and genetic algorithm to prevent the signal strength fluctuation phenomenon, which is caused by the complex propagation environment. To validate the performance of the proposed algorithm, we conducted experiments in a complex indoor environment, and collect a list of Wi-Fi signal strength data from several access points around the standing user location. By utilizing this kind of algorithm, we can obtain a high accuracy positioning system, which can be used in any building environment with an available Wi-Fi access point setup as a beacon node.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.45
• /
• pp.181-191
• /
• 1998

The purpose of this paper is to develop an efficient algorithm for determining the most vital arcs in a weighted network and implement its algorithm on GIS. The most vital arcs in a weighted network of GIS is that arc whose removal from the network results in the greatest increase in shortest distance between two specified nodes. These studies are well applied to a situation where a logistics or communications network is broken by unexpected accidents. Because a user of the system wants to know which arcs are most vital to him so that he can reinforce them against unexpected accidents. We first present an algorithm to find the most vital arcs in a weighted network, then show that how its algorithm can be applied to a geo-spatial network.

• ETRI Journal
• /
• v.24 no.5
• /
• pp.360-372
• /
• 2002

In this paper, we propose the modified dynamic weighted round robin (MDWRR) cell scheduling algorithm, which guarantees the delay property of real-time traffic and also efficiently transmits non-real-time traffic. The proposed scheduling algorithm is a variation of the dynamic weighted round robin (DWRR) algorithm and guarantees the delay property of real-time traffic by adding a cell transmission procedure based on delay priority. It also uses a threshold to prevent the cell loss of non-real-time traffic that is due to the cell transmission procedure based on delay priority. Though the MDWRR scheduling algorithm may be more complex than the conventional DWRR scheme, considering delay priority minimizes cell delay and decreases the required size of the temporary buffer. The results of our performance study show that the proposed scheduling algorithm has better performance than the conventional DWRR scheme because of the delay guarantee of real-time traffic.

• Journal of Advanced Marine Engineering and Technology
• /
• v.33 no.3
• /
• pp.395-402
• /
• 2009

This paper presents the newly developed Pareto-based multi-objective Bees Algorithm with weighted sum technique for solving a power system multi-objective nonlinear optimization problem. Specifically, the Pareto-based Bees Algorithm with memorized zone has been developed to alleviate both difficulties from classical techniques and intelligent techniques for multi-objective problems (MOP) and successfully applied to an Environmental/Economic (electric power) dispatch (EED) problem. This multi-objective Bees Algorithm has been examined and applied to the standard IEEE 30-bus six-generator test system. Simulation results have been compared to those obtained using other approaches. The comparison shows the potential and effectiveness of the proposed Bees Algorithm for solving the multi-objective EED problem.

• Journal of Korea Multimedia Society
• /
• v.7 no.2
• /
• pp.264-271
• /
• 2004

A load-sharing algorithm must deal with load imbalance caused by characteristics of a network and heterogeneity of nodes in Internet-based clustering systems. This paper has proposed the Efficient Load-Sharing algorithm. Efficient-Load-Sharing algorithm creates a scheduler based on the WF(Weighted Factoring) algorithm and then allocates tasks by an adaptive granularity strategy and the refined fixed granularity algorithm for better performance. In this paper, adaptive granularity strategy is that master node allocates tasks of relatively slower node to faster node and refined fixed granularity algorithm is to overlap between the time spent by slave nodes on computation and the time spent for network communication. For the simulation, the matrix multiplication using PVM is performed on the heterogeneous clustering environment which consists of two different networks. Compared to other algorithms such as Send, GSS and Weighted Factoring, the proposed algorithm results in an improvement of performance by 75%, 79% and 17%, respectively.

• The KIPS Transactions:PartA
• /
• v.10A no.3
• /
• pp.215-224
• /
• 2003

Since there are various networks and heterogeneity of nodes in Internet, the existing load-sharing algorithms are hardly adapted for use in Internet-based clustering systems. Therefore, in Internet-based clustering systems, a load-sharing algorithm must consider various conditions such as heterogeneity of nodes, characteristics of a network and imbalance of load, and so on. This paper has proposed an expanded-WF algorithm which is based on a WF (Weighted Factoring) algorithm for load-sharing in Internet-based clustering systems. The proposed algorithm uses an adaptive granularity strategy for load-sharing and duplicate execution of partial job for fault-tolerance. For the simulation, the to matrix multiplication using PVM is performed on the heterogeneous clustering environment which consists of two different networks. Compared to other algorithms such as Send, GSS and Weighted Factoring, the proposed algorithm results in an improvement of performance by 55%, 63% and 20%, respectively. Also, this paper shows that It can process the fault-tolerance.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.1
• /
• pp.196-204
• /
• 2013

In this paper, a scheduling algorithm is proposed for military satellite networks to improve QoS(Quality of Service) based on WDRR(Weighted Deficit Round Robin) method. When the packet size that has been queued to be larger, the proposed scheme DWDRR(Dynamic WDRR) method give appropriate additional quantum using EWMA(Exponentially Weighted Moving Average). To demonstrate an usefulness of proposed algorithm using OPNET modeler that built the simulation environment, reliability and real-time availability of the proposed algorithm is analyzed. The simulation results show an availability of proposed scheme in terms of reduce queuing delay and packet drop rate compared and analyzed the existing algorithms WRR(Weighted Round Robin), DRR(Deficit Round Robin) and WDRR with DWDRR.