• International Journal of Highway Engineering
• /
• v.4 no.4 s.14
• /
• pp.1-12
• /
• 2002

Pavement Management System has a special purpose that the rehabilitation strategy applied on pavement should be executable in view of technical and economical point after new pavement open to the traffic. To achieve that purpose, a reliable pavement performance prediction model should be embeded in the system. The object of this study is to develop a probabilistic pavement performance prediction model for evaluating asphalt pavements based on the Markov chain concept. In this paper, methodology of the Markov chain modeling principle is explained, and the application of this model to asphalt pavement is described. As the results, transition matrics for predicting asphalt pavement performance are obtained, and also performance life is estimated quantitatively by this system.

• Journal of Korean Society for Quality Management
• /
• v.32 no.4
• /
• pp.156-168
• /
• 2004

This research investigates the statistical efficiency of variable sampling size & sampling interval(VSSI) $\bar{X}$ charts under two assignable causes. Algorithms for calculating the average run length(ARL) and average time to signal(ATS) of the VSSI $\bar{X}$ chart are proposed by employing Markov chain method. States of the process are defined according to the process characteristics after the occurrence of an assignable cause. Transition probabilities are carefully derived from the state definition. Statistical properties of the proposed chart are also investigated. A simple procedure for designing the proposed chart is presented based on the properties. Extensive sensitivity analyses show that the VSSI $\bar{X}$ chart is superior to the VSS or VSI $\bar{X}$ chart as well as to the Shewhart $\bar{X}$ chart in statistical sense, even tinder two assignable causes.

• Journal of Satellite, Information and Communications
• /
• v.6 no.1
• /
• pp.12-18
• /
• 2011

Signal fading due to rain is one of the most significant factors degrading link quality in satellite communication systems. Adaptive transmission is considered to be the most efficient means to countermeasure the rain attenuation. In order to develop and design a good adaptive transmission system, we need a dynamic rain attenuation model which can synthesize time series of rain attenuation. In this paper, we present a modeling technique for dynamic rain attenuation using a Markov process. We derive statistical fading properties of the rain attenuation data measured in second time interval and define four states in the Markov process. We synthesize the rain attenuation data using the 4-state Markov process, and compare statistical properties of the simulated data to those of the measured data.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.4825-4847
• /
• 2016

In this paper, we focus on the per-flow throughput analysis of IEEE 802.11 multi-hop ad hoc networks. The importance of an accurate saturation throughput model lies in establishing the theoretical foundation for effective protocol performance improvements. We argue that the challenge in modeling the per-flow throughput in IEEE 802.11 multi-hop ad hoc networks lies in the analysis of the freezing process and probability of collisions. We first classify collisions occurring in the whole transmission process into instantaneous collisions and persistent collisions. Then we present a four-dimensional Markov chain model based on the notion of the fixed length channel slot to model the Binary Exponential Backoff (BEB) algorithm performed by a tagged node. We further adopt a continuous time Markov model to analyze the freezing process. Through an iterative way, we derive the per-flow throughput of the network. Finally, we validate the accuracy of our model by comparing the analytical results with that obtained by simulations.

• Communications of the Korean Mathematical Society
• /
• v.14 no.3
• /
• pp.611-625
• /
• 1999

We consider ΜΑΡ/G/ 1 finite capacity queue with mul-tiple thresholds on buffer. The arrival of customers follows a Markov-ian arrival process(MAP). The service time of a customer depends on the queue length at service initiation of the customer. By using the embeded Markov chain method and the supplementary variable method, we obtain the queue length distribution ar departure epochs and at arbitrary epochs. This gives the loss probability and the mean waiting time by Little's law. We also give a simple numerical examples to apply the overload control in packetized networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.4
• /
• pp.1293-1316
• /
• 2021

Using directional antennas in wireless Ad hoc networks has many superiorities, including reducing interference, extending transmission range, and increasing space division multiplexing. However, directional transmission introduces two problems: deafness and directional hidden terminals problems. We observe that these problems result in saturation throughput disparity among the competing flows in directional CSMA/CA based Ad hoc networks and bring challenges for modeling the saturation throughput of the flows. In this article, we concentrate on how to model and analyze the saturation throughput disparity of different flows in directional CSMA/CA based Ad hoc networks. We first divide the collisions occurring in the transmission process into directional instantaneous collisions and directional persistent collisions. Then we propose a four-dimensional Markov chain to analyze the transmission state for a specific node. Our model has three different kinds of processes, namely back-off process, transmission process and freezing process. Each process contains a certain amount of continuous time slots which is defined as the basic time unit of the directional CSMA/CA protocols and the time length of each slot is fixed. We characterize the collision probabilities of the node by the one-step transition probability matrix in our Markov chain model. Accordingly, we can finally deduce the saturation throughput for each directional data stream and evaluate saturation throughput disparity for a given network topology. Finally, we verify the accuracy of our model by comparing the deviation of analytical results and simulation results.

• Communications for Statistical Applications and Methods
• /
• v.13 no.3
• /
• pp.491-501
• /
• 2006

We consider a multiple change point model with autoregressive conditional heteroscedasticity (ARCH). The model assumes that all or the part of the parameters in the ARCH equation change over time. The occurrence of the change points is modelled as the discrete time Markov process with unknown transition probabilities. The model is estimated by Markov chain Monte Carlo methods based on the approach of Chib (1998). Simulation is performed using a variant of perfect sampling algorithm to achieve the accuracy and efficiency. We apply the proposed model to the simulated data for verifying the usefulness of the model.

• International Journal of Computer Science & Network Security
• /
• v.22 no.3
• /
• pp.1-8
• /
• 2022

Supporting real-time flows with delay and throughput constraints is an important challenge for future wireless networks. In this paper, we develop an optimal scheduling scheme to optimally choose the packets to transmit. The optimal transmission strategy is based on an observable Markov decision process. The novelty of the work focuses on a priority-based probabilistic packet scheduling strategy for efficient packet transmission. This helps in providing guaranteed services to real time traffic in Heterogeneous Wireless Networks. The proposed scheduling mechanism is able to optimize the desired performance. The proposed scheduler improves the overall end-to-end delay, decreases the packet loss ratio, and reduces blocking probability even in the case of congested network.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.13 no.2
• /
• pp.81-87
• /
• 2004

This paper deals with a new approach to tolerance optimization problems. Optimal tolerance allotment problems can be formulated as stochastic optimization problems. Most schemes to solve the stochastic optimization problems have been found to exhibit difficulties in multivariate integration of the probability density function. As a typical example of stochastic optimization the optimal tolerance allotment problem has the same difficulties. In this stochastic model, manufacturing system is represented by Gauss-Markov stochastic process and the manufacturing unit availability is characterized for realistic optimization modeling. The new algorithm performed robustly for a large deviation approximation. A significant reduction in computation time was observed compared to the results obtained in previous studies.

• Journal of the military operations research society of Korea
• /
• v.17 no.1
• /
• pp.1-24
• /
• 1991

This report concerns the study of deciding replacement requirements for 1/4ton truck in Korea. Two causes of replacement, accidental loss and wearout are considered in the replacement requirements model which was developed in Defence Logistics Agency. The model represents the state of 1/4 ton truck inventory over time as a finite Markov chain process. An accidental loss rate, yearly usage rates. wearout rates are used in conjuction with the current mileage distribution of the inventory to forecast replacement requirements in future time periods.