Iterative approximation for networks of queues

J.B.M. van Doremalen, J. Wessels

Research output: Book/ReportReportAcademic

19 Downloads (Pure)

Abstract

If networks of queues satisfy certain conditions, then the equilibrium distribution for the number of jobs in the various stations has the so-called product-form. In such cases there are relatively elegant and simple computational procedures for the relevant behavioral characteristics. Quite commonly, however, the conditions are too severe and exact solution is practically impossible for larger problems. In this paper we will consider iterative approximations for networks of queues which either don't possess product-form solutions or are so large that exact solution becomes intractable even using the product-form of the solution. The approximations are based on a mean value analysis approach and use either aggregation of some sort or decomposition. For the details of the approximations heuristic arguments are used. The approach is worked out for some problem types.
Original languageEnglish
Place of PublicationEindhoven
PublisherTechnische Hogeschool Eindhoven
Number of pages12
Publication statusPublished - 1983

Publication series

NameMemorandum COSOR
Volume8322
ISSN (Print)0926-4493

Fingerprint

Queue
Product Form
Approximation
Exact Solution
Mean Value Analysis
Product Form Solution
Equilibrium Distribution
Sort
Aggregation
Heuristics
Decompose

Cite this

van Doremalen, J. B. M., & Wessels, J. (1983). Iterative approximation for networks of queues. (Memorandum COSOR; Vol. 8322). Eindhoven: Technische Hogeschool Eindhoven.
van Doremalen, J.B.M. ; Wessels, J. / Iterative approximation for networks of queues. Eindhoven : Technische Hogeschool Eindhoven, 1983. 12 p. (Memorandum COSOR).
@book{ade501bc1301403f8f01220dc9547150,
title = "Iterative approximation for networks of queues",
abstract = "If networks of queues satisfy certain conditions, then the equilibrium distribution for the number of jobs in the various stations has the so-called product-form. In such cases there are relatively elegant and simple computational procedures for the relevant behavioral characteristics. Quite commonly, however, the conditions are too severe and exact solution is practically impossible for larger problems. In this paper we will consider iterative approximations for networks of queues which either don't possess product-form solutions or are so large that exact solution becomes intractable even using the product-form of the solution. The approximations are based on a mean value analysis approach and use either aggregation of some sort or decomposition. For the details of the approximations heuristic arguments are used. The approach is worked out for some problem types.",
author = "{van Doremalen}, J.B.M. and J. Wessels",
year = "1983",
language = "English",
series = "Memorandum COSOR",
publisher = "Technische Hogeschool Eindhoven",

}

van Doremalen, JBM & Wessels, J 1983, Iterative approximation for networks of queues. Memorandum COSOR, vol. 8322, Technische Hogeschool Eindhoven, Eindhoven.

Iterative approximation for networks of queues. / van Doremalen, J.B.M.; Wessels, J.

Eindhoven : Technische Hogeschool Eindhoven, 1983. 12 p. (Memorandum COSOR; Vol. 8322).

Research output: Book/ReportReportAcademic

TY - BOOK

T1 - Iterative approximation for networks of queues

AU - van Doremalen, J.B.M.

AU - Wessels, J.

PY - 1983

Y1 - 1983

N2 - If networks of queues satisfy certain conditions, then the equilibrium distribution for the number of jobs in the various stations has the so-called product-form. In such cases there are relatively elegant and simple computational procedures for the relevant behavioral characteristics. Quite commonly, however, the conditions are too severe and exact solution is practically impossible for larger problems. In this paper we will consider iterative approximations for networks of queues which either don't possess product-form solutions or are so large that exact solution becomes intractable even using the product-form of the solution. The approximations are based on a mean value analysis approach and use either aggregation of some sort or decomposition. For the details of the approximations heuristic arguments are used. The approach is worked out for some problem types.

AB - If networks of queues satisfy certain conditions, then the equilibrium distribution for the number of jobs in the various stations has the so-called product-form. In such cases there are relatively elegant and simple computational procedures for the relevant behavioral characteristics. Quite commonly, however, the conditions are too severe and exact solution is practically impossible for larger problems. In this paper we will consider iterative approximations for networks of queues which either don't possess product-form solutions or are so large that exact solution becomes intractable even using the product-form of the solution. The approximations are based on a mean value analysis approach and use either aggregation of some sort or decomposition. For the details of the approximations heuristic arguments are used. The approach is worked out for some problem types.

M3 - Report

T3 - Memorandum COSOR

BT - Iterative approximation for networks of queues

PB - Technische Hogeschool Eindhoven

CY - Eindhoven

ER -

van Doremalen JBM, Wessels J. Iterative approximation for networks of queues. Eindhoven: Technische Hogeschool Eindhoven, 1983. 12 p. (Memorandum COSOR).