Dimensioning bandwidth for elastic traffic in high-speed data networks

被引:59
作者
Berger, AW [1 ]
Kogan, Y [1 ]
机构
[1] AT&T Labs, Middletown, NJ 07748 USA
关键词
asymptotic approximation; asynchronous transfer mode; closed queueing networks; computer network; performance; effective bandwidths; Internet; traffic engineering; transmission control protocol;
D O I
10.1109/90.879350
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Simple and robust engineering rules for dimensioning bandwidth for elastic data traffic are derived for a single bottleneck link via normal approximations for a closed-queueing network (CQN) model in heavy traffic, Elastic data applications adapt to available bandwidth via a feedback control such as the transmission control protocol (TCP) or the available bit rate transfer capability in asynchronous transfer mode, The dimensioning rules satisfy a performance objective based on the mean or tail probability of the per-flow bandwidth. For the mean objective, we obtain a simple expression for the effective bandwidth of an elastic source. We provide a new derivation of the normal approximation in CQNs using more accurate asymptotic expansions and give an explicit estimate of the error in the normal approximation. A CQN model was chosen to obtain the desirable property that the results depend on the distribution of the file sizes only via the mean, and not the heavy-tail characteristics. Ne view the exogenous "load" in terms of the file sizes and consider the resulting flow of packets as dependent on the presence of other flows and the closed-loop controls. We compare the model with simulations, examine the accuracy of the asymptotic approximations, quantify the increase in bandwidth needed to satisfy the tail-probability performance objective as compared with the mean objective, and show regimes where statistical gain can and cannot be realized.
引用
收藏
页码:643 / 654
页数:12
相关论文
共 31 条
[1]  
[Anonymous], 1984, Random Perturbations of Dynamical Systems
[2]  
Balakrishnan H, 1999, COMP COMM R, V29, P175, DOI 10.1145/316194.316220
[3]   Bottleneck analysis in multiclass closed queueing networks and its application [J].
Berger, A ;
Bregman, L ;
Kogan, Y .
QUEUEING SYSTEMS, 1999, 31 (3-4) :217-237
[4]   Distribution of processor-sharing customers for a large closed system with multiple classes [J].
Berger, A ;
Kogan, Y .
SIAM JOURNAL ON APPLIED MATHEMATICS, 2000, 60 (04) :1330-1339
[5]  
BERGER AW, 1999, P 16 INT TEL C TEL E, P77
[6]  
Bertsekas D. P., 1992, DATA NETWORKS
[7]   Error bounds for asymptotic approximations of the partition function [J].
Birman, A ;
Kogan, Y .
QUEUEING SYSTEMS, 1996, 23 (1-4) :217-234
[8]  
Birman A, 1992, COMMUN STAT STOCH MO, V8, P543
[9]   EFFECTIVE BANDWIDTH IN HIGH-SPEED DIGITAL NETWORKS [J].
CHANG, CS ;
THOMAS, JA .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1995, 13 (06) :1091-1100
[10]   RESOURCE-MANAGEMENT IN WIDE-AREA ATM NETWORKS USING EFFECTIVE BANDWIDTHS [J].
DEVECIANA, G ;
KESIDIS, G ;
WALRAND, J .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1995, 13 (06) :1081-1090