| dc.creator | Melo, CAV | |
| dc.creator | da Fonseca, NLS | |
| dc.date | 2005 | |
| dc.date | 44348 | |
| dc.date | 2014-11-18T04:21:42Z | |
| dc.date | 2015-11-26T17:46:28Z | |
| dc.date | 2014-11-18T04:21:42Z | |
| dc.date | 2015-11-26T17:46:28Z | |
| dc.date.accessioned | 2018-03-29T00:28:59Z | |
| dc.date.available | 2018-03-29T00:28:59Z | |
| dc.identifier | Computer Networks-the International Journal Of Computer And Telecommunications Networking. Elsevier Science Bv, v. 48, n. 3, n. 351, n. 375, 2005. | |
| dc.identifier | 1389-1286 | |
| dc.identifier | WOS:000229174000005 | |
| dc.identifier | http://www.repositorio.unicamp.br/jspui/handle/REPOSIP/64911 | |
| dc.identifier | http://www.repositorio.unicamp.br/handle/REPOSIP/64911 | |
| dc.identifier | http://repositorio.unicamp.br/jspui/handle/REPOSIP/64911 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/1288493 | |
| dc.description | Internet Protocol flows present high variability at small time scales as well as long range dependence, which can be captured by multifractal models. Estimating the bandwidth to support the Quality of Service required by these flows is the key to Traffic Engineering. This paper introduces a novel envelope process which is a minimalist yet accurate model for multifractal flows. The envelope process is an upper bound to the volume of arrivals from a multifractal Brownian motion. The envelope process accuracy was assessed using both real network traces and synthetically generated traces. 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. © 2005 Elsevier B.V. All rights reserved. | |
| dc.description | 48 | |
| dc.description | 3 | |
| dc.description | 351 | |
| dc.description | 375 | |
| dc.language | en | |
| dc.publisher | Elsevier Science Bv | |
| dc.publisher | Amsterdam | |
| dc.publisher | Holanda | |
| dc.relation | Computer Networks-the International Journal Of Computer And Telecommunications Networking | |
| dc.relation | Comput. Netw. | |
| dc.rights | fechado | |
| dc.rights | http://www.elsevier.com/about/open-access/open-access-policies/article-posting-policy | |
| dc.source | Web of Science | |
| dc.subject | multifractal flows | |
| dc.subject | traffic engineering | |
| dc.subject | long-range dependence | |
| dc.subject | Networks | |
| dc.subject | Model | |
| dc.title | Envelope process and computation of the equivalent bandwidth of multifractal flows | |
| dc.type | Artículos de revistas | |
