Bandwidth estimation for best-effort Internet traffic

被引:6
作者
Cao, J
Cleveland, WS
Sun, DX
机构
[1] Bell Labs, Data Mining Res Dept, Murray Hill, NJ 07974 USA
[2] Purdue Univ, W Lafayette, IN 47907 USA
关键词
queueing; Erlang delay formula; nonlinear time series; long-range dependence; QoS; statistical multiplexing; Internet traffic; capacity planning;
D O I
10.1214/088342304000000260
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
A fundamental problem of Internet traffic engineering is bandwidth estimation: determining the bandwidth (bits per second) required to carry traffic with a specific bit rate (bits per second) offered to an Internet link and satisfy quality-of-service requirements. The traffic is packets of varying sizes that arrive for transmission on the link. Packets can queue up and are dropped if the queue size (bits) is bigger than the size of the buffer (bits) for the queue. For the predominant traffic on the Internet, best-effort traffic, quality metrics are the packet loss (fraction of lost packets), a queueing delay (seconds) and the delay probability (probability of a packet exceeding the delay). This article presents an introduction to bandwidth estimation and a solution to the problem of best-effort traffic for the case where the quality criteria specify negligible packet loss. The solution is a simple statistical model: (1) a formula for the bandwidth as a function of the delay, the delay probability, the traffic bit rate and the mean number of active host-pair connections of the traffic and (2) a random error term. The model is built and validated using queueing theory and extensive empirical study; it is valid for traffic with 64 host-pair connections or more, which is about 1 megabit/s of traffic. The model provides for Internet best-effort traffic what the Erlang delay formula provides for queueing systems with Poisson arrivals and i.i.d. exponential service times.
引用
收藏
页码:518 / 543
页数:26
相关论文
共 56 条
  • [1] [Anonymous], 1996, Journal of Computational and Graphical Statistics, DOI DOI 10.2307/1390777
  • [2] BENFREDJ S, 2001, P ACM SIGCOMM 2001, P111
  • [3] Effective bandwidths with priorities
    Berger, AW
    Whitt, W
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 1998, 6 (04) : 447 - 460
  • [4] Fast simulation of a queue fed by a superposition of many (heavy-tailed) sources
    Boots, NK
    Mandjes, M
    [J]. PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES, 2002, 16 (02) : 205 - 232
  • [5] LARGE DEVIATIONS, THE SHAPE OF THE LOSS CURVE, AND ECONOMIES OF SCALE IN LARGE MULTIPLEXERS
    BOTVICH, DD
    DUFFIELD, NG
    [J]. QUEUEING SYSTEMS, 1995, 20 (3-4) : 293 - 320
  • [6] Measurement and analysis of IP network usage and behavior
    Cáceres, R
    Duffield, N
    Feldmann, A
    Friedmann, JD
    Greenberg, A
    Greer, R
    Johnson, T
    Kalmanek, CR
    Krishnamurthy, B
    Lavelle, D
    Mishra, PP
    Rexford, J
    Ramakrishnan, KK
    True, FD
    van der Merwe, JE
    [J]. IEEE COMMUNICATIONS MAGAZINE, 2000, 38 (05) : 144 - 151
  • [7] Cao J, 2002, IEEE INFOCOM SER, P994, DOI 10.1109/INFCOM.2002.1019347
  • [8] Cao J, 2003, LECT NOTES STAT, V171, P83
  • [9] Cao J., 2001, Performance Evaluation Review, V29, P102, DOI 10.1145/384268.378440
  • [10] CAO J, 2004, FRACTINOAL SUM DIFFE