On the queue tail asymptotics for general multifractal traffic

8Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The tail asymptotics in an infinite capacity single server queue serviced at a constant rate and driven by general multifractal input process is presented. It has been shown that in the important subcase of the monofractal Fractional Brownian Motion (FBM) input traffic our result gives the well-known Weibullian tail. Practical engineering applications and validation of the results based on the analysis of measured network traffic have also been presented.

Cite

CITATION STYLE

APA

Molnár, S., Dang, T. D., & Maricza, I. (2002). On the queue tail asymptotics for general multifractal traffic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2345, pp. 105–116). Springer Verlag. https://doi.org/10.1007/3-540-47906-6_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free