• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.27 no.1
• /
• pp.131-134
• /
• 2023

The age of information (AoI) was proposed to quantify the freshness of information about the status of a remote source system, which is defined as the amount of time that has elapsed since a packet was created at its source. This paper analyzes the age of information of a discrete time Geo/D/1/1 status update system. For this purpose, the system is modeled as a discrete-time two-state Markov chain. The stationary probability distributions for peak AoI and AoI are obtained. The average peak AoI, the average AoI, and the freshness ratio of information are also derived. Some numerical results of the analysis are presented.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.2
• /
• pp.67-81
• /
• 1998

An Automated Guided Vehicle System (AGVS) with a unidirectional loop guide path is modeled as a discrete-time stationary Markov chain. It is discussed how to estimate the mean response time, the utilization, and the cycle time of AGV for a delivery order. Three common operation strategies for idle vehicles - central zone positioning rule, circulatory loop positioning rule and point of release positioning rule - are analyzed. These different operation strategies are compared with each other based on the performance measures.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.24 no.1
• /
• pp.73-81
• /
• 2013

In this paper, we have proposed the interference analysis method which uses both an interference probability model at the PHY layer of RFID system and the DTMC model at the MAC layer of USN system. Using the proposed method, we have performed sharing analysis between passive RFID and USN systems at the Korean RFID/USN frequency bands. If 1% performance degradation of USN system is allowed, RFID and USN systems can share the frequency bands where channel number is greater or equal to 20 on condition that radius of protection area is greater than 300 m.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.17 no.1
• /
• pp.41-49
• /
• 2014

In this paper, we consider a method to access the number of aircraft requirement which is a strategic variable in national security. This problem becomes more important considering the F-X and KF-X project in ROKAF. Traditionally, ATO(Air Tasking Order) and fighting power index have been used to evaluate the number of aircrafts required in ROKAF. However, those methods considers static aspect of aircraft requirement. This paper deals with a model to accommodate dynamic feature of aircraft requirement using absorbing Markov chain. In conclusion, we suggest a dynamic model to evaluate the number of aircrafts required with key decision variables such as destroying rate, failure rate and repair rate.

• Journal of applied mathematics & informatics
• /
• v.28 no.1_2
• /
• pp.153-162
• /
• 2010

The finite buffer GI/G/1/K system is set up by using an unconventional arrangement of the state space, in which the remaining interarrival time or service time is chosen as the level. The stationary distributions of resulting Markov chain can be explicitly determined, and the chain is positive recurrent without any restriction. This is an advantage of this method, compared with that using the elapsed time approach [2].

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.3
• /
• pp.179-196
• /
• 1986

In this paper, the peformance of a statistical packet voice/data multiplexer is studied. In ths study we assume that in the packet voice/data multiplexer two separate finite queues are used for voice and data traffics, and that voice traffic gets priority over data. For the performance analysis we divide the output link of the multiplexer into a sequence of time slots. The voice signal is modeled as an (M+1) - state Markov process, M being the packet generation period in slots. As for the data traffic, it is modeled by a simple Poisson process. In our discrete time domain analysis, the queueing behavior of voice traffic is little affected by the data traffic since voice signal has priority over data. Therefore, we first analyze the queueing behavior of voice traffic, and then using the result, we study the queueing behavior of data traffic. For the packet voice multiplexer, both inpur state and voice buffer occupancy are formulated by a two-dimensional Markov chain. For the integrated voice/data multiplexer we use a three-dimensional Markov chain that represents the input voice state and the buffer occupancies of voice and data. With these models, the numerical results for the performance have been obtained by the Gauss-Seidel iteration method. The analytical results have been verified by computer simylation. From the results we have found that there exist tradeoffs among the number of voice users, output link capacity, voic queue size and overflow probability for the voice traffic, and also exist tradeoffs among traffic load, data queue size and oveflow probability for the data traffic. Also, there exists a tradeoff between the performance of voice and data traffics for given inpur traffics and link capacity. In addition, it has been found that the average queueing delay of data traffic is longer than the maximum buffer size, when the gain of time assignment speech interpolation(TASI) is more than two and the number of voice users is small.

• Journal of the Korean Statistical Society
• /
• v.36 no.2
• /
• pp.321-333
• /
• 2007

In the proportional hazard model with the beta process prior, the posterior computation with the discrete approximation is considered. The time period of interest is partitioned by small intervals. On each partitioning interval, the likelihood is approximated by that of a binomial experiment and the beta process prior is by a beta distribution. Consequently, the posterior is approximated by that of many independent binomial model with beta priors. The analysis of the leukemia remission data is given as an example. It is illustrated that the length of the partitioning interval affects the posterior and one needs to be careful in choosing it.

• Journal of Korean Society of Transportation
• /
• v.12 no.4
• /
• pp.89-97
• /
• 1994

신호화된 교차로의 운영비율을 측정하기 위해 현재 세계적으로 광범위하게 이용되 는 척도는 교차로 통과차량의 평균지체시간이다. 그간 교차로 분석을 위해 많은 대기행렬 모형이 발표되어 왔고 또 그중 일부가 현재 사용 중에 있는데 이들은 모두 steady-state를 가정한 해법이다. 그러나 steady-state 모형은 시간에 따른 대기행렬 길이의 변화를 고려하 지 못하므로 현실적인 분석에 한계가 있는 방법론이다. 그러므로 정당한 교차로 시간산출을 위해서는 time-dependent한 분석형의 개발이 요구된다. 본 연구에서는 discrete Markov chain을 이용하여 단순히 단위시간 동안의 도착율과 출발율로써 transition probabilities를 계산하는 새로운 대기행렬 모형을 개발하였다. 개발된 불연속 대기행렬 모형을 이용하여 교 차로 분석을 할 경우 기존의 교차로 지체모형과 비교하여 기대되는 개선효과는 다음과 같 다. 변화를 고려한 dynamic한 분석으로 현실적이고 정당한 예측을 할 수 있다. 신호자동에 의한 영향을 분석할 수 있다. 그리고 독립적교차로 뿐만 아니라 간선도로, 나아가서 network 분석을 할 수 있으며, 동시에 주어지 교통여건에 대해 신호자동화를 위한 최적값을 산출해 낸다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.1
• /
• pp.11-19
• /
• 2002

This paper gives an optimal step size of E$\sub$b/ /I$\sub$oT/ for outer-loop power control(OLPC) in IMT-2000 system. The performance of outer-loop Power control is affected greatly by the fixed step size according to the channel environments. Conventional methods are inaccurate because they are decided by expert's experiences and the performance is not proved theoretically. In this paper, we show that IMT-2000 system maintains optimal capacity and QoS by the step size of E$\sub$b/ /I$\sub$oT/ obtained from the discrete-time Markov chain model.

• Proceedings of the KIEE Conference
• /
• 2005.07a
• /
• pp.226-228
• /
• 2005

This paper deals with power system stabilization problem using a network control system in which the control is applied through a communication channel in feedback form. Analysis and synthesis issues are investigated by modeling the packet delivery characteristics of the network as a Bernoulli random variable, which is described by a two state Markov chain. This model assumption yields an overall system which is described by a discrete-time Markov jump linear system. These employ the norm to measure the performance of the system, and they compute the norm via a necessary and sufficient matrix inequality condition.