Article
Licensed
Unlicensed
Requires Authentication
An asynchronous double stochastic flow with initiation of superfluous events
-
A. M. Gortsev
Published/Copyright:
July 15, 2011
Abstract
We consider an asynchronous double stochastic flow with initiation of superfluous events (a generalised asynchronous flow), which is a mathematical model of information flows in computer networks, communication systems, etc. We study the stationary mode of the flow. We find the probability density p(τ) of the length of the interval between events in the flow and the joint probability density p(τ1, τ2) of the lengths of two neighbouring intervals. We show that the generalised asynchronous flow is a correlated flow in the general case. We find conditions for the flow to become recursive or to degenerate into an elementary one.
Received: 2007-12-14
Published Online: 2011-07-15
Published in Print: 2011-July
© de Gruyter 2011
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Prohibitions in discrete probabilistic statistical problems
- An asynchronous double stochastic flow with initiation of superfluous events
- Asymptotic expansions for the distribution of the number of components in random mappings and partitions
- Symmetric linear spaces of graphs
- On automorphisms of commutative Moufang loops
- On the mixing properties of operations in a finite field
- The predicate method to construct the Post lattice
- Average complexity of searching for identical objects in random nonuniform databases
- On construction of efficient algorithms for solving systems of polynomial Boolean equations by testing a part of variables
Articles in the same Issue
- Prohibitions in discrete probabilistic statistical problems
- An asynchronous double stochastic flow with initiation of superfluous events
- Asymptotic expansions for the distribution of the number of components in random mappings and partitions
- Symmetric linear spaces of graphs
- On automorphisms of commutative Moufang loops
- On the mixing properties of operations in a finite field
- The predicate method to construct the Post lattice
- Average complexity of searching for identical objects in random nonuniform databases
- On construction of efficient algorithms for solving systems of polynomial Boolean equations by testing a part of variables
