On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Proof of a fundamental result in self-similar traffic modeling
ACM SIGCOMM Computer Communication Review
Dynamics of IP traffic: a study of the role of variability and the impact of control
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
On the equivalent bandwidth of self-similar sources
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on modeling and simulation of communication networks
Performance Guarantees in Communication Networks
Performance Guarantees in Communication Networks
Analysis on Generalized Stochastically Bounded Bursty Traffic for Communication Networks
LCN '02 Proceedings of the 27th Annual IEEE Conference on Local Computer Networks
Time Scale Analysis of an ATM Queueing System With Long-Range Dependent Traffic
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Scaling properties of statistical end-to-end bounds in the network calculus
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
IEEE/ACM Transactions on Networking (TON)
A network calculus with effective bandwidth
IEEE/ACM Transactions on Networking (TON)
Stochastic Network Calculus
Statistical service assurances for traffic scheduling algorithms
IEEE Journal on Selected Areas in Communications
On the use of fractional Brownian motion in the theory of connectionless networks
IEEE Journal on Selected Areas in Communications
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Fractional Brownian motion (fBm) emerged as a useful model for self-similar and long-range dependent Internet traffic. Asymptotic, respectively, approximate performance measures are known from large deviations theory for single queuing systems with fBm traffic. In this paper we prove a rigorous sample path envelope for fBm that complements previous results. We find that both approaches agree in their outcome that overflow probabilities for fBm traffic have a Weibull tail. We show numerical results on the impact of the variability and the correlation of fBm traffic on the queuing performance.