1,518 research outputs found

    Stationary distributions of the multi-type ASEP

    Full text link
    We give a recursive construction of the stationary distribution of multi-type asymmetric simple exclusion processes on a finite ring or on the infinite line ZZ. The construction can be interpreted in terms of "multi-line diagrams" or systems of queues in tandem. Let qq be the asymmetry parameter of the system. The queueing construction generalises the one previously known for the totally asymmetric (q=0q=0) case, by introducing queues in which each potential service is unused with probability qkq^k when the queue-length is kk. The analysis is based on the matrix product representation of Prolhac, Evans and Mallick. Consequences of the construction include: a simple method for sampling exactly from the stationary distribution for the system on a ring; results on common denominators of the stationary probabilities, expressed as rational functions of qq with non-negative integer coefficients; and probabilistic descriptions of "convoy formation" phenomena in large systems.Comment: 54 pages, 4 figure

    A Robust Aggregation Approach To Simplification Of Manufacturing Flow Line Models

    Get PDF
    One of the more difficult tasks facing a modeler in developing a simulation model of a discrete part manufacturing system is deciding at what level of abstraction to represent the resources of the system. For example, questions about plant capacity can be modeled with a simple model, whereas questions regarding the efficiency of different part scheduling rules can only be answered with a more detailed model. In developing a simulation model, most of the actual features of the system under study must be ignored and an abstraction must be developed. If done correctly, this idealization provides a useful approximation of the real system. Unfortunately, many individuals claim that the process of building a simulation model is an “intuitive art.” The objective of this research is to introduce aspects of “science” to model development by defining quantitative techniques for developing an aggregate simulation model for estimating part cycle time of a manufacturing flow line. The methodology integrates aspects of queueing theory, a recursive algorithm, and simulation to develop the specifications necessary for combining resources of a flow line into a reduced set of aggregation resources. Experimentation shows that developing a simulation model with the aggregation resources results in accurate interval estimates of the average part cycle time

    Introduction to Queueing Theory and Stochastic Teletraffic Models

    Full text link
    The aim of this textbook is to provide students with basic knowledge of stochastic models that may apply to telecommunications research areas, such as traffic modelling, resource provisioning and traffic management. These study areas are often collectively called teletraffic. This book assumes prior knowledge of a programming language, mathematics, probability and stochastic processes normally taught in an electrical engineering course. For students who have some but not sufficiently strong background in probability and stochastic processes, we provide, in the first few chapters, background on the relevant concepts in these areas.Comment: 298 page

    High frequency dynamics of order flow

    Get PDF
    In this paper, we focus on the high frequency dynamics of limit order flow and market order flow. We compared the fitting performance of different models for the inter-arrival time of the order flow, including exponential distribution, gamma distribution and power law. We then studied the dependence of the placement of these two order flows, which can be captured by the self-excitation effect and mutual-excitation effect of Hawkes process. We also introduced a new model which combines the Hawkes features with the gamma distribution.\ud \ud Key words: High frequency dynamics; order flow; market microstructure; maximum likelihood estimation; Hawkes process; Hawkes-Gamma distribution

    Markovian arrivals in stochastic modelling: a survey and some new results

    Get PDF
    This paper aims to provide a comprehensive review on Markovian arrival processes (MAPs), which constitute a rich class of point processes used extensively in stochastic modelling. Our starting point is the versatile process introduced by Neuts (1979) which, under some simplified notation, was coined as the batch Markovian arrival process (BMAP). On the one hand, a general point process can be approximated by appropriate MAPs and, on the other hand, the MAPs provide a versatile, yet tractable option for modelling a bursty flow by preserving the Markovian formalism. While a number of well-known arrival processes are subsumed under a BMAP as special cases, the literature also shows generalizations to model arrival streams with marks, nonhomogeneous settings or even spatial arrivals. We survey on the main aspects of the BMAP, discuss on some of its variants and generalizations, and give a few new results in the context of a recent state-dependent extension.Peer Reviewe

    Approximate Analysis of an Unreliable M/M/2 Retrial Queue

    Get PDF
    This thesis considers the performance evaluation of an M/M/2 retrial queue for which both servers are subject to active and idle breakdowns. Customers may abandon service requests if they are blocked from service upon arrival, or if their service is interrupted by a server failure. Customers choosing to remain in the system enter a retrial orbit for a random amount of time before attempting to re-access an available server. We assume that each server has its own dedicated repair person, and repairs begin immediately following a failure. Interfailure times, repair times and times between retrials are exponentially distributed, and all processes are assumed to be mutually independent. Modeling the number of customers in the orbit and status of the servers as a continuous-time Markov chain, we employ a phase-merging algorithm to approximately analyze the limiting behavior. Subsequently, we derive approximate expressions for several congestion and delay measures. Using a benchmark simulation model, we assess the accuracy of the approximations and show that, when the algorithm assumptions are met, the approximation procedure yields favorable results. However, as the rate of abandonment for blocked arrivals decreases, the performance declines while the results are insensitive to the rate of abandonment of customers preempted by a server failure

    A study of self-similar traffic generation for ATM networks

    Get PDF
    This thesis discusses the efficient and accurate generation of self-similar traffic for ATM networks. ATM networks have been developed to carry multiple service categories. Since the traffic on a number of existing networks is bursty, much research focuses on how to capture the characteristics of traffic to reduce the impact of burstiness. Conventional traffic models do not represent the characteristics of burstiness well, but self-similar traffic models provide a closer approximation. Self-similar traffic models have two fundamental properties, long-range dependence and infinite variance, which have been found in a large number of measurements of real traffic. Therefore, generation of self-similar traffic is vital for the accurate simulation of ATM networks. The main starting point for self-similar traffic generation is the production of fractional Brownian motion (FBM) or fractional Gaussian noise (FGN). In this thesis six algorithms are brought together so that their efficiency and accuracy can be assessed. It is shown that the discrete FGN (dPGN) algorithm and the Weierstrass-Mandelbrot (WM) function are the best in terms of accuracy while the random midpoint displacement (RMD) algorithm, successive random addition (SRA) algorithm, and the WM function are superior in terms of efficiency. Three hybrid approaches are suggested to overcome the inefficiency or inaccuracy of the six algorithms. The combination of the dFGN and RMD algorithm was found to be the best in that it can generate accurate samples efficiently and on-the-fly. After generating FBM sample traces, a further transformation needs to be conducted with either the marginal distribution model or the storage model to produce self-similar traffic. The storage model is a better transformation because it provides a more rigorous mathematical derivation and interpretation of physical meaning. The suitability of using selected Hurst estimators, the rescaled adjusted range (R/S) statistic, the variance-time (VT) plot, and Whittle's approximate maximum likelihood estimator (MLE), is also covered. Whittle's MLE is the better estimator, the R/S statistic can only be used as a reference, and the VT plot might misrepresent the actual Hurst value. An improved method for the generation of self-similar traces and their conversion to traffic has been proposed. This, combined with the identification of reliable methods for the estimators of the Hurst parameter, significantly advances the use of self-similar traffic models in ATM network simulation
    corecore