The MDS Queue: Analysing the Latency Performance of Erasure Codes

In order to scale economically, data centers are increasingly evolving their data storage methods from the use of simple data replication to the use of more powerful erasure codes, which provide the same level of reliability as replication but at a significantly lower storage cost. In particular, it is well known that Maximum-Distance-Separable (MDS) codes, such as Reed-Solomon codes, provide the maximum storage efficiency. While the use of codes for providing improved reliability in archival storage systems, where the data is less frequently accessed (or so-called "cold data"), is well understood, the role of codes in the storage of more frequently accessed and active "hot data", where latency is the key metric, is less clear. In this paper, we study data storage systems based on MDS codes through the lens of queueing theory, and term this the "MDS queue." We analytically characterize the (average) latency performance of MDS queues, for which we present insightful scheduling policies that form upper and lower bounds to performance, and are observed to be quite tight. Extensive simulations are also provided and used to validate our theoretical analysis. We also employ the framework of the MDS queue to analyse different methods of performing so-called degraded reads (reading of partial data) in distributed data storage

Matrix-geometric solution of infinite stochastic Petri nets

We characterize a class of stochastic Petri nets that can be solved using matrix geometric techniques. Advantages of such on approach are that very efficient mathematical technique become available for practical usage, as well as that the problem of large state spaces can be circumvented. We first characterize the class of stochastic Petri nets of interest by formally defining a number of constraints that have to be fulfilled. We then discuss the matrix geometric solution technique that can be employed and present some boundary conditions on tool support. We illustrate the practical usage of the class of stochastic Petri nets with two examples: a queueing system with delayed service and a model of connection management in ATM network

Stability Region of a Slotted Aloha Network with K-Exponential Backoff

Stability region of random access wireless networks is known for only simple network scenarios. The main problem in this respect is due to interaction among queues. When transmission probabilities during successive transmissions change, e.g., when exponential backoff mechanism is exploited, the interactions in the network are stimulated. In this paper, we derive the stability region of a buffered slotted Aloha network with K-exponential backoff mechanism, approximately, when a finite number of nodes exist. To this end, we propose a new approach in modeling the interaction among wireless nodes. In this approach, we model the network with inter-related quasi-birth-death (QBD) processes such that at each QBD corresponding to each node, a finite number of phases consider the status of the other nodes. Then, by exploiting the available theorems on stability of QBDs, we find the stability region. We show that exponential backoff mechanism is able to increase the area of the stability region of a simple slotted Aloha network with two nodes, more than 40\%. We also show that a slotted Aloha network with exponential backoff may perform very near to ideal scheduling. The accuracy of our modeling approach is verified by simulation in different conditions.Comment: 30 pages, 6 figure

Isolating intrinsic noise sources in a stochastic genetic switch

The stochastic mutual repressor model is analysed using perturbation methods. This simple model of a gene circuit consists of two genes and three promotor states. Either of the two protein products can dimerize, forming a repressor molecule that binds to the promotor of the other gene. When the repressor is bound to a promotor, the corresponding gene is not transcribed and no protein is produced. Either one of the promotors can be repressed at any given time or both can be unrepressed, leaving three possible promotor states. This model is analysed in its bistable regime in which the deterministic limit exhibits two stable fixed points and an unstable saddle, and the case of small noise is considered. On small time scales, the stochastic process fluctuates near one of the stable fixed points, and on large time scales, a metastable transition can occur, where fluctuations drive the system past the unstable saddle to the other stable fixed point. To explore how different intrinsic noise sources affect these transitions, fluctuations in protein production and degradation are eliminated, leaving fluctuations in the promotor state as the only source of noise in the system. Perturbation methods are then used to compute the stability landscape and the distribution of transition times, or first exit time density. To understand how protein noise affects the system, small magnitude fluctuations are added back into the process, and the stability landscape is compared to that of the process without protein noise. It is found that significant differences in the random process emerge in the presence of protein noise

Exponential quasi-ergodicity for processes with discontinuous trajectories

This paper establishes exponential convergence to a unique quasi-stationary distribution in the total variation norm for a very general class of strong Markov processes. Specifically, we can treat nonreversible processes with discontinuous trajectories, which seems to be a substantial breakthrough. Considering jumps driven by Poisson Point Processes in two different applications, we intend to illustrate the potential of these results and motivate our criteria. Our set of conditions is expected to be much easier to verify than an implied property which is crucial in our proof, namely a comparison of asymptotic extinction rates between different initial conditions. Keywords : continuous-time and continuous-space Markov process , jumps , quasi-stationary distribution , survival capacity , Q-process , Harris recurrenc

On First-Passage Times and Sojourn Times in Finite QBD Processes and Their Applications in Epidemics

In this paper, we revisit level-dependent quasi-birth-death processes with finitely many possible values of the level and phase variables by complementing the work of Gaver, Jacobs, and Latouche (Adv. Appl. Probab. 1984), where the emphasis is upon obtaining numerical methods for evaluating stationary probabilities and moments of first-passage times to higher and lower levels. We provide a matrix-analytic scheme for numerically computing hitting probabilities, the number of upcrossings, sojourn time analysis, and the random area under the level trajectory. Our algorithmic solution is inspired from Gaussian elimination, which is applicable in all our descriptors since the underlying rate matrices have a block-structured form. Using the results obtained, numerical examples are given in the context of varicella-zoster virus infections