zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Self-similar communication models and very heavy tails. (English) Zbl 1083.60521
Summary: Several studies of file sizes either being downloaded or stored in the World Wide Web have commented that tails can be so heavy that not only variances are infinite, but so are means. Motivated by this fact, we study the infinite node Poisson model under the assumption that transmission times are heavy tailed with infinite mean. The model is unstable but we are able to provide growth rates. Self-similar but nonstationary Gaussian process approximations are provided for the number of active sources, cumulative input, buffer content and time to buffer overflow.
60K25Queueing theory
60F05Central limit and other weak theorems
60F10Large deviations
60F17Functional limit theorems; invariance principles
60G18Self-similar processes
68U35Information systems (hypertext navigation, interfaces, decision support, etc.)
94C99Circuits, networks