9 results on '"Matrix analytic method"'
Search Results
2. Tail asymptotics in any direction of the stationary distribution in a two-dimensional discrete-time QBD process.
- Author
-
Ozawa, Toshihisa
- Subjects
- *
MATRIX analytic methods , *QUEUING theory , *LARGE deviations (Mathematics) , *RANDOM walks , *PROBABILITY theory - Abstract
We consider a discrete-time two-dimensional quasi-birth-and-death process (2d-QBD process for short) { (X n , J n) } on Z + 2 × S 0 , where X n = (X 1 , n , X 2 , n) is the level state, J n the phase state (background state) and S 0 a finite set, and study asymptotic properties of the stationary tail distribution. The 2d-QBD process is an extension of usual one-dimensional QBD process. By using the matrix analytic method of the queueing theory and the complex analytic method, we obtain the asymptotic decay rate of the stationary tail distribution in an arbitrary direction. This result is an extension of the corresponding result for a certain two-dimensional reflecting random work without background processes, obtained by using the large deviation techniques and the singularity analysis methods. We also present a condition ensuring the sequence of the stationary probabilities geometrically decays without power terms, asymptotically. Asymptotic properties of the stationary tail distribution in the coordinate directions in a 2d-QBD process have already been studied in the literature. The results of this paper are also important complements to those results. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
3. Stationary analyses for a double-ended queueing system with random service capacity and balking customers.
- Author
-
Bu, Qihui and Sun, Yun
- Subjects
- *
QUEUING theory , *CONSUMERS , *MATRIX analytic methods - Abstract
The queueing systems with a fixed batch size are commonly discussed in literatures. However, most real-life systems involve multiple types of servers with varying service capacities. To characterize this feature, random service capacity is considered in a double-ended queueing system in this paper, in which an arrival server can serve at most k customers with probability α k. Customers' threshold strategies are discussed based on the conditional expected waiting time and customers' beliefs in the number of servers in the orbit. Then, stationary analyses are conducted for this double-ended queueing system with random service capacity and balking customers, which includes establishing a sufficient stability condition, calculating the stationary distribution for system states and stationary performance measures. Finally, numerical examples are presented to explore how performance measures are influenced by system parameters. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
4. Analysis of a Batch Service Polling System in a Multi-phase Random Environment.
- Author
-
Jiang, Tao, Liu, Liwei, and Zhu, Yuanyuan
- Subjects
PROBABILITY theory ,MATRIX analytic methods ,MATRICES (Mathematics) ,WIRELESS sensor networks ,QUEUING theory - Abstract
In this paper, we consider a single-server multi-queue polling system with unlimited-size batch service (so called ‘Israeli queue’) operating in a multi-phase random environment. The polling system consists of a service region and a waiting region, and the external environment evolves through time, i.e., when the external environment is in state i, after a period time, it stays in this state or makes a transition from this state to its adjacent ones. By using matrix analytic method and spectral expansion method, stationary probabilities are derived for computations of performance measures and the conditional waiting times of customers in waiting region. In addition, some numerical examples are presented to show the impact of parameters on performance measures. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
5. OPTIMAL THRESHOLD CONTROL OF A RETRIAL QUEUEING SYSTEM WITH FINITE BUFFER.
- Author
-
GANG CHEN, ZAIMING LIU, and JINBIAO WU
- Subjects
MARKOV processes ,QUEUING theory ,MONOTONIC functions ,PARAMETER estimation ,OPTIMAL control theory - Abstract
In this paper, we analyze the optimal control of a retrial queueing system with finite buffer K. At any decision epoch, if the buffer is full, the controller have to make two decisions: one is for the new arrivals, to decide whether they are allowed to join the orbit or not (admission control); the other one is for the repeated customers, to decide whether they are allowed to get back to the orbit or not (retrial control). The problems are constructed as a Markov decision process. We show that the optimal policy has a threshold-type structure and the thresholds are monotonic in operating parameters and various cost parameters. Furthermore, based on the structure of the optimal policy, we construct a performance evaluation model for computing efficiently the thresholds. The expression of the expected cost is given by solving the quasibirth- and-death (QBD) process. Finally, we provide some numerical results to illustrate the impact of different parameters on the optimal policy and average cost. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
6. A queueing model for crowdsourcing.
- Author
-
Chakravarthy, Srinivas and Dudin, Alexander
- Subjects
QUEUING theory ,CROWDSOURCING ,MATRIX analytic methods ,CUSTOMER services ,FINITE element method - Abstract
Crowdsourcing is getting popular after a number of industries such as food, consumer products, hotels, electronics, and other large retailers bought into this idea of serving customers. In this paper, we introduce a multi-server queueing model in the context of crowdsourcing. We assume that two types, say, Type 1 and Type 2, of customers arrive to a c-server queueing system. A Type 1 customer has to receive service by one of c servers while a Type 2 customer may be served by a Type 1 customer who is available to act as a server soon after getting a service or by one of c servers. We assume that a Type 1 customer will be available for serving a Type 2 customer (provided there is at least one Type 2 customer waiting in the queue at the time of the service completion of that Type 1 customer) with probability $$p, 0 \le p \le 1$$ . With probability $$q = 1 - p$$ , a Type 1 customer will opt out of serving a Type 2 customer provided there is at least one Type 2 customer waiting in the system. Upon completion of a service a free server will offer service to a Type 1 customer on an FCFS basis; however, if there are no Type 1 customers waiting in the system, the server will serve a Type 2 customer if there is one present in the queue. If a Type 1 customer decides to serve a Type 2 customer, for our analysis purposes that Type 2 customer will be removed from the system as Type 1 customer will leave the system with that Type 2 customer. Under the assumption of exponential services for both types of customers we study the model in steady state using matrix analytic methods and establish some results including explicit ones for the waiting time distributions. Some illustrative numerical examples are presented. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
7. Asymptotics for the stationary distribution in a discrete-time two-dimensional quasi-birth-and-death process.
- Author
-
Ozawa, Toshihisa
- Subjects
- *
STATIONARY processes , *MATRIX analytic methods , *QUEUING theory , *INFORMATION networks , *MARKOV processes - Abstract
We consider a discrete-time two-dimensional process $\{(L_{n}^{(1)},L_{n}^{(2)})\}$ on $\mathbb{Z}_{+}^{2}$ with a background process { J} on a finite set, where individual processes $\{L_{n}^{(1)}\}$ and $\{L_{n}^{(2)}\}$ are both skip free. We assume that the joint process $\{Y_{n}\}=\{(L_{n}^{(1)},L_{n}^{(2)},J_{n})\}$ is Markovian and that the transition probabilities of the two-dimensional process $\{(L_{n}^{(1)},L_{n}^{(2)})\}$ are modulated depending on the state of the background process { J}. This modulation is space homogeneous, but the transition probabilities in the inside of $\mathbb{Z}_{+}^{2}$ and those around the boundary faces may be different. We call this process a discrete-time two-dimensional quasi-birth-and-death (2D-QBD) process, and obtain the decay rates of the stationary distribution in the coordinate directions. We also distinguish the case where the stationary distribution asymptotically decays in the exact geometric form, in the coordinate directions. [ABSTRACT FROM AUTHOR]
- Published
- 2013
- Full Text
- View/download PDF
8. Response Time Distribution in a D-MAP/PH/1 Queue with General Customer Impatience.
- Author
-
Van Velthoven, J., Van Houdt, B., and Blondia, C.
- Subjects
- *
QUEUING theory , *PRODUCTION scheduling , *STOCHASTIC processes , *MATRICES (Mathematics) , *ABSTRACT algebra - Abstract
This paper presents two methods to calculate the response time distribution of impatient customers in a discrete-time queue with Markovian arrivals and phase-type services, in which the customers’ patience is generally distributed (i.e., the D-MAP/PH/1 queue). The first approach uses a GI/M/1 type Markov chain and may be regarded as a generalization of the procedure presented in Van Houdt [14] for the D-MAP/PH/1 queue, where every customer has the same amount of patience. The key construction in order to obtain the response time distribution is to set up a Markov chain based on the age of the customer being served, together with the state of the D-MAP process immediately after the arrival of this customer. As a by-product, we can also easily obtain the queue length distribution from the steady state of this Markov chain. We consider three different situations: (i) customers leave the system due to impatience regardless of whether they are being served or not, possibly wasting some service capacity, (ii) a customer is only allowed to enter the server if he is able to complete his service before reaching his critical age and (iii) customers become patient as soon as they are allowed to enter the server. In the second part of the paper, we reduce the GI/M/1 type Markov chain to a Quasi-Birth-Death (QBD) process. As a result, the time needed, in general, to calculate the response time distribution is reduced significantly, while only a relatively small amount of additional memory is needed in comparison with the GI/M/1 approach. We also include some numerical examples in which we apply the procedures being discussed. [ABSTRACT FROM AUTHOR]
- Published
- 2005
- Full Text
- View/download PDF
9. Approximated Transient Queue Length and Waiting Time Distributions via Steady State Analysis.
- Author
-
Van Houdt, B. and Blondia, C.
- Subjects
- *
QUEUING theory , *PRODUCTION scheduling , *STOCHASTIC processes , *MARKOV processes , *MATRICES (Mathematics) - Abstract
We propose a method to approximate the transient performance measures of a discrete time queueing system via a steady state analysis. The main idea is to approximate the system state at time slot t or on the n -th arrival–-depending on whether we are studying the transient queue length or waiting time distribution–-by the system state after a negative binomially distributed number of slots or arrivals. By increasing the number of phases k of the negative binomial distribution, an accurate approximation of the transient distribution of interest can be obtained. In order to efficiently obtain the system state after a negative binomially distributed number of slots or arrivals, we introduce so-called reset Markov chains, by inserting reset events into the evolution of the queueing system under consideration. When computing the steady state vector of such a reset Markov chain, we exploit the block triangular block Toeplitz structure of the transition matrices involved and we directly obtain the approximation from its steady state vector. The concept of the reset Markov chains can be applied to a broad class of queueing systems and is demonstrated in full detail on a discrete-time queue with Markovian arrivals and phase-type services (i.e., the D-MAP/PH/1 queue). We focus on the queue length distribution at time t and the waiting time distribution of the n -th customer. Other distributions, e.g., the amount of work left behind by the n -th customer, that can be acquired in a similar way, are briefly touched upon. Using various numerical examples, it is shown that the method provides good to excellent approximations at low computational costs–-as opposed to a recursive algorithm or a numerical inversion of the Laplace transform or generating function involved–-offering new perspectives to the transient analysis of practical queueing systems. [ABSTRACT FROM AUTHOR]
- Published
- 2005
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.