In this paper we propose a novel MATLAB tool, called Q-MAM, to compute queue length, waiting time and sojourn time distributions of various discrete and continuous time queuing systems with an underlying structured Markov chain/process. The underlying paradigms include M/G/1and GI/M/1-type, quasi-birth-death and non-skip-free Markov chains (implemented by the SMCSolver tool), as well as Markov ...

Characterization protocols have so far played a central role in the development of noisy intermediate-scale quantum (NISQ) computers capable impressive feats. This trajectory is expected to continue building next generation devices—ones that can surpass classical for particular tasks—but progress characterization must keep up with complexities intricate device noise. A missing piece zoo procedu...

This paper studies two stochastic batch Markovian arrival and batch Markovian service single server queue BMAP/BMSP/1 queue Models (A) and (B) with randomly varying k* distinct environments. The arrival process of the queue has matrix representation {Dm i : 0 ≤ m ≤ M} of order ki describing the BMAP and the service process has matrix representation {Sn i : 0 ≤ n ≤ N} of order k′i describing the...

We derive the performance measures for non-priority customers in a priority single-server queue with two types of Markovian arrival processes (MAPs). One type of customers has preemptive resume (or repeat) priority over the other. We regard the model with two types of MAP arrivals as an MAP/SM/l queue with only non-priority customers arrivals, semi-Markovian service times and some server vacati...

This paper presents the analysis of a finite buffer renewal input queue wherein the customers can decide either to join the queue with a probability or to balk. The service process is Markovian service process (MSP ) governed by an underlyingm-state Markov chain. Employing the supplementary variable and embedded Markov chain techniques, the steadystate system length distributions at pre-arrival...

The growing use of clusters in diverse applications, many of which have real-time constraints, requires Qualityof-Service (QoS) support from the underlying cluster interconnect. In this paper, we propose an analytical model that captures the characteristics of a QoS capable wormhole router, which is the basic building block of cluster networks. The model captures the behavior of integrated traf...

— A finite-state, discrete-time Markovian décision process, in which, each action in each state is a feasible solution to a state dependent assignment problème is considered, The objective is to maximize the additive rewards realized by the assignments over an infinité time horizon. In the undiscounted case, the average gain per transition and in the discounted case, the discounted total gain r...

This paper analyzes a single-server finite-buffer vacation (single and multiple) queue wherein the input process follows a discrete-time batch Markovian arrival process (D-BMAP). The service and vacation times are generally distributed and their durations are integral multiples of a slot duration. We obtain the state probabilities at service completion, vacation termination, arbitrary, and prea...