User-level performance of elastic traffic in a differentiated-services environment

被引:8
作者
Borst, SC
Núñez-Queija, R
van Uitert, MJG
机构
[1] CWI, NL-1090 GB Amsterdam, Netherlands
[2] Eindhoven Univ Technol, Dept Math & Comp Sci, NL-5600 MB Eindhoven, Netherlands
[3] Bell Labs, Lucent Technol, Murray Hill, NJ 07974 USA
关键词
delay asymptotics; differentiated services; generalized processor sharing (GPS); heavy-tailed traffic; processor sharing;
D O I
10.1016/S0166-5316(02)00117-7
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We consider a system with two service classes, one of which supports elastic traffic. The traffic characteristics of the other class can be completely general, allowing streaming applications as an important special case. The link capacity is shared between the two traffic classes in accordance with the generalized processor sharing (GPS) discipline. GPS-based scheduling algorithms, such as weighted fair queuing, provide a flexible mechanism for service differentiation and prioritization. We examine the user-level performance of the elastic traffic. The elastic traffic users randomly initiate file transfers with a heavy-tailed distribution. Within the elastic traffic class, the active flows share the available bandwidth in an ordinary processor-sharing (PS) fashion. The PS discipline has emerged as a natural paradigm for evaluating the user-perceived performance of bandwidth sharing algorithms like TCR For a certain parameter range, we establish that the transfer delay incurred by the elastic traffic flows is asymptotically equivalent to that in an isolated PS system with constant service rate. This service rate is only affected by the streaming traffic through its average rate. Specifically, the elastic traffic is largely immune from possible adverse traffic characteristics or performance degradation due to prioritization of the streaming traffic. This confirms that GPS-based multiplexing mechanisms achieve significantly better performance for both traffic classes than a static bandwidth partitioning approach. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:507 / 519
页数:13
相关论文
共 19 条
[1]   On a reduced load equivalence for fluid queues under subexponentiality [J].
Agrawal, R ;
Makowski, AM ;
Nain, P .
QUEUEING SYSTEMS, 1999, 33 (1-3) :5-41
[2]  
BLAKE S, 1999, 2475 IETF RFC
[3]  
Borst S., 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), P912, DOI 10.1109/INFCOM.2000.832266
[4]  
BORST SC, IN PRESS QUEUEING SY
[5]  
BORST SC, 1999, P 37 ANN ALL C COMM
[6]  
CROVELLA ME, 1996, P ACM SIGMETRICS 96, P160
[7]   ON THE TRANSIENT-BEHAVIOR OF THE PROCESSOR SHARING QUEUE [J].
JEANMARIE, A ;
ROBERT, P .
QUEUEING SYSTEMS, 1994, 17 (1-2) :129-136
[8]  
Jelenkovic P, 2002, IEEE INFOCOM SER, P1316, DOI 10.1109/INFCOM.2002.1019382
[9]  
Kotopoulos C, 2001, IEEE INFOCOM SER, P299, DOI 10.1109/INFCOM.2001.916712
[10]  
MMASSOULIE L, 1999, P INF 1999 C NEW YOR, P1395