• 한국경영과학회지
• /
• 제20권2호
• /
• pp.1-10
• /
• 1995

In this study, a threshold policy is considered for the M/M/2 queueing system with server vacations. The probability generating function for the number of customers present in the system is derived using an embedded Markov chain approach. Then, assuming a linear cost structure, an efficient procedure to find an optimal threshold policy is presented. The Laplace-Stieltjes transofrm for th waiting time of an arbitrary customer under a "FIFO" discipline is also derived.o derived.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권6호
• /
• pp.2450-2469
• /
• 2018

In this paper, we develop a spatiotemporal model to analysis of cellular user in underlay D2D communication by using stochastic geometry and queuing theory. Firstly, by exploring stochastic geometry to model the user locations, we derive the probability that the SINR of cellular user in a predefined interval, which constrains the corresponding transmission rate of cellular user. Secondly, in contrast to the previous studies with full traffic models, we employ queueing theory to evaluate the performance parameters of dynamic traffic model and formulate the cellular user transmission mechanism as a M/G/1 queuing model. In the derivation, Embedded Markov chain is introduced to depict the stationary distribution of cellular user queue status. Thirdly, the expressions of performance metrics in terms of mean queue length, mean throughput, mean delay and mean dropping probability are obtained, respectively. Simulation results show the validity and rationality of the theoretical analysis under different channel conditions.

• 대한수학회보
• /
• 제43권3호
• /
• pp.657-669
• /
• 2006

In this paper, we analyze a leaky bucket (LB) scheme with queue length dependent arrival rates. In other words, if the queue length exceeds an appropriate threshold value on buffer, the arrivals need to be controlled. In ATM networks, if the congestion occurs, the input traffics must be controlled (reduced) for congestion resolution. By the bursty and correlated properties of traffics, the arrivals are assumed to follow a Markov-modulated Poisson process (MMPP). We derive the loss probability and the waiting time distribution for arbitrary cell. The analysis is done by using the embedded Markov chain and supplementary variable method. We also present some numerical examples to show the effects of our proposed LB scheme.

• Journal of applied mathematics & informatics
• /
• 제22권1_2호
• /
• pp.523-533
• /
• 2006

We analyze two finite buffers queueing system with priority scheduling dependent upon queue length. Customers are classified into two types ( type-l and type-2 ) according to their characteristics. Here, the customers can be considered as traffics such as voice and data in telecommunication networks. In order to support customers with characteristics of burstiness and time-correlation between interarrival, the arrival of the type-2 customer is assumed to be an Markov- modulated Poisson process(MMPP). The service order of customers in each buffer is determined by the queue length of two buffers. Methods of embedded Markov chain and supplementary variable give us information for queue length of two buffers. Finally, performance measures such as loss and mean delay are derived.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제18권4호
• /
• pp.295-304
• /
• 2014

We analyze theMMPP/G/1/K queue with a modified state-dependent service rate. The service time of customers upon service initiation is changed if the number of customers in the system reaches a threshold. Then, the changed service time is continued until the system becomes empty completely, and this process is repeated. We analyze this system using an embedded Markov chain and a supplementary variable method, and present the queue length distributions at a customer's departure epochs and then at an arbitrary time.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제17권2호
• /
• pp.103-113
• /
• 2013

We analyze the queueing model for leaky bucket (LB) scheme with dynamic arrivals and token rates. In other words, in our LB scheme the arrivals and token rates are changed according to the buffer occupancy. In telecommunication networks, the LB scheme has been used as a policing function to prevent congestion. By considering bursty and correlated properties of input traffic, the arrivals are assumed to follow a Markov-modulated Poisson process (MMPP). We derive the distribution of system state, and obtain the loss probability and the mean waiting time. The analysis is done by using the embedded Markov chain and supplementary variable method. We also present some numerical examples to show the effect of our proposed model.

• 한국정보과학회논문지:정보통신
• /
• 제31권2호
• /
• pp.188-195
• /
• 2004

본 논문에서는 적응변조코딩(Adaptive Modulation and Coding) 기법을 사용하는 CDMA 무선 통신 시스템에서의 TCP 성능을 분석한다. AMC를 사용하는 무선 채널은 패킷 손실 확률이 매우 낮고 대역폭이 시간에 따라 크게 변하는 특성을 갖는다. 무선채널 대역폭의 큰 변화 때문에 전송계층 프로토콜로 TCP를 사용하는 경우, TCP에서 timeout이 자주 발생하게 되어 결과적으로 시스템의 처리량(throughput)이 크게 떨어진다. 논문의 분석은 크게 두 부분으로 구성된다. 첫 번째 부분에서는 서버에서 전송되는 TCP 패킷들을 여러 집단으로 나누어 ‘패킷 그룹’이라 정의하고 각각의 패킷 그룹들이 AMC를 사용하는 무선 채널에서 전송되는 시간의 분포를 구하였다. 두 번째 부분에서는 첫 번째 부분의 결과를 토대로 embedded Markov chain을 이용해 TCP timer와 무선 전송을 모델링 하였다. 이 논문의 결과는 AMC를 사용하는 고속 순방향 데이타 전송 시스템인 HSDPA, 1xEV-DO, 1xEV-DV등의 설계와 운영에 지침이 될 수 있을 것이다.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제36권8호
• /
• pp.607-615
• /
• 2009

최근 IT 산업은 국방, 항공, 자동차, 의료와 같은 전통 산업분야와 서로 융합하는 추세이다. 그러므로 시스템의 하드웨어를 주로 담당하는 임베디드 소프트웨어는 높은 신뢰성, 가용성, 유지보수성이 보장되어야 한다. 이를 위해 최근 COTS (Commercial Off The Shelf) 하드웨어 컴포넌트 기반 임베디드 소프트웨어를 개발하는 추세이다. 그러나 이러한 개발방법에는 일반적 소프트웨어 결함 외에 하드웨어와의 상호작용에 기인하는 결함이 추가적으로 발생할 수 있다. 이를 연동결함(Linkage Fault)라고 정의한다. 이는 발생 빈도가 낮음에도 불구하고 전체 시스템의 중단을 야기할 정도로 위험하다. 본 논문에서는 COTS 하드웨어 컴포넌트 기반 임베디드 소프트웨어 개발 시 이러한 연동결함의 발생을 고려한 신뢰성 모델을 제안한다. 또한 제안된 모델의 타당성을 분석하기 위해 베이지안 분석과 마코프 체인 몬테카를로 방법으로 계산한 베이즈 요인을 이용한다. 끝으로 IT 융합 분야의 실제 데이터를 활용하여 제안된 모델의 이론적 결과를 뒷받침한다.

• 센서학회지
• /
• 제26권4호
• /
• pp.286-291
• /
• 2017

With regards to heading estimation using gyroscope and magnetometer signals, magnetic disturbance added in the magnetometer signals is a main degradation factor in the estimation accuracy. Although there are a number of existing mechanisms that may properly compensate for the magnetic disturbances, they are designed to react only to the magnetic disturbances, but not to the time derivative of disturbances. Note that the sensors may experience abrupt changes in the magnetic disturbances, particularly for ambulatory applications. This paper proposes a magnetic disturbance model-embedded heading estimation filter for time-varying magnetic environments. The proposed magnetic disturbance model is based on a first-order Markov chain with a conditional switching technique depending on the time derivative of disturbances. Once a high amount of derivative is detected, the corrupted magnetometer signals are discarded to protect the filter from them. In our experimental results, the averaged heading error of tests was $1.46^{\circ}$, while that of the original approach without switching was $5.75^{\circ}$.

• Journal of applied mathematics & informatics
• /
• 제6권2호
• /
• pp.553-568
• /
• 1999

This paper is of concern to queueing analysis of the dynamic rate leaky bucket(LB) scheme in which the token generation interval changes according to the buffer state at a token generation epoch. Cell arrivals are assumed to follow a Markovian arrival process (MAP) which is weakly dense in the class of the stationary point processes. By using the embedded Markov chain method we obtain the probability distribution of the system state at a token generation epoch and an arbitrary time. Some simple numerical examples also are provided to show the effects of the proposed LB scheme.