The main findings are the probability density function of thefLm process, several scaling results related to a single-server infinite buffer queue fed by fLm traffic, and an asymptotic lower bound for the probability of overflow.
About:
This article is published in Computer Networks.The article was published on 2002-10-22 and is currently open access. It has received 72 citations till now. The article focuses on the topics: Stochastic process & Probability density function.
TL;DR: How certain complexity barriers have been surmounted using newly applied theoretical concepts such as aging, renewal, non-ergodic statistics and the fractional calculus is reviewed.
TL;DR: The concept of generalized stochastically bounded burstiness (gSBB) for Internet traffic is introduced, the tail distribution of whose burstiness can be bounded by a decreasing function in a function class with few restrictions.
TL;DR: This work presents another stochastic model, generalized Stochastically Bounded Burstiness (gSBB), which is based on the virtual backlog property of the input process, and introduces a stochastically ordering monotonicity property of gSBB.
TL;DR: Self-organized criticality (SOC) was suggested in the mid 1990s as a more proper paradigm to describe the dynamics of tokamak plasma transport in near-marginal conditions as discussed by the authors.
TL;DR: This book is a blend of erudition, popularization, and exposition, and the illustrations include many superb examples of computer graphics that are works of art in their own right.
TL;DR: The Riemann-Liouville Fractional Integral Integral Calculus as discussed by the authors is a fractional integral integral calculus with integral integral components, and the Weyl fractional calculus has integral components.
TL;DR: It is demonstrated that Ethernet LAN traffic is statistically self-similar, that none of the commonly used traffic models is able to capture this fractal-like behavior, and that such behavior has serious implications for the design, control, and analysis of high-speed, cell-based networks.
TL;DR: It is found that user-initiated TCP session arrivals, such as remote-login and file-transfer, are well-modeled as Poisson processes with fixed hourly rates, but that other connection arrivals deviate considerably from Poisson.