Markov-modulated Feedforward Fluid Networks
نویسنده
چکیده
With the aim of studying a multi-station feedforward uid network with Markov modulated input and output rates we rst study a two dimensional parallel network having the property that the second station cannot be empty unless the rst station is. A method for computing the steady state characteristics of such a process is given and it is shown that this can be used to determine the steady state characteristics of two dimensional tandem uid networks and more general networks. Finally a multi-station feedforward network is considered. Under appropriate conditions, it is explained how to determine the joint steady state Laplace-Stieltjes transform (LST) and it turns out that in order to compute conditional means and the co-variance structure (given the state of the underlying Markov chain) all that is needed is the methods developed for the two dimensional parallel model together with some trivial linear algebra.
منابع مشابه
Traffic Modeling in PLC Networks using a Markov Fluid Model with Autocorrelation Function Fitting
In this paper, we present an analysis of VoIP (Voice over IP) traffic and data transfer using PLC (PowerLine Communications) network. We propose a model based on MMFM (Markov Modulated Fluid Models) for data and VoIP traffic in PLC networks. Simulations and comparisons were carried out to verify the efficiency of the proposed traffic model over the Poisson and MMPP (Markov Modulated Poisson Pro...
متن کاملAttractor Dynamics in Feedforward Neural Networks
We study the probabilistic generative models parameterized by feedforward neural networks. An attractor dynamics for probabilistic inference in these models is derived from a mean field approximation for large, layered sigmoidal networks. Fixed points of the dynamics correspond to solutions of the mean field equations, which relate the statistics of each unit to those of its Markov blanket. We ...
متن کاملOn the Fluid Queue Driven by an Ergodic Birth and Death Process
Fluid models are powerful tools for evaluating the performance of packet telecommunication networks. By masking the complexity of discrete packet based systems, fluid models are in general easier to analyze and yield simple dimensioning formulas. Among fluid queuing systems, those with arrival rates modulated by Markov chains are very efficient to capture the burst structure of packet arrivals,...
متن کاملUniversal Approximation of Markov Kernels by Shallow Stochastic Feedforward Networks
We establish upper bounds for the minimal number of hidden units for which a binary stochastic feedforward network with sigmoid activation probabilities and a single hidden layer is a universal approximator of Markov kernels. We show that each possible probabilistic assignment of the states of n output units, given the states of k ≥ 1 input units, can be approximated arbitrarily well by a netwo...
متن کاملBurst-level congestion control using hindsight optimization
We consider the burst-level congestion control problem in a communication network with multiple traffic sources, modeled as infinite banks of fluid traffic. The controlled traffic shares a common bottleneck node with highpriority cross traffic modeled as Markov-modulated fluid. We introduce a simulation-based congestion control scheme capable of performing effectively under rapidly-varying serv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Queueing Syst.
دوره 37 شماره
صفحات -
تاریخ انتشار 2001