No label defined (Q4945064)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1420992
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1420992 |
Statements
3 December 2001
0 references
finite buffer-queue
0 references
communication network
0 references
cell-loss probabilities
0 references
0.9191432
0 references
0.86936474
0 references
0.86169785
0 references
0.8585025
0 references
0.85449195
0 references
This paper is a review of some results on the discrete-time finite-buffer queueing system that arises in a communication network multiplexer fed by a self-similar cell traffic. The input traffic is an aggregation of independent source-active periods having Pareto-distributed lengths and arriving as Poisson batches. A source generates a Bernoulli sequence of cells. The asymptotic bounds to the buffer-overflow and cell-loss probabilities are given in some cases. The bounds decay polynomially with buffer-size growth and exponentially with excess of channel capacity over traffic rate. This shows that one can better combat traffic losses in communication networks by increasing channel capacity rather than buffer size. For the entire collection see [Zbl 0933.00056].
0 references