Related papers: Max-plus algebra models of queueing networks
A class of queueing networks which consist of single-server fork-join nodes with infinite buffers is examined to derive a representation of the network dynamics in terms of max-plus algebra. For the networks, we present a common dynamic…
Max-algebra models of tandem single-server queueing systems with both finite and infinite buffers are developed. The dynamics of each system is described by a linear vector state equation similar to those in the conventional linear systems…
This thesis proposes mathematical traffic models and control laws for metro lines with one junction. The models are based on the ones developed for linear metro lines (without junction) in [12, 14]. The train dynamics are described with a…
Simple lower and upper bounds on mean cycle time in stochastic acyclic fork-join queueing networks are derived using a (max,+)-algebra based representation of network dynamics. The behaviour of the bounds under various assumptions…
The application of the max-algebra to describe queueing systems by both linear scalar and vector equations is discussed. It is shown that these equations may be handled using ordinary algebraic manipulations. Examples of solving the…
We analyze the asymptotic behavior of sequences of random variables defined by an initial condition, a stationary and ergodic sequence of random matrices, and an induction formula involving multiplication is the so-called max-plus algebra.…
We propose a modeling framework for growing multiplexes where a node can belong to different networks. We define new measures for multiplexes and we identify a number of relevant ingredients for modeling their evolution such as the coupling…
We propose in this article an adaptation of the basic techniques of the deterministic network calculus theory to the road traffic flow theory. Network calculus is a theory based on min-plus algebra. It uses algebraic techniques to compute…
We show that for a certain class of dynamics at the nodes the response of a network of any topology to arbitrary inputs is defined in a simple way by its response to a monotone input. The nodes may have either a discrete or continuous set…
We consider (max,+)-algebra products of random matrices, which arise from performance evaluation of acyclic fork-join queueing networks. A new algebraic technique to examine properties of the product and investigate its limiting behaviour…
We introduce a model for the dynamic self-organization of the electric grid. The model is characterized by a conserved magnitude, energy, that can travel following the links of the network to satisfy nodes' load. The load fluctuates in time…
This thesis is entitled Dynamic programming systems for modeling and control of the traffic in transportation networks. Two parts are distinguished in this dissertation: 1) methods and approaches based on min-plus or max-plus algebra, where…
This paper considers a population process on a dynamically evolving graph, which can be alternatively interpreted as a queueing network. The queues are of infinite-server type, entailing that at each node all customers present are served in…
For a widely used hub-and-spoke closed product-form network consisting of an infinite-server node and several single-server queues, we characterize the maximum queue-length distribution in various operational regimes by leveraging a novel…
This paper presents a new framework for asynchrony. This has its origins in our attempts to better harness the internal decision making process of cellular automata (CA). Thus, we show that a max-plus algebraic model of asynchrony arises…
Stochastic network calculus is a newly developed theory for stochastic service guarantee analysis of computer networks. In the current stochastic network calculus literature, its fundamental models are based on the cumulative amount of…
Network calculus is a min-plus system theory for performance evaluation of queuing networks. Its elegance stems from intuitive convolution formulas for concatenation of deterministic servers. Recent research dispenses with the worst-case…
Service system dynamics occur at the interplay between customer behaviour and a service provider's response. This kind of dynamics can effectively be modeled within the framework of queuing theory where customers' arrivals are described by…
This paper considers a network of infinite-server queues with the special feature that, triggered by specific events, the network population vector may undergo a linear transformation (a `multiplicative transition'). For this model we…
This work examines the problem of topology inference over discrete-time nonlinear stochastic networked dynamical systems. The goal is to recover the underlying digraph linking the network agents, from observations of their state-evolution.…