The symmetric longest queue system

I.J.B.F. Adan; G.J. van Houtum; J. van der Wal

The symmetric longest queue system

I.J.B.F. Adan, G.J. van Houtum, J. van der Wal

Research output: Book/Report › Report › Professional

75 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
Place of Publication	Eindhoven
Publisher	Eindhoven University of Technology
Number of pages	12
Publication status	Published - 1994

Publication series

Name	COSOR Memorandum
Publisher	Eindhoven University of Technology
Volume	94-33
ISSN (Print)	0926-4493

Access to Document

Adan1994symmetricFinal published version, 530 KB

Cite this

@book{e5fa2dab981c43c48e553128bb9ff310,

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.",

author = "I.J.B.F. Adan and {van Houtum}, G.J. and {van der Wal}, J.",

year = "1994",

language = "English",

series = "COSOR Memorandum",

publisher = "Eindhoven University of Technology",

address = "Netherlands",

}

TY - BOOK

T1 - The symmetric longest queue system

AU - Adan, I.J.B.F.

AU - van Houtum, G.J.

AU - van der Wal, J.

PY - 1994

Y1 - 1994

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.

M3 - Report

T3 - COSOR Memorandum

BT - The symmetric longest queue system

PB - Eindhoven University of Technology

CY - Eindhoven

ER -

The symmetric longest queue system

Abstract

Publication series

Access to Document

Fingerprint

Cite this