On providing blocking probability and throughput guarantees in a multi-service environment

Gábor Fodor, Sándor Rácz, M. Telek

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)257-285
Number of pages29
JournalInternational Journal of Communication Systems
Volume15
Issue number4
DOIs
Publication statusPublished - May 2002

Fingerprint

Blocking probability
Throughput
Internet
Access control
Quality of service
Packet networks
Bandwidth

Keywords

  • Bandwidth sharing objectives
  • Blocking probabilities
  • Markov reward models
  • Multi-rate loss models
  • Throughput

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

On providing blocking probability and throughput guarantees in a multi-service environment. / Fodor, Gábor; Rácz, Sándor; Telek, M.

In: International Journal of Communication Systems, Vol. 15, No. 4, 05.2002, p. 257-285.

Research output: Contribution to journalArticle

@article{5a393073ccf74988b983b0bc806a323b,
title = "On providing blocking probability and throughput guarantees in a multi-service environment",
abstract = "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.",
keywords = "Bandwidth sharing objectives, Blocking probabilities, Markov reward models, Multi-rate loss models, Throughput",
author = "G{\'a}bor Fodor and S{\'a}ndor R{\'a}cz and M. Telek",
year = "2002",
month = "5",
doi = "10.1002/dac.532",
language = "English",
volume = "15",
pages = "257--285",
journal = "International Journal of Communication Systems",
issn = "1074-5351",
publisher = "John Wiley and Sons Ltd",
number = "4",

}

TY - JOUR

T1 - On providing blocking probability and throughput guarantees in a multi-service environment

AU - Fodor, Gábor

AU - Rácz, Sándor

AU - Telek, M.

PY - 2002/5

Y1 - 2002/5

N2 - 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.

AB - 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.

KW - Bandwidth sharing objectives

KW - Blocking probabilities

KW - Markov reward models

KW - Multi-rate loss models

KW - Throughput

UR - http://www.scopus.com/inward/record.url?scp=0036572810&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036572810&partnerID=8YFLogxK

U2 - 10.1002/dac.532

DO - 10.1002/dac.532

M3 - Article

AN - SCOPUS:0036572810

VL - 15

SP - 257

EP - 285

JO - International Journal of Communication Systems

JF - International Journal of Communication Systems

SN - 1074-5351

IS - 4

ER -