Product Forms for Stochastic Interference Systems (original) (raw)
Related papers
Ergodicity and steady state analysis for interference queueing networks
Stochastic Processes and Functional Analysis, 2021
We analyze an interacting queueing network on Z d \mathbb {Z}^d that was introduced in Sankararaman, Baccelli and Foss (2019) as a model for wireless networks. We show that the marginals of the minimal stationary distribution have exponential tails. This is used to furnish asymptotics for the maximum steady state queue length in growing boxes around the origin. We also establish a decay of correlations which shows that the minimal stationary distribution is strongly mixing, and hence, ergodic with respect to translations on Z d \mathbb {Z}^d .
Stochastic Modeling and Analysis of Communication Systems (SMACS)
2014
Abstract:- This paper concerns discrete-time queueing systems operating under a first-come-first-served queueing discipline, with deterministic service times of one slot and subject to independent server interruptions. We derive a relationship between the probability generating functions of the system contents during an arbitrary slot and of the system delay of an arbitrary customer. This relationship is valid regardless of the nature of the arrival process. From this relationship we derive a relationship between the first and second-order moments of the said distributions. We show that the relationship also applies to certain subsystems of the class of system considered, and to the queue of a multi-server queueing system with geometric service times and uninterrupted servers.
Analysis of stochastic Petri nets with signals
Performance Evaluation, 2012
Product-form models facilitate the efficient analysis of large stochastic models and have been sought after for some three decades. Apart from the dominating work on queueing networks, some product-forms were found for stochastic Petri nets (SPNs) that allow fork-join constructs and for queueing networks extended to include special customers called signals, viz. G-networks. We appeal to the Reversed Compound Agent Theorem (RCAT) to prove new product-form solutions for SPNs in which there are special transitions, the firings of which act in a similar way to signals in G-networks, but which may be generated by synchronised firings (or service completions) and may affect several places simultaneously. We show that SPNs with signals are strict generalisations of G-networks with negative customers, triggers and catastrophes, and illustrate with copious examples.
DISTRIBUTED STOCHASTIC HYBRID SYSTEMS
2000
Abstract: We consider a theoretical, but very general mathematical model of control systems, namely stochastic hybrid systems. Then we study how to dene concurrency for these systems. Copyright c 2005 IFAC Keywords: distributed, stochastic, hybrid systems; process algebra.
A Processor in Series with Demand-Interrupting Devices—A Stochastic Model
Journal of the ACM, 1975
In this paper there is considered a system with a processor rendering two types of serwce, so as to be able to take advantage of enforced idle times, which is connected to one or two demand-interrupting devices that feed back the programs to the processor. The dlstrzbution of the holding time in the processor and the utilization figures for all the components are computed under several assumptmns on the distributions of the serwces performed by the demand interrupting devices and the delay-type service performed by the processor The principal processor serwce duration is assumed to be exponentially distributed throughout the dlscussmn. KEY WORDS AND ~HRASES computer system, multlprogramming, demand-interrupting, feedback queue, Markov-chain analyms, residence time, delay service, auxiliary actlwty vR CATEGORIES: 6.9, 6.21 1. This paper is one in a series which presents analyses of mathematical models of multiprogramming (MP) computer systems. Such systems-and parts thereof-are modeled here by identifying their components with standard queueing-theoretical concepts, and analyzing the resultant queueing structures. 2. The underlying motivation and principles are given in [3]. We only mention that the models presented here are characterized (in addition to the real life situations they are designed to portray) by their amenability to analytical treatment, particularly the possibility of arriving at closed form expressions for the interesting quantities. 3. In this paper we are concerned with system configurations that include a central processor (with conventional paraphernalia like fast main memory, data transfer channels., supervisory and operating programs (OP)-all summed en bloc under the term CP) connected in a loop with demand-interrupting (DI) devices. Such a device is any attachment to the CP (e.g. a visual display unit, card reader, magnetic tape drive, etc.
Product Form Solution for Stochastic Automata Networks with synchronizations
We present a class of Stochastic Automata Networks (SAN) which exhibit a product formsolution if some generalized flow equations are satisfied. Unlike previous models on SAN withproduct form solutions, our model allows synchronizations between automata. This class ofSAN is a generalization of Jackson's queueing networks and Gelenbe's networks with positiveand negative customers .1 IntroductionStochastic Automata Networks (SAN for short) have been proposed by B. Plateau [10] as a...
Stochastically switched control systems
AIP Conference Proceedings, 2000
Stability is a global property of a system. It is concerned with the behaviour of whole systems over indefinitely long periods of time, for all admissible inputs and uncertainties. Stability and instability are ultimately topological properties. They depend on the topology of the space defined by the equations that govern the system. It follows that that instability is not linear. It is possible to construct a linear combination of two unstable systems which will be stable. The operation of linear combination can be performed using time averaging. The switching can be periodic or stochastic. In the stochastic case, the variance plays an important role. It is possible to drive a system into instability by making the variance sufficiently large. The behaviour near the limit of stability is quite complex, even for very simple "toy" systems. The stochastically switched system is not the same as a stationary linear filter, although we show that the power spectral densities of the two systems can appear to be very similar. We show that variation in the strength of a feedback loop is a new mechanism introducing noise into a system.
International Journal of Control
The problem addressed in this paper is the optimal allocation of a CPU to a number of software control tasks. Each task is used to implement a feedback controller for a linear and time invariant system and is activated with a fixed period. On every periodic activation, the task executes a job, which collects the output of the system, and produces the control values after executing for a random computation time. If a job's duration exceeds a deadline, then the job is cancelled and the control values are not updated. The systems to be controlled are affected by process noise. Therefore the performance of each control loop can be evaluated through the steady state covariance of the system's state, which depends on the probability with which the task implementing the controller drops its jobs. We show that by making a proper choice for the scheduling algorithm, this probability can be straightforwardly computed as a function of the scheduling parameters. This observation enables the construction of a very efficient procedure for finding the scheduling parameters that attain the optimal tradeoff between the performance of the different control loops.
Stochastic analysis of standby system with duplex units
Microelectronics Reliability, 1986
This paper investigates a mathematical model of a system composed of two units, one operative and the other cold standby. Each unit of the system is made of two non-identical parallel components and each component is made of n-elements. Henceforth we call each unit of the system a duplex unit. Failure and repair time distributions of each element of a component are negative exponential and vary from element to element, whereas the repair time distribution of a unit is arbitrary. Upon the failure of the operative unit the standby unit does not operate instantaneously. This type of situation may be found in many electronic networks. Several reliability characteristics of interest have been obtained.
An algebraic approach to the specification of stochastic systems
1998
Abstract We introduce a framework to study stochastic systems, ie systems in which the time of occurrence of activities is a general random variable. We introduce and discuss in depth a stochastic process algebra (named) adequate to specify and analyse those systems. In order to give semantics to, we also introduce a model that is an extension of traditional automata with clocks which are basically random variables: the stochastic automata model. We show that this model and are equally expressive.