• Journal of the Korean Mathematical Society
• /
• v.35 no.2
• /
• pp.259-268
• /
• 1998

In this paper the stochastic multiple objective programming problems where the right-hand-side of the constraints is stochastic are considered. We define the equivalent scalar-valued problem and study the stability of the equivalent scalar-valued problem with respect to the weight parameters and probability mesures under reasonable assumptions.

• Journal of Information Processing Systems
• /
• v.2 no.2
• /
• pp.88-94
• /
• 2006

In wireless cellular networks, previous researches on admission control policies and resource allocation algorithm considered the QoS (Quality of Service) in terms of CDP (Call Dropping Probability) and CBP (Call Blocking Probability). However, since the QoS was considered only within a predetermined cell capacity, the results indicated a serious overload problem of systems not guaranteeing both CDP and CBP constraints, especially in the hotspot cell. That is why a close interrelationship between CDP, CBP and cell capacity exists. Thus, it is indispensable to consider optimal cell capacity guaranteeing multiple QoS (CDP and CBP) at the time of initial cell planning for networks deployment. In this paper, we will suggest a distributed determination scheme of optimal cell capacity guaranteeing both CDP and CBP from a long-term perspective for initial cell planning. The cell-provisioning scheme is performed by using both the two-dimensional continuous-time Markov chain and an iterative method called the Gauss-Seidel method. Finally, numerical and simulation results will demonstrate that our scheme successfully determines an optimal cell capacity guaranteeing both CDP and CBP constraints for initial cell planning.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5B
• /
• pp.508-519
• /
• 2004

This paper proposed two multi-path constraint-based routing algorithms for Internet traffic engineering using MPLS. In normal constraint-based shortest path first (CSPF) routing algorithm, there is a high probability that it cannot find the required path through networks for a large bandwidth constraint that is one of the most important constraints for traffic engineering, The proposed algorithms can divide the bandwidth constraint into two or more sub-constraints and find a constrained path for each sub-constraint, if there is no single path satisfying the whole constraint. Extensive simulations show that they enhance the success probability of path setup and the utilization of network resources.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.733-746
• /
• 2005

In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.

• ETRI Journal
• /
• v.44 no.5
• /
• pp.733-745
• /
• 2022

In software-defined wireless networking (SDWN), the optimal routing technique is one of the effective solutions to improve its performance. This routing technique is done by many different methods, with the most common using integer linear programming problem (ILP), building optimal routing metrics. These methods often only focus on one routing objective, such as minimizing the packet blocking probability, minimizing end-to-end delay (EED), and maximizing network throughput. It is difficult to consider multiple objectives concurrently in a routing algorithm. In this paper, we investigate the application of machine learning to control routing in the SDWN. An intelligent routing algorithm is then proposed based on the machine learning to improve the network performance. The proposed algorithm can optimize multiple routing objectives. Our idea is to combine supervised learning (SL) and reinforcement learning (RL) methods to discover new routes. The SL is used to predict the performance metrics of the links, including EED quality of transmission (QoT), and packet blocking probability (PBP). The routing is done by the RL method. We use the Q-value in the fundamental equation of the RL to store the PBP, which is used for the aim of route selection. Concurrently, the learning rate coefficient is flexibly changed to determine the constraints of routing during learning. These constraints include QoT and EED. Our performance evaluations based on OMNeT++ have shown that the proposed algorithm has significantly improved the network performance in terms of the QoT, EED, packet delivery ratio, and network throughput compared with other well-known routing algorithms.

• Journal of Astronomy and Space Sciences
• /
• v.29 no.1
• /
• pp.11-21
• /
• 2012

In this paper, the authors introduced a new approach to find the optimal collision avoidance maneuver considering multi threatening objects within short period, while satisfying constraints on the fuel limit and the acceptable collision probability. A preliminary effort in applying a genetic algorithm (GA) to those kinds of problems has also been demonstrated through a simulation study with a simple case problem and various fitness functions. And then, GA is applied to the complex case problem including multi-threatening objects. Two distinct collision avoidance maneuvers are dealt with: the first is in-track direction of collision avoidance maneuver. The second considers radial, in-track, cross-track direction maneuver. The results show that the first case violates the collision probability threshold, while the second case does not violate the threshold with satisfaction of all conditions. Various factors for analyzing and planning the optimal collision avoidance maneuver are also presented.

• Journal of the Korean Statistical Society
• /
• v.27 no.4
• /
• pp.407-420
• /
• 1998

This paper is concerned with selecting covariates to be included in building linear random effects models designed to analyze clustered response normal data. It is based on a Bayesian approach, intended to propose and develop a procedure that uses probabilistic considerations for selecting premising subsets of covariates. The approach reformulates the linear random effects model in a hierarchical normal and point mass mixture model by introducing a set of latent variables that will be used to identify subset choices. The hierarchical model is flexible to easily accommodate sign constraints in the number of regression coefficients. Utilizing Gibbs sampler, the appropriate posterior probability of each subset of covariates is obtained. Thus, In this procedure, the most promising subset of covariates can be identified as that with highest posterior probability. The procedure is illustrated through a simulation study.

• Journal of Korean Society of Water and Wastewater
• /
• v.11 no.3
• /
• pp.87-95
• /
• 1997

A river water quality management model was made by Dynamic programming. This model optimizes the wastewater treatment cost of the application area, and computed water quality with it must meet the water quality standard. And this model takes into consideration tributary input, wastewater treatment plant effluent, withdrawls for several purposes. Modified Streeter-Phelps equation was used to calculate BOD and DO. Optimization problem was solved with particular exceedance probability flow, and the water quality of each point was calculated with the decided treatment efficiencies. At that time, the probability satisfying the water quality standard of constraints to the exceedance probability of the flow. The developed model was applied to the lower part of the Han-River. The reliability to meet the water quality standard is 70 % when 4 wastewater treatment plants of Seoul City are operated by activated sludge system at autumn of the year 2001. Treatment cost of this case is 121.288 billion won per year.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.22 no.4
• /
• pp.299-306
• /
• 2009

Design optimization is a method to find optimum point which minimizes the objective function while satisfying design constraints. The conventional optimization does not consider the uncertainty originated from modeling or manufacturing process, so optimum point often locates on the boundaries of constraints. Reliability based design optimization includes optimization technique and reliability analysis that calculates the reliability of the system. Reliability analysis can be classified into simulation method, fast probability integration method, and moment-based reliability method. In most generally used MPP based reliability analysis, which is one of fast probability integration method, if many MPP points exist, cost and numerical error can increase in the process of transforming constraints into standard normal distribution space. In this paper, multiplicative decomposition method is used as a reliability analysis for RBDO, and sensitivity analysis is performed to apply gradient based optimization algorithm. To illustrate whole process of RBDO mathematical and engineering examples are illustrated.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.8
• /
• pp.1393-1400
• /
• 2006

This paper optimizes the access probabilities (APs) in a network resource allocation scheme based on access probabilities in order that the waiting time and the blocking probability are minimized under the given constraints, and obtains its performance. In order to optimize APs, an infinite number of balance equations is reduced to a finite number of balance equations by applying Neuts matrix geometric method. And the nonlinear programming problem is converted into a linear programming problem. As a numerical example, the performance measures of waiting time and blocking probability for optimal access probabilities and the maximum utilization under the given constraints are obtained. And it is shown that the scheme with optimal APs gives more performance build-up than the strategy without optimization.