QoS-aware bandwidth provisioning for IP network links

被引:32
作者
van den Berg, H
Mandjes, M
van de Meent, R
Pras, A
Roijers, F
Venemans, P
机构
[1] TNO, Informat & Comm Technol, NL-2600 GB Delft, Netherlands
[2] Univ Twente, NL-7500 AE Enschede, Netherlands
[3] CWI, NL-1009 AB Amsterdam, Netherlands
关键词
bandwidth provisioning; quality of service; traffic measurements; Gaussian traffic; M/G/infinity input;
D O I
10.1016/j.comnet.2005.05.028
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Current bandwidth provisioning procedures for IP network links are mostly based on simple rules of thumb, using coarse traffic measurements made on a time scale of e.g., 5 or 15 min. A crucial question., however, is whether such coarse measurements give any useful insight into the capacity actually needed: QoS degradation experienced by the users is strongly affected by traffic rate fluctuations on a much smaller time scale. The present paper addresses this question. The goal is to develop provisioning procedures that require a minimal measurement effort. The bandwidth provisioning formula that we propose (and which we justify under minimal model assumptions) is of the form rho + alpha root rho. Here rho (in Mbit/s) is the load of the system, which can evidently be estimated by coarse traffic measurements (e.g., 5 or 15 min measurements). The a depends on the characteristics of the individual flows and the QoS requirements. The QoS measure used is the probability that the traffic supply exceeds the available bandwidth, over some predefined (small) interval T, is below some small fixed number epsilon. The impact of changing the 'QoS parameters'. i.e., T and epsilon, on the coefficient alpha is explicitly given. The validity of the bandwidth provisioning rule is assessed through extensive measurements performed in several operational network environments. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:631 / 647
页数:17
相关论文
共 21 条
[1]   Most probable paths and performance formulae for buffers with Gaussian input traffic [J].
Addie, R ;
Mannersalo, P ;
Norros, I .
EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, 2002, 13 (03) :183-196
[2]   Performance evaluation of a queue fed by a Poisson Pareto burst process [J].
Addie, RG ;
Neame, TD ;
Zukerman, M .
COMPUTER NETWORKS, 2002, 40 (03) :377-397
[3]  
[Anonymous], 2003, A first course in stochastic models
[4]  
[Anonymous], 1996, 242 COST
[5]  
BENFREDJ S, 2001, P SIGCOMM 01 SAN DIE
[6]   Congestion at flow level and the impact of user behaviour [J].
Bonald, T ;
Roberts, JW .
COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING, 2003, 42 (04) :521-536
[7]   Self-similarity in World Wide Web traffic: Evidence and possible causes [J].
Crovella, ME ;
Bestavros, A .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1997, 5 (06) :835-846
[8]   A NEW APPROACH FOR ALLOCATING BUFFERS AND BANDWIDTH TO HETEROGENEOUS, REGULATED TRAFFIC IN AN ATM NODE [J].
ELWALID, A ;
MITRA, D ;
WENTWORTH, RH .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1995, 13 (06) :1115-1127
[9]   Effective Bandwidth of General Markovian Traffic Sources and Admission Control of High Speed Networks [J].
Elwalid, Anwar I. ;
Mitra, Debasis .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1993, 1 (03) :329-343
[10]  
FIEDLER M, 1999, COST257