On providing blocking probability and throughput guarantees in a multi-service environment
2002 (English)In: International Journal of Communication Systems, ISSN 1074-5351, E-ISSN 1099-1131, Vol. 15, no 4, 257-285 p.Article in journal (Refereed) Published
As the Internet evolves from a packet network supporting a single best effort service class towards an integrated infrastructure supporting several service classes-some with QoS guarantees-there is a growing interest in the introduction of admission control and in devising bandwidth sharing strategies, which meet the diverse needs of QoS-assured and elastic services. In this paper we show that the extension of the classical multi-rate loss model is possible in a way that makes it useful in the performance analysis of a future admission control based Internet that supports traffic with peak rate guarantee as well as elastic traffic. After introducing the model, it is applied for the analysis of a single link, where it sheds light on the trade-off between blocking probability and throughput. For the investigation of this trade-off, we introduce the throughput-threshold constraint, which bounds the probability that the throughput of a traffic flow drops below a predefined threshold. Finally, we use the model to determine the optimal parameter set of the popular partial overlap link allocation policy: we propose a computationally efficient algorithm that provides blocking probability- and throughput guarantees. We conclude that the model and the numerical results provide important insights in traffic engineering in the Internet. Copyright (C) 2002 John Wiley Sons, Ltd.
Place, publisher, year, edition, pages
WILEY , 2002. Vol. 15, no 4, 257-285 p.
Engineering and Technology
IdentifiersURN: urn:nbn:se:kth:diva-203017DOI: 10.1002/dac.532OAI: oai:DiVA.org:kth-203017DiVA: diva2:1082164
*INT ENG TASK FORC, TRAFF ENG WG CHART ALTMAN E, 1997, 3222 INRIA ANDERSEN AT, 1997, 5 IFIP INT C TEL SYS ANDERSEN AT, 2002, TELECOMMUN SYST, V19, P75 ARLITT MF, 1996, ACM SIGMETRICS BLAABJERG S, 1996, IEEE INT C COMM SYST BOBBIO A, 1990, STOCHASTIC MODELS, V6, P133 BORST SC, 1998, IEEE J SEL AREA COMM, V16, P668 CHOUDHURY G, 1995, AT T TECHNICAL J JUL, P50 DZIONG Z, 1994, IEEE T COMMUNICATION, V42 FENG WC, 1999, IEEE ACM T NETWORK, V7, P173 FODOR G, 1998, P IEE INT C COMM ICC, V3, P1696 GIBBENS RJ, 1999, 16 INT TEL C ED UK J KAUFMAN J, 1981, IEEE T COMMUN, P1474 KELLY F, 1997, EUR T TELECOMMUN, V8, P33 MASSOULIE L, ARGUMENTS FAVOUR ADM MASSOULIE L, BANDWIDTH SHARING AD MASSOULIE L, 1999, IEEE INF 99 NEW YORK MITRA D, 1996, IEEE ACM T NETWORK, V4, P531 MITRA D, 1998, IEEE J SEL AREA COMM, V16, P692 QUEIJA RN, 1999, INT TEL C UK RACZ S, 2000, 11 INT C MOD TECHN T RACZ S, 2001, TELECOMMUN SYST, V17, P93 ROBERTS JW, 1996, COST242 ROBERTS JW, 1998, PERFORMANCE MANAGEME, P277 ROBERTS JW, 2001, IEEE COMMUN MAG, V39, P94 ROSS KW, 1995, MULTISERVICE LOSS MO SERRES YD, 1988, IEEE T COMMUN, V36, P675 STEWART WJ, 1994, INTRO NUMERICAL SOLU SYKAS ED, 1991, IEEE J SAC, V9 TELEK M, 1999, PERFORM EVALUATION, V36, P95
QCR 201703212017-03-152017-03-152017-03-21Bibliographically approved