• 대한수학회논문집
• /
• 제11권3호
• /
• pp.841-853
• /
• 1996

This article finds smoothed perturbation analysis estimates for the derivatives of mean performance measures in a Markovian queue with batch arrivals. We show that those estimates can be observed from a single sample path.

• 한국산업정보학회논문지
• /
• 제10권2호
• /
• pp.42-47
• /
• 2005

A single-server queueing model with the Batch Markovian Arrival Process and disaster ow correlated with the arrival process is analyzed. The numerically stable algorithm for calculating the steady state distribution of the system is presented.

• 대한산업공학회지
• /
• 제42권1호
• /
• pp.30-37
• /
• 2016

A multi-server queueing system with an infinite buffer and impatient customers is analyzed. The system operates in the finite state Markovian random environment. The number of available servers, the parameters of the batch Markovian arrival process, the rate of customers' service, and the impatience intensity depend on the current state of the random environment and immediately change their values at the moments of jumps of the random environment. Dynamics of the system is described by the multi-dimensional asymptotically quasi-Toeplitz Markov chain. The ergodicity condition is derived. The main performance measures of the system are calculated. Numerical results are presented.

• 산업경영시스템학회지
• /
• 제30권1호
• /
• pp.33-40
• /
• 2007

A multi-server queueing system with finite buffer is considered. The input flow is the BMAP (Batch Markovian Arrival Process). The service time has the PH (Phase) type distribution. Customers from the BMAP enter the system according to the discipline of partial admission. Besides ordinary (positive) customers, the Markovian flow (MAP) of negative customers arrives to the system. A negative customer can delete an ordinary customer in service if the state of its PH-service process belongs to some given set. In opposite case the ordinary customer is considered to be protected of the effect of negative customers. The stationary distribution and the main performance measures of the considered queueing system are calculated.

• 한국산업정보학회논문지
• /
• 제23권1호
• /
• pp.53-63
• /
• 2018

본 논문에서는 D-정책을 갖는 이산시간 BMAP/G/1 대기행렬시스템의 대기시간을 분석한다. 고객(또는 패킷)들은 마코비안 도착과정을 따라 집단으로 시스템에 도착하며, 유휴한 서버는 시스템에 도착한 고객집단의 서비스시간의 총합이 이미 정해놓은 임계값 D를 초과하면 시스템에 더 이상 서비스할 고객이 없을 때까지 서비스를 제공한다. 시스템의 안정상태 대기시간 분포를 변환 형태로 구하고 성능척도로서 평균값을 유도하였다. 시뮬레이션을 통하여 이론값들의 타당성을 검증하고 간단한 수치예제를 보였다.

• 한국정보기술응용학회:학술대회논문집
• /
• 한국정보기술응용학회 2005년도 6th 2005 International Conference on Computers, Communications and System
• /
• pp.271-275
• /
• 2005

Queueing models are good models for fragments of communication systems and networks, so their investigation is interesting for theory and applications. Theses queues may play an important role for the validation of different decomposition algorithms designed for investigating more general queueing networks. So, in this paper we illustrate that the batch size distribution affects the loss probability, which is the main performance measure of a finite buffer queues.

• 한국산업정보학회논문지
• /
• 제11권1호
• /
• pp.1-6
• /
• 2006

Queueing models are good models for fragments of communication systems and networks, so their investigation is interesting for theory and applications. Theses queues may play an important role for the validation of different decomposition algorithms designed for investigating more general queueing networks. So, in this paper we illustrate that the batch size distribution affects the loss probability, which is the main performance measure of a finite buffer queues.

• 한국산업정보학회논문지
• /
• 제21권6호
• /
• pp.1-12
• /
• 2016

본 논문에서는 D-정책을 갖는 이산시간 BMAP/G/1 대기행렬시스템의 일량을 분석한다. 유휴한 서버는 시스템에 도착한 고객집단의 서비스시간의 총합이 이미 정해진 일량 임계값 D를 초과하면 시스템에 서비스할 고객이 없을 때까지 서비스를 제공한다. 시스템의 안정상태 일량변환벡터를 유도하고 성능척도로서 평균일량을 구하였다. 시뮬레이션을 통해 이론값들의 타당성을 검증하고 간단한 수치예제를 보였다.

• 한국산업정보학회논문지
• /
• 제12권2호
• /
• pp.16-23
• /
• 2007

Tandem queueing systems well suit for modeling many telecommunication systems. Recently, very general $BMAP/G/1/N/1{\to}{\bullet}/PH/1/M-1$ type tandem queues were constructively studied. In this paper we illustrate application of the obtained results for optimization of a buffer pool design.

• 한국산업정보학회논문지
• /
• 제9권3호
• /
• pp.32-37
• /
• 2004

This paper investigates the mathematical model of multi-server retrial queueing system with the Batch Markovian Arrival Process (BMAP), the Phase type (PH) service distribution and the finite buffer. The sufficient condition for the steady state distribution existence and the algorithm for calculating this distribution are presented. Finally, a formula to solve loss probability in the case of complete admission discipline is derived.