Providing bandwidth guarantees over a best-effort network: call-admission and pricing

被引:0
|
作者
Courcoubetis, CA [1 ]
Dimakis, A [1 ]
Reiman, MI [1 ]
机构
[1] Univ Athens Econ & Business, Dept Informat, GR-11362 Athens, Greece
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This pager introduces a framework for answering questions regarding the conditions on the network load that allow a best-effort network like the Internet to support connections of given duration that require a certain quality of service. Such quality of service is expressed in terms of the percentage of time the bandwidth allocated to a connection may drop below a certain level or the maximum allowable delay in placing the call through the network waiting for more favorable loading conditions. The call-acceptance conditions, which depend on the behavior of the system over the lifetime of accepted calls, are thus based on transient models for the congestion (instead of looking at the average behavior) and attempt to exploit the time-scales of the fluctuations of the number of connections competing for bandwidth. Extensions of the model consider the case of dynamic pricing which allows connections that pay more to get larger shares of the bandwidth, and investigate the trade-off between quality of service, the size of the acceptance region, and the charge to be paid by the connection. Under this framework we introduce an option contract that reduces the risk of quality disruption, if a user has a fixed budget at his disposal, and calculate its price. One potential use of this methodology is towards developing a simple admission control mechanism for placing voice calls through an IP network, where the decisions can be taken by edge devices.
引用
收藏
页码:459 / 467
页数:9
相关论文
共 50 条
  • [21] Congestion control for best-effort services in wireless access network
    Kim, S
    Jamalipour, A
    [J]. JOINT 4TH IEEE INTERNATIONAL CONFERENCE ON ATM (ICATM'01) AND HIGH SPEED INTELLIGENT INTERNET SYMPOSIUM, 2001, : 217 - 221
  • [22] Feedback-based bandwidth allocation with call admission control for providing delay guarantees in IEEE 802.11e networks
    Boggia, G
    Camarda, P
    Grieco, LA
    Mascolo, S
    [J]. COMPUTER COMMUNICATIONS, 2005, 28 (03) : 325 - 337
  • [23] On call admission control for IP telephony in best effort networks
    Szabó, I
    [J]. COMPUTER COMMUNICATIONS, 2003, 26 (04) : 304 - 313
  • [24] Integration of explicit effective-bandwidth-based QoS routing with best-effort routing
    Spitler, Stephen L.
    Lee, Daniel C.
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2008, 16 (04) : 957 - 969
  • [25] Solutions for Real-Time Communication over Best-Effort Networks
    Hangan, Anca
    Marfievici, Ramona
    Sebestyen, Gheorghe
    [J]. ROEDUNET 2008 CONFERENCE PROCEEDINGS: NETWORKING FOR RESEARCH AND EDUCATION, 2008, : 44 - 49
  • [26] An Analytical Model for Best-Effort Traffic over the UMTS Enhanced Uplink
    Maeder, Andreas
    Staehle, Dirk
    [J]. 2006 IEEE 64TH VEHICULAR TECHNOLOGY CONFERENCE, VOLS 1-6, 2006, : 2257 - 2261
  • [27] A Lightweight Fairness-Driven AQM for Regulating Bandwidth Utilization in Best-Effort Routers
    Zawar Hussain
    Ghulam Abbas
    Zahid Halim
    [J]. Journal of Network and Systems Management, 2018, 26 : 486 - 517
  • [28] Integration of pricing models between best-effort and guaranteed performance services in telecommunication networks
    Baglietto, M
    Bolla, R
    Davoli, F
    Marchese, M
    Mongelli, M
    [J]. CONTROL ENGINEERING PRACTICE, 2003, 11 (10) : 1209 - 1226
  • [29] Treo: Best-Effort Natural Language Queries over Linked Data
    Freitas, Andre
    Oliveira, Joao Gabriel
    O'Riain, Sean
    Curry, Edward
    Pereira da Silva, Joao Carlos
    [J]. NATURAL LANGUAGE PROCESSING AND INFORMATION SYSTEMS, 2011, 6716 : 286 - 289
  • [30] A Lightweight Fairness-Driven AQM for Regulating Bandwidth Utilization in Best-Effort Routers
    Hussain, Zawar
    Abbas, Ghulam
    Halim, Zahid
    [J]. JOURNAL OF NETWORK AND SYSTEMS MANAGEMENT, 2018, 26 (02) : 486 - 517