The buffer-bandwidth trade-off curve is convex

Krishnan Kumaran; M.R.H. Mandjes

doi:10.1023/A:1010904129610

The buffer-bandwidth trade-off curve is convex

Krishnan Kumaran, M.R.H. Mandjes

Stochastic Operations Research

Research output: Contribution to journal › Article › Academic › peer-review

11 Citations (Scopus)

Abstract

To achieve a constant overflow probability, the two queueing resources, viz. buffer and bandwidth, can be traded off. In this paper we prove that, under general circumstances, the corresponding trade-off curve is convex in the 'many-sources scaling'. This convexity enables optimal resource partitioning in a queueing system supporting heterogeneous traffic, with heterogeneous quality-of-service requirements.

Original language	Undefined
Article number	10.1023/A:1010904129610
Pages (from-to)	471-483
Number of pages	13
Journal	Queueing systems
Volume	38
Issue number	4
DOIs	https://doi.org/10.1023/A:1010904129610
Publication status	Published - 1 Aug 2001

Keywords

Large deviations
IR-72149
Generalized processor sharing
resource partitioning
EWI-18009
Queueing
buffer-bandwidth trade-off
METIS-201302

Access to Document

10.1023/A:1010904129610

http://eprints.eemcs.utwente.nl/secure2/18009/01/2001-21KumaranMandjes.pdf

Cite this

@article{e502449808744655b833c38fb49c3017,

title = "The buffer-bandwidth trade-off curve is convex",

abstract = "To achieve a constant overflow probability, the two queueing resources, viz. buffer and bandwidth, can be traded off. In this paper we prove that, under general circumstances, the corresponding trade-off curve is convex in the 'many-sources scaling'. This convexity enables optimal resource partitioning in a queueing system supporting heterogeneous traffic, with heterogeneous quality-of-service requirements.",

keywords = "Large deviations, IR-72149, Generalized processor sharing, resource partitioning, EWI-18009, Queueing, buffer-bandwidth trade-off, METIS-201302",

author = "Krishnan Kumaran and M.R.H. Mandjes",

year = "2001",

month = aug,

day = "1",

doi = "10.1023/A:1010904129610",

language = "Undefined",

volume = "38",

pages = "471--483",

journal = "Queueing systems",

issn = "0257-0130",

publisher = "Springer",

number = "4",

}

TY - JOUR

T1 - The buffer-bandwidth trade-off curve is convex

AU - Kumaran, Krishnan

AU - Mandjes, M.R.H.

PY - 2001/8/1

Y1 - 2001/8/1

N2 - To achieve a constant overflow probability, the two queueing resources, viz. buffer and bandwidth, can be traded off. In this paper we prove that, under general circumstances, the corresponding trade-off curve is convex in the 'many-sources scaling'. This convexity enables optimal resource partitioning in a queueing system supporting heterogeneous traffic, with heterogeneous quality-of-service requirements.

AB - To achieve a constant overflow probability, the two queueing resources, viz. buffer and bandwidth, can be traded off. In this paper we prove that, under general circumstances, the corresponding trade-off curve is convex in the 'many-sources scaling'. This convexity enables optimal resource partitioning in a queueing system supporting heterogeneous traffic, with heterogeneous quality-of-service requirements.

KW - Large deviations

KW - IR-72149

KW - Generalized processor sharing

KW - resource partitioning

KW - EWI-18009

KW - Queueing

KW - buffer-bandwidth trade-off

KW - METIS-201302

U2 - 10.1023/A:1010904129610

DO - 10.1023/A:1010904129610

M3 - Article

VL - 38

SP - 471

EP - 483

JO - Queueing systems

JF - Queueing systems

SN - 0257-0130

IS - 4

M1 - 10.1023/A:1010904129610

ER -