Granular differentiated queueing services for QoS: Structure and cost model

被引:11
作者
Jiang, SM [1 ]
机构
[1] S China Univ Technol, Sch Elect & Informat Engn, Guangzhou, Peoples R China
关键词
service granularity; end-to-end QoS; differentiated queueing services (DQS);
D O I
10.1145/1064413.1064416
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
One weakness of DiffServ is the lack of granularity for QoS guaranteed services, which makes it difficult to cost-effectively support end-to-end (e2e) QoS according to the e2e situation (e.g., path lengths) of applications. With the conventional packet-level QoS mechanisms for the regulated traffic, i.e., buffer admission control plus output schedulers in general, increasing service granularity may inevitably complicate implementation and/or impact scalability since sophisticated output schedulers seem necessary in this case. In this paper, a new structure, Differentiated Queueing Services (DQS), is discussed to handle the above issue. DQS tries to provide granular and scalable QoS guaranteed services to be selected by users according to their QoS requirements and e2e situation. Its basic idea is to convert packet delay guarantee into packet loss ratio guarantee with either dropping or marking the packets whose e2e delays are perceived unable to be guaranteed. Packets are queued according to their e2e delay requirements so that various delay bounds can be guaranteed without using sophisticated output schedulers while different packet loss ratios are mainly controlled by call admission control (CAC). To this end, the e2e QoS requirement is carried by each packet to avoid storing such information in network units for scalability. On the other hand, differentiated services should also be accomplished with a differentiated cost model for pricing, not only for the profits of both the service provider and the user, but also to prevent good services from being abused. So, a cost model for differentiated QoS services provided by DQS is also discussed with a possible CAC based on the exponentially bounded burstiness traffic.
引用
收藏
页码:13 / 22
页数:10
相关论文
共 42 条
[1]   STOCHASTIC-THEORY OF A DATA-HANDLING SYSTEM WITH MULTIPLE SOURCES [J].
ANICK, D ;
MITRA, D ;
SONDHI, MM .
BELL SYSTEM TECHNICAL JOURNAL, 1982, 61 (08) :1871-1894
[2]  
[Anonymous], 1975, QUEUEING SYSTEMS
[3]   Quality of service and flow level admission control in the Internet [J].
Benameur, N ;
Ben Fredj, S ;
Oueslati-Boulahia, S ;
Roberts, JW .
COMPUTER NETWORKS, 2002, 40 (01) :57-71
[4]   Effective bandwidths with priorities [J].
Berger, AW ;
Whitt, W .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1998, 6 (04) :447-460
[5]   Extending the effective bandwidth concept to networks with priority classes [J].
Berger, AW ;
Whitt, W .
IEEE COMMUNICATIONS MAGAZINE, 1998, 36 (08) :78-83
[6]  
Biton E, 2003, TELETRAF SCI ENG, V5A-B, P1061
[7]  
BITON E, QOS PROVISION EDF SC
[8]  
BLAKE S, 1998, 2475 IETF RFC DEC
[9]  
BRADEN B, 1998, 2309 IETF RFC APR
[10]  
CHARNY A, 2002, 3247 IETF RFC MAR