• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.6
• /
• pp.1398-1417
• /
• 2013

A method is proposed to reduce excess resources from a virtual machine(VM) while avoiding subsequent migrations for a computer cluster that provides cloud service. The proposed scheme cuts down on the resources of a VM based on the probability that migration may occur after a reduction. First, it finds a VM that can be scaled down by analyzing the history of the resource usage. Then, the migration probability is calculated as a function of the VM resource usage trend and the trend error. Finally, the amount of resources needed to eliminate from an underutilized VM is determined such that the migration probability after the resource reduction is less than or equal to an acceptable migration probability. The acceptable migration probability, to be set by the cloud service provider, is a criterion to assign a weight to the resource reduction either to prevent VM migrations or to enhance VM utilization. The results of simulation show that the proposed scheme lowers migration frequency by 31.6~60.8% depending on the consistency of resource demand while losing VM utilization by 9.1~21.5% compared to other known approaches, such as the static and the prediction-based methods. It is also verified that the proposed scheme extends the elapsed time before the first occurrence of migration after resource reduction 1.1~2.3-fold. In addition, changes in migration frequency and VM utilization are analyzed with varying acceptable migration probabilities and the consistency of resource demand patterns. It is expected that the analysis results can help service providers choose a right value of the acceptable migration probability under various environments having different migration costs and operational costs.

• ETRI Journal
• /
• v.43 no.5
• /
• pp.799-811
• /
• 2021

This paper considers a challenging problem: to simultaneously optimize the cost and the quality of service in opaque wavelength division multiplexing (WDM) networks. An optimization problem is proposed that takes the information including network topology, traffic between end nodes, and the target level of congestion at each link/ node in WDM networks. The outputs of this problem include routing, link channel capacities, and the optimum number of switch ports locally added/dropped at all switch nodes. The total network cost is reduced to maintain a minimum congestion level on all links, which provides an efficient trade-off solution for the network design problem. The optimal information is utilized for dynamic traffic in WDM networks, which is shown to achieve the desired performance with the guaranteed quality of service in different networks. It was found that for an average link blocking probability equal to 0.015, the proposed model achieves a net channel gain in terms of wavelength channels (𝛾_w) equal to 35.72 %, 39.09 %, and 36.93 % compared to shortest path first routing and 𝛾_w equal to 29.41 %, 37.35 %, and 27.47 % compared to alternate routing in three different networks.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1996.06a
• /
• pp.9-15
• /
• 1996

In this paper, we propose a new detector based on the median-shift sign. We call it the median-shift sign (MSS) detector, which is an extension of the classical sign detector. We first analyze the problem of detecting a dc signal in noise of known probability density function (pdf). The MSS detector with the optimum median-shift value, the optimum MSS detector, performs better than the sign detector in Gaussian noise: it has the best performance among the detectors compared in Laplacian and Cauchy noise. It is shown that the MSS detectors with constant median-shift values are nearly equal to the optimum MSS detector. We also analyze the problem of detecting a dc signal when only partial information is available on the noise. The MSS detectors with constant median-shift values are almost equal to the sign detector in Gaussian noise: they perform better than the sign and Wilcoxon detectors for most signal ranges in Laplacian and Cauchy noise.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.40 no.1
• /
• pp.47-57
• /
• 1991

A new control algorithm so called equal excursion sliding mode (EESM) control method is proposed to control the position of DC servo motor. This method introduces the concept of phase velocity vector that Filippov presented, and simplifies the problem of control gain selection in a conventional VSC strategy. And, by making state trajectories have equal excursions on both sides of switching hyperplane we minimized the probability of sliding mode's being collapsed, and approximated to the ideal sliding moed. Also, we proved the validity of this method by comparing the application results of this method to DC servo motor with those of conventional VSC strategy.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.6
• /
• pp.1122-1129
• /
• 2007

For a system with multiple real-time tasks of different deadlines, it is very difficult to find the optimal checkpoint interval because of the complexity in considering the scheduling of tasks. In this paper, we determine the optimal checkpoint interval for multiple real-time tasks that are scheduled by RM(Rate Monotonic) algorithm. Faults are assumed to occur with Poisson distribution. Checkpoints are inserted in the execution of task with equal distance in the same task, but different distances in other tasks. When faults occur, rollback to the latest checkpoint and re-execute task after the checkpoint. We derive the equation of maximum slack time for each task, and determine the number of re-executable checkpoint intervals for fault recovery. The equation to check the schedulibility of tasks is also derived. Based on these equations, we find the probability of all tasks executed within their deadlines successfully. Checkpoint intervals which make the probability maximum is the optimal.

• Journal of Communications and Networks
• /
• v.12 no.5
• /
• pp.475-479
• /
• 2010

The clipping value, defined as the log-likelihood ratio (LLR) in the case wherein all the list of candidates have the same binary value, is investigated, and an effective method to estimate it is presented for iterative tree search detection. The basic principle behind the method is that the clipping value of a channel bit is equal to the LLR of the maximum probability of correct decision of the bit to the corresponding probability of erroneous decision. In conjunction with multilevel bit mappings, the clipping value can be calculated with the parameters of the number of transmit antennas, $N_t$; number of bits per constellation point, $M_c$; and variance of the channel noise, $\sigma^2$, per real dimension in the Rayleigh fading channel. Analyses and simulations show that the bit error performance of the proposed method is better than that of the conventional fixed-value method.

• The Journal of the Korea Contents Association
• /
• v.9 no.1
• /
• pp.123-130
• /
• 2009

When we apply MLPs(multilayer perceptrons) to pattern classification problems, we generally allocate one output node for each class and the index of output node denotes a class. On the contrary, in this paper, we propose to increase the number of output nodes per each class for performance improvement of MLPs. For theoretical backgrounds, we derive the misclassification probability in two class problems with additional outputs under the assumption that the two classes have equal probability and outputs are uniformly distributed in each class. Also, simulations of 50 isolated-word recognition show the effectiveness of our method.

• Journal of Satellite, Information and Communications
• /
• v.8 no.4
• /
• pp.1-5
• /
• 2013

CR(Cognitive Radio) technology is maximized frequency reuse using unused frequency band. Conventional cooperative spectrum sensing has fixed false alarms. so all cooperative user has equal threshold. This problem is caused degradation of detection probability. so we propose and analysis the system model that false alarm differential setting through CSI(channel state information) for resonable threshold. Simulation results show improvement of detection probability.

• Journal of Communications and Networks
• /
• v.5 no.2
• /
• pp.174-183
• /
• 2003

Space-Time (ST) codes are known to provide high transmission rates, diversity and coding gains. In this paper, a tight upper bound on the error probability of ST codes over rapid fading channels is presented. Moreover, ST codes suitable for rapid fading channels are presented. These codes are designed using the QPSK and 16-QAM signal constellations. The proposed codes are based on two different encoding schemes. The first scheme uses a single trellis encoder, whereas the second scheme uses the I-Q encoding technique. Code design is achieved via partitioning the signal space such that the design criteria are maximized. As a solution for the decoding problem of I-Q ST codes, the paper introduces a low-complexity decoding algorithm. Results show that the I-Q ST codes using the proposed decoding algorithm outperform singleencoder ST codes with equal complexity. The proposed codes are tested over fading channels with different interleaving conditions, where it is shown that the new codes are robust under such imperfect interleaving conditions.

• Structural Engineering and Mechanics
• /
• v.28 no.4
• /
• pp.357-372
• /
• 2008

This study investigates effect of uncertainty in natural vibration period on the seismic demand. It is shown that since this uncertainty affects the acceleration and displacement responses differently, two ratios, one relating peak acceleration responses and the other relating the peak displacement responses, are not equal and both must be employed in evaluating and defining the critical seismic demand. The evaluation of the ratios is carried out using more than 200 strong ground motion records. The results suggest that the uncertainty in the natural vibration period impacts significantly the statistics of the ratios relating the peak responses. By using the statistics of the ratios, a procedure and sets of empirical equations are developed for estimating the probability consistent seismic demand for both linear and nonlinear systems.