Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10339129 | Computer Networks | 2005 | 25 Pages |
Abstract
Moreover, the solution of a queue fed by multifractal flows is presented and an expression for the time at which the queue length reaches its maximum is derived. This time instant is used for the derivation of an efficient method for the computation of the equivalent bandwidth of multifractal flows. Furthermore, a policing mechanisms to assure the conformance of a flow to the multifractal envelope process is presented. It is also shown that a monofractal approach for modeling multifractal flows leads to overestimation of the bandwidth needed.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Networks and Communications
Authors
Cesar A.V. Melo, Nelson L.S. da Fonseca,