The symmetric longest queue system

Geert-Jan van Houtum; Ivo Adan; Jan van der Wal

doi:10.1080/15326349708807416

The symmetric longest queue system

Geert-Jan van Houtum, Ivo Adan, Jan van der Wal

Faculty of Engineering Technology

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

11 Citations (Scopus)

152 Downloads (Pure)

Abstract

We derive the performance of the exponential symmetric longest queue system from two variants: a longest queue system with Threshold Rejection of jobs and one with Threshold Addition of jobs. It is shown that these two systems provide lower and upper bounds for the performance of the longest queue system. Both variants can be analyzed efficiently. Numerical experiments demonstrate the power of the approach

Original language	English
Pages (from-to)	105-120
Journal	Communications in statistics : Stochastic models
Volume	13
Issue number	1
DOIs	https://doi.org/10.1080/15326349708807416
Publication status	Published - 1997

Keywords

METIS-206042
IR-101674

Access to Document

10.1080/15326349708807416

symmetric

Cite this

@article{8b7b9d8c9a2b48eb83324acd448bcfcc,

title = "The symmetric longest queue system",

abstract = "We derive the performance of the exponential symmetric longest queue system from two variants: a longest queue system with Threshold Rejection of jobs and one with Threshold Addition of jobs. It is shown that these two systems provide lower and upper bounds for the performance of the longest queue system. Both variants can be analyzed efficiently. Numerical experiments demonstrate the power of the approach",

keywords = "METIS-206042, IR-101674",

author = "{van Houtum}, Geert-Jan and Ivo Adan and {van der Wal}, Jan",

year = "1997",

doi = "10.1080/15326349708807416",

language = "English",

volume = "13",

pages = "105--120",

journal = "Stochastic models",

issn = "1532-6349",

publisher = "Taylor & Francis",

number = "1",

}

TY - JOUR

T1 - The symmetric longest queue system

AU - van Houtum, Geert-Jan

AU - Adan, Ivo

AU - van der Wal, Jan

PY - 1997

Y1 - 1997

N2 - We derive the performance of the exponential symmetric longest queue system from two variants: a longest queue system with Threshold Rejection of jobs and one with Threshold Addition of jobs. It is shown that these two systems provide lower and upper bounds for the performance of the longest queue system. Both variants can be analyzed efficiently. Numerical experiments demonstrate the power of the approach

AB - We derive the performance of the exponential symmetric longest queue system from two variants: a longest queue system with Threshold Rejection of jobs and one with Threshold Addition of jobs. It is shown that these two systems provide lower and upper bounds for the performance of the longest queue system. Both variants can be analyzed efficiently. Numerical experiments demonstrate the power of the approach

KW - METIS-206042

KW - IR-101674

U2 - 10.1080/15326349708807416

DO - 10.1080/15326349708807416

M3 - Article

VL - 13

SP - 105

EP - 120

JO - Stochastic models

JF - Stochastic models

SN - 1532-6349

IS - 1

ER -

The symmetric longest queue system

Abstract

Keywords

Access to Document

Fingerprint

Cite this