The consideration of multifractal properties in network traffic has become a well-known issue in network performance evaluation. We analyze the performance of a fluid flow buffer fed by multifractal traffic described by Norros, Mannersalo and Riedi [1]. We describe specific steps in fluid flow analysis, both for finite and infnite buffer sizes, and point out how toovercome numerical problems. We discuss performance results in form of waiting time quantiles and loss probabilities, which help to estimate whether a trffic concentrator constitutes a bottleneck or not.

I nätverks trafik så har multifraktala egenskaper uppmätts. Vi skapar processer med dessa egenskaper och använder sedan en fluid flow analys för att få fram prestanda mått.