Asymptotic independence and a network traffic model

被引:52
作者
Maulik, K
Resnick, S
Rootzén, H
机构
[1] Cornell Univ, Sch Operat Res & Ind Engn, Ithaca, NY 14853 USA
[2] Chalmers Univ Technol, Dept Math, S-41296 Gothenburg, Sweden
关键词
asymptotic independence; M/G/infinity queue; network modeling; infinite source Poisson model; heavy tails; long-range dependence; random rates; Poisson input;
D O I
10.1017/S0021900200021975
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 [统计学]; 070103 [概率论与数理统计]; 0714 [统计学];
摘要
The usual concept of asymptotic independence, as discussed in the context of extreme value theory, requires the distribution of the coordinatewise sample maxima under suitable centering and scaling to converge to a product measure. However, this definition is too broad to conclude anything interesting about the tail behavior of the product of two random variables that are asymptotically independent. Here we introduce a new concept of asymptotic independence which allows us to study the tail behavior of products, We carefully discuss equivalent formulations of asymptotic independence. We then use the concept in the study of a network traffic model. The usual infinite source Poisson network model assumes that sources begin data transmissions at Poisson time points and continue for random lengths of time. It is assumed that the data transmissions proceed at a constant, nonrandom rate over the entire length of the transmission. However, analysis of network data suggests that the transmission rate is also random with a regularly varying tail. So, we modify the usual model to allow transmission sources to transmit at a random rate over the length of the transmission. We assume that the rate and the time have finite mean, infinite variance and possess asymptotic independence, as defined in the paper. We finally prove a limit theorem for the input process showing that the centered cumulative process under a suitable scaling converges to a totally skewed stable Levy motion in the sense of finite-dimensional distributions.
引用
收藏
页码:671 / 699
页数:29
相关论文
共 31 条
[1]
[Anonymous], STOCHASTIC PROCESS L
[2]
BASRAK B, 2000, THESIS RIJKSUNIVERSI
[3]
Billingsley P., 1999, CONVERGENCE PROBABIL
[4]
ON SOME LIMIT THEOREMS SIMILAR TO ARC-SIN LAW [J].
BREIMAN, L .
THEORY OF PROBILITY AND ITS APPLICATIONS,USSR, 1965, 10 (02) :323-&
[5]
Cunha C., 1995, TR95010 BOST U COMP
[6]
DEHAAN L, 1998, EXTREMES, V1, P7, DOI DOI 10.1023/A:1009909800311
[7]
Experimental queueing analysis with long-range dependent packet traffic [J].
Erramilli, A ;
Narayan, O ;
Willinger, W .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1996, 4 (02) :209-223
[8]
GUERIN CA, 1999, 1257 ORIE CORN U
[9]
Heath D, 1999, ANN APPL PROBAB, V9, P352
[10]
Asymptotic results for multiplexing subexponential on-off processes [J].
Jelenkovic, PR ;
Lazar, AA .
ADVANCES IN APPLIED PROBABILITY, 1999, 31 (02) :394-421