• Journal of Korean Institute of Industrial Engineers
• /
• v.15 no.1
• /
• pp.89-103
• /
• 1989

In this paper the approximate average outgoing quality and properties of a class of continuous sampling plans in a short production run are investigated when the quality of successive units follows a two-state time-homogeneous Markov chain. The results of previous studies can be obtained as special cases. It is observed that the long-run average outgoing quality limit values under the statistical control differ significantly as compared to the case of short production runs in a Markov-dependent production process.

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

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.13 no.1
• /
• pp.53-60
• /
• 2014

Redundant handovers cause degraded quality of service to passengers in vehicle. This paper proposes a handover scheme suitable for users traveling in vehicles, which enables continuous learning of the handover process using a discrete-time Markov chain (DTMC). Through AdaBoost machine learning algorithm, the proposed handover scheme avoids unnecessary handover trials when a short dwell time in a target cell is expected or when the target cell is an intermediate cell through which the vehicle quickly passes. Simulation results show that the proposed scheme reduces the number of handover occurrences and maintains adequate throughput.

• Proceedings of the Korean Society for Quality Management Conference
• /
• 2004.04a
• /
• pp.499-502
• /
• 2004

Multi-server Markovian retrial model with heterogeneous servers is analyzed. Arriving customers constitute the MMAP(Marked Markovian Arrival Process). Distribution of the primary customers among the servers is performed randomly depending on the type of a customer and the number of the server. Customers from the orbit have the exponential service time distribution with a parameter depending on the server only. The choice of the server for a retrial is made randomly as well. Multidimensional continuous time Markov chain describing operation of the model is investigated by means of reducing to asymptotically quasi-toeplitz Markov chaius.

• Journal of the military operations research society of Korea
• /
• v.6 no.2
• /
• pp.151-184
• /
• 1980

Simple models for a defense consisting of a preinstalled mine field possibly defended by an anti-tank weapon are derived and analyzed. This paper uses a special Poisson process to model the one or two positions of mines in the mine field. The duel between the anti-tank weapon and offensive tanks crossing the field is modeled with a continuous time Markov chain. Some algebraic solutions and numerical results are obtained for specific scenarios.

• Journal of applied mathematics & informatics
• /
• v.33 no.1_2
• /
• pp.211-217
• /
• 2015

A dynamic spectrum access scheme with channel partitioning for secondary handover calls in cognitive radio networks is proposed to reduce forced termination probability due to spectrum handover failure. A continuous-time Markov chain method for evaluating its performance such as blocking probability, forced termination probability, and throughput is presented. Numerical and simulation results are provided to demonstrate the effectiveness of the proposed scheme with channel partitioning.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.5
• /
• pp.805-814
• /
• 1994

In this paper, we introduce a new method which is available for analyzing the throughput of the packet radio network by using the auxiliary Markov transient matrix with a failure state and a success state. And we consider the effect of symbol error for the network state(X, R) consisted of the number of transmitting PRU X and receiving PRU R. We examine the packet radio network of a continuous time Markov chain model, and the direct sequence binary phase shift keying CDMA radio channel with hard decision Viterbi decoding and bit-by-bit changing spreading code. For the unslotted distributed multi-hop packet radio network, we assume that the packet error due to a symbol error of radio channel has Poisson process, and the time period of an error occurrence is exponentially distributed. Through the throughputs which are found as a function of radio channel parameters, such as the received signal to noise ratio and chips of spreading code per symbol, and of network parameters, such as the number of PRU and offered traffic rate, it is shown that this composite analysis enables us to combine the Markovian packet radio network model with a coded DS/BPSK CDMA radio channel.

• ETRI Journal
• /
• v.17 no.1
• /
• pp.23-36
• /
• 1995

We present a performance evaluation model of cell reassembly mechanism in an ATM switching system. An ATM switching system may be designed so that communications between processors of its control part can be performed via its switching network rather than a separate inter-processor communications network. In such a system, there should be interface to convert inter-processor communication traffic from message format to cell format and vice versa, that is, mechanisms to perform the segmentation and reassembly sublayer. In this paper, we employ a continuous-time Markov chain for the performance evaluation model of cell reassembly mechanism with individual buffering, judicially defining the states of the mechanism. Performance measures such as message loss probability and average reassembly delay are obtained in closed forms. Some numerical illustrations are given for the performance analysis and dimensioning of the cell reassembly mechanism.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.18 no.33
• /
• pp.123-134
• /
• 1995

After the introduction of ATM as a proper technology for B-ISDN, there have been many research efforts to realize ATM networks. But a computationally tractable modelling technique which reflects diverse characteristics of the ATM traffic accurately is not available yet. In this study, we try to establish an accurate but still convenient ATM traffic model. We first introduce the modelling technique for the voice traffic based on the fluid flow approximation. Then we present a traffic model for the mixed traffic from multiple video sources and voice sources. The video source model is based on the 3 state continuous time Markov chain. The accuracy of the model is demonstrated by some comparison results with respect to simulation.

• Convergence Security Journal
• /
• v.11 no.6
• /
• pp.67-72
• /
• 2011

A system that provides a ubiquitous service is a networked system that has to overcome their circumstances that the service survivability is weak. the survivability of a networked system is defined as an ability of the system that can offer their services without interruption, regardless of whether components comprising the system are under failures, crashes, or physical attacks. This paper presents an approach that end users can obtain a quantitative evaluation of U-service survivability to reflect intended cyber attacks causing the networked system to fall into byzantine failures in addition to the definition of the survivability. In this paper, a Jini system based on wireless local area networks is used as an example for quantitative evaluation of U-service survivability. This paper also presents an continuous time markov chain (CTMC) Model for evaluation of survivability of U-service that a Jini system provides, and an approach to evaluate the survivability of the U-service as a blocking probability that end users can not access U-services.