Throughputs in processor sharing models for integrated stream and elastic traffic

Research output: Book/ReportReportProfessional

44 Downloads (Pure)

Abstract

We present an analytical study of throughput measures in processor sharing queueing systems with randomly varying service rates, modelling a communication link in an integrated services network carrying prioritised stream traffic and elastic traffic. A number of distinct throughput measures for the elastic traffic are defined and analysed. In particular, the differences between the various throughput measures and the impact of the elastic call size distribution are investigated. It is concluded that the call-average throughput, which is most relevant from the user point of view but typically hard to analyse, is very well approximated by the newly proposed so-called expected instantaneous throughput, which can easily be obtained from the system's steady state distribution.
Original languageUndefined
Place of PublicationEnschede
PublisherUniversity of Twente, Department of Applied Mathematics
Number of pages29
Publication statusPublished - 2004

Publication series

NameMemorandum Faculty of Mathematical Sciences
PublisherUniversity of Twente, Department of Applied Mathematics
No.1708
ISSN (Print)0169-2690

Keywords

  • MSC-90B18
  • MSC-90B22
  • IR-65893
  • EWI-3528
  • METIS-216512
  • MSC-60K25

Cite this

Litjens, R., van den Berg, H. L., & Boucherie, R. J. (2004). Throughputs in processor sharing models for integrated stream and elastic traffic. (Memorandum Faculty of Mathematical Sciences; No. 1708). Enschede: University of Twente, Department of Applied Mathematics.
Litjens, R. ; van den Berg, Hans Leo ; Boucherie, Richardus J. / Throughputs in processor sharing models for integrated stream and elastic traffic. Enschede : University of Twente, Department of Applied Mathematics, 2004. 29 p. (Memorandum Faculty of Mathematical Sciences; 1708).
@book{650c984365f44fb889bb72e4e343646e,
title = "Throughputs in processor sharing models for integrated stream and elastic traffic",
abstract = "We present an analytical study of throughput measures in processor sharing queueing systems with randomly varying service rates, modelling a communication link in an integrated services network carrying prioritised stream traffic and elastic traffic. A number of distinct throughput measures for the elastic traffic are defined and analysed. In particular, the differences between the various throughput measures and the impact of the elastic call size distribution are investigated. It is concluded that the call-average throughput, which is most relevant from the user point of view but typically hard to analyse, is very well approximated by the newly proposed so-called expected instantaneous throughput, which can easily be obtained from the system's steady state distribution.",
keywords = "MSC-90B18, MSC-90B22, IR-65893, EWI-3528, METIS-216512, MSC-60K25",
author = "R. Litjens and {van den Berg}, {Hans Leo} and Boucherie, {Richardus J.}",
note = "Imported from MEMORANDA",
year = "2004",
language = "Undefined",
series = "Memorandum Faculty of Mathematical Sciences",
publisher = "University of Twente, Department of Applied Mathematics",
number = "1708",

}

Litjens, R, van den Berg, HL & Boucherie, RJ 2004, Throughputs in processor sharing models for integrated stream and elastic traffic. Memorandum Faculty of Mathematical Sciences, no. 1708, University of Twente, Department of Applied Mathematics, Enschede.

Throughputs in processor sharing models for integrated stream and elastic traffic. / Litjens, R.; van den Berg, Hans Leo; Boucherie, Richardus J.

Enschede : University of Twente, Department of Applied Mathematics, 2004. 29 p. (Memorandum Faculty of Mathematical Sciences; No. 1708).

Research output: Book/ReportReportProfessional

TY - BOOK

T1 - Throughputs in processor sharing models for integrated stream and elastic traffic

AU - Litjens, R.

AU - van den Berg, Hans Leo

AU - Boucherie, Richardus J.

N1 - Imported from MEMORANDA

PY - 2004

Y1 - 2004

N2 - We present an analytical study of throughput measures in processor sharing queueing systems with randomly varying service rates, modelling a communication link in an integrated services network carrying prioritised stream traffic and elastic traffic. A number of distinct throughput measures for the elastic traffic are defined and analysed. In particular, the differences between the various throughput measures and the impact of the elastic call size distribution are investigated. It is concluded that the call-average throughput, which is most relevant from the user point of view but typically hard to analyse, is very well approximated by the newly proposed so-called expected instantaneous throughput, which can easily be obtained from the system's steady state distribution.

AB - We present an analytical study of throughput measures in processor sharing queueing systems with randomly varying service rates, modelling a communication link in an integrated services network carrying prioritised stream traffic and elastic traffic. A number of distinct throughput measures for the elastic traffic are defined and analysed. In particular, the differences between the various throughput measures and the impact of the elastic call size distribution are investigated. It is concluded that the call-average throughput, which is most relevant from the user point of view but typically hard to analyse, is very well approximated by the newly proposed so-called expected instantaneous throughput, which can easily be obtained from the system's steady state distribution.

KW - MSC-90B18

KW - MSC-90B22

KW - IR-65893

KW - EWI-3528

KW - METIS-216512

KW - MSC-60K25

M3 - Report

T3 - Memorandum Faculty of Mathematical Sciences

BT - Throughputs in processor sharing models for integrated stream and elastic traffic

PB - University of Twente, Department of Applied Mathematics

CY - Enschede

ER -

Litjens R, van den Berg HL, Boucherie RJ. Throughputs in processor sharing models for integrated stream and elastic traffic. Enschede: University of Twente, Department of Applied Mathematics, 2004. 29 p. (Memorandum Faculty of Mathematical Sciences; 1708).