Charging multi-dimensional QoS with the Cumulus Pricing Scheme

被引:0
作者
Reichl, P [1 ]
Stiller, B [1 ]
Ziegler, T [1 ]
机构
[1] Telecommun Res Ctr Vienna, A-1040 Vienna, Austria
来源
INTERNET PERFORMANCE AND CONTROL OF NETWORK SYSTEMS II | 2001年 / 4523卷
关键词
Internet pricing; QoS; NUT trilemma; cumulus pricing scheme; Internet charging system;
D O I
10.1117/12.434323
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The recently established Cumulus Pricing Scheme (CPS) has turned out to be a novel approach for efficiently charging differentiated Internet services, based on integrating different time-scales into one edge-pricing mechanism. Depending on an initial specification of expected resource requirements, customer and provider negotiate a contract fixing a flat rate charge for QoS delivery. As soon as the scheme has started, the customer receives a continuous coarse-grained feedback about her real resource consumption. To this end, over- or underutilization are expressed in terms of Cumulus Points CP, whose accumulation may indicate an imbalance between specified and actually monitored traffic and eventually requires to adapt the contract accordingly. This paper extends the original CPS for services that are characterized not only by their bandwidth or volume requirements, but by general QoS parameters. Starting with a discussion on CPS for different one-dimensional QoS parameters, consequences for the basic CPS mechanism are investigated, covering especially the determination of relevant thresholds for CPs. These investigations deliver crucial input for the specification of multi-dimensional QoS vectors within the initial contract. Suitable metrics are introduced and applied in order to reduce the complexity of the contract as well as of the different monitoring methods. Finally, the implementation of the extended scheme within an Internet Charging System is discussed.
引用
收藏
页码:272 / 283
页数:12
相关论文
共 27 条
  • [1] Almes G., 1999, document RFC 2680
  • [2] Altmann J., 2001, Netnomics, V3, P67, DOI 10.1023/A:1009944726255
  • [3] [Anonymous], 1998, 2330 RFC
  • [4] [Anonymous], 1999, REQUEST FOR COMMENTS, DOI DOI 10.17487/RFC2679
  • [5] CHELIOTIS G, 1999, WORKSH INT SERV QUAL
  • [6] COSTA L, 2000, DISTANCE VECTOR QOS
  • [7] COTTON SA, 2000, NETWORK DATA MANAGEM
  • [8] FALKNER M, 2000, IEEE COMMUNICATIONS, P2
  • [9] HEINANEN J, 1999, 2597 RFC
  • [10] JACOBSON V, 1999, 2598 RFC