• Communications of the Korean Mathematical Society
• /
• v.12 no.1
• /
• pp.177-192
• /
• 1997

The basic theory of the quasi-birth-and-death process is extended to a process which is inhomogeous in levels. Several key results in the standard homogeneous theory hold in a more general context than that usually stated, in particular not requiring positive recurrence. Theser results are subsumed under our development. The treatment is entirely probabilistic.

• Journal of applied mathematics & informatics
• /
• v.29 no.3_4
• /
• pp.803-811
• /
• 2011

We present an algorithmic solution for the stationary distribution of the M/M/c retrial queue in which the retrial times of each customer in orbit are of phase type distribution of order 2. The system is modeled by the level dependent quasi-birth-and-death (LDQBD) process.

• Journal of applied mathematics & informatics
• /
• v.7 no.1
• /
• pp.83-100
• /
• 2000

Many queueing systems such as M/M/s/K retrial queue with impatient customers, MAP/PH/1 retrial queue, retrial queue with two types of customers and MAP/M/$\infty$ queue can be modeled by a level dependent quasi-birth-death(LDQBD) process with linear transition rates of the form ${\lambda}_k$={\alpga}{+}{\beta}k$ at each level $\kappa$. The purpose of this paper is to propose an algorithm to find transient distributions for LDQBD processes with linear transition rates based on the adaptive uniformization technique introduced by van Moorsel and Sanders [11]. We apply the algorithm to some retrial queues and present numerical results.

• Journal of applied mathematics & informatics
• /
• v.39 no.5_6
• /
• pp.601-616
• /
• 2021

Retrial queueing models have been studied extensively in the literature. These have many practical applications, especially in service sectors. However, retrial queueing models have their own limitations. Typically, analyzing such models involve level-dependent quasi-birth-and-death processes, and hence some form of a truncation or an approximate method or simulation approach is needed to study in steady-state. Secondly, in general, the customers are not served on a first-come-first-served basis. The latter is the case when a new arrival may find a free server while prior arrivals are waiting in the retrial orbit due to the servers being busy during their arrivals. In this paper, we take a different approach to the study of multi-server retrial queues in which the signals are generated in such a way to provide a reasonably fair treatment to all the customers seeking service. Further, this approach makes the study to be level-independent quasi-birth-and-death process. This approach is different from any considered in the literature. Using matrix-analytic methods we analyze MAP/M/c-type retrial queueing models along with Poisson signals in steady-state. Illustrative numerical examples including a comparison with previously published retrial queues are presented and they show marked improvements in providing a quality of service to the customers.

• Journal of Korean Institute of Industrial Engineers
• /
• v.14 no.1
• /
• pp.17-30
• /
• 1988

The aim of this project is to analyze the queueing model with the two types of customers which either can wait unrestrictedly or wait restrictively in the system depending on the condition of service facility unless they may be served immediately. This model consists of the three-dimensional state space and then quasi birth-death process is formulated. The steady-state probabilities and measures of performance of this system are derived by using Matrix Geometric method.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.2
• /
• pp.131-142
• /
• 2005

This paper proposes queueing models for a Web server system which is composed of an infinite-buffer main server and finite-buffer auxiliary server(s). The system is modeled by the level-dependent quasi-birth- death (QBD) process. Utilizing the special structure of the QBD, we convert the infinite level-dependent QBD into a finite level-independent QBD and compute the state probabilities. We then explore the operational characteristics of the proposed web-server models and draw some useful conclusions.

• The KIPS Transactions:PartC
• /
• v.9C no.3
• /
• pp.399-406
• /
• 2002

We consider design of multiservice network link, in which connections of constant- and adaptive-rate services arrive and leave dynamically. We propose performance analysis and design methods of these dynamic multiservice networks. A multiservice network link is modeled by a Markov chain, and data rates for adaptive-rate connections are derived using QBD (Quasi-Birth-Death) processes and matrix-geometric equations. We estimate average number of adaptive-rate connections, average data rate and average connection delay. The performance of constant-rate connections is determined from the blocking probability of the connections. Based on the performance of constant-and adaptive- rate connections, we propose a design methods of a network link to satisfy performance requirements of constant- and adaptive-rate connections (data rates, delay, blocking probability). Our methods can be used for the analysis and design of network switch supporting dynamic data and voice (video) traffic simultaneously.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.41 no.2
• /
• pp.35-51
• /
• 2016

This paper proposes a new approximate approach to calculate the order fill rate and the probability of filling an entire customer order immediately from the shelf in a business environment under purchase dependence characterized by customer purchase patterns observed in such areas as marketing, manufacturing systems, and distribution systems. The new approximate approach divides customer orders into item orders and calculates fill rates of all order types to approximate the order fill rate. We develop a greed iterative search algorithm (GISA) based on the Gauss-Seidel method to avoid dimensionality and prevent the solution divergence for larger instances. Through the computational analysis that compares the GISA with the simulation, we demonstrate that the GISA is a dependable algorithm for deriving the stationary joint distribution of on-hand inventories in the type-K pure system. We also present some managerial insights.

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

Parallel lines are often used to increase production rate in many manufacturing systems where the main line splits into several lines in parallel, and after some operations, they merge into a main line again. Queueing networks with finite buffers have been widely used for modeling and analyzing manufacturing systems. This paper provides an approximation technique for multi-server two-stage networks with merge configuration and blocking which will be a building block for analysis of general manufacturing systems with parallel lines and merge configuration. The main idea of the method is to decompose the original system into subsystems that have two service stations with multiple servers, two buffers and external arrivals to the second stage are allowed. The subsystems are modeled by level dependent quasi-birth-and-death (LDQBD) process.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.40 no.4
• /
• pp.137-146
• /
• 2017

For the competitive business environment under purchase dependence, this paper proposes a new approximate calculation of order fill rate which is a probability of satisfying a customer order immediately using the existing inventory. Purchase dependence is different to demand dependence. Purchase dependence treats the purchase behavior of customers, while demand dependence considers demand correlation between items, between regions, or over time. Purchase dependence can be observed in such areas as marketing, manufacturing systems, and distribution systems. Traditional computational methods have a difficulty of the curse of dimensionality for the large cases, when deriving the stationary joint distribution which is utilized to calculate the order fill rate. In order to escape the curse of dimensionality and protect the solution from diverging for the large cases, we develop a greedy iterative search algorithm based on the Gauss-Seidel method. We show that the greedy iterative search algorithm is a dependable algorithm to derive the stationary joint distribution of on-hand inventories in the retailer system by conducting a comparison analysis of a greedy iterative search algorithm with the simulation. In addition, we present some managerial insights such as : (1) The upper bound of order fill rate can be calculated by the one-item pure system, while the lower bound can be provided by the pure system that consists of all items; (2) As the degree of purchase dependence declines while other conditions remain same, it is observed that the difference between the lower and upper bounds reduces, the order fill rate increases, and the order fill rate gets closer to the upper bound.