Iterative approximations for queueing networks

J.B.M. van Doremalen; J. Wessels

doi:10.1007/BFb0006866

Iterative approximations for queueing networks

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

Stochastic Operations Research

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic

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 language	English
Title of host publication	Stochastic Programming
Editors	F. Archetti, G. Di Pillo, M. Lucertini
Place of Publication	Berlin
Publisher	Springer
Pages	95-106
Number of pages	12
ISBN (Electronic)	978-3-540-39729-8
ISBN (Print)	3-540-16044-2, 978-3-540-16044-1
DOIs	https://doi.org/10.1007/BFb0006866
Publication status	Published - 1986
Event	IFIP Workshop - Gargnano, Italy Duration: 15 Sept 1983 → 21 Sept 1983

Publication series

Name	Lecture Notes in Control and Information Sciences
Volume	76
ISSN (Print)	0170-8643

Conference

Conference	IFIP Workshop
Country/Territory	Italy
City	Gargnano
Period	15/09/83 → 21/09/83

Access to Document

10.1007/BFb0006866

Cite this

@inproceedings{a925bd0719644656ba88b3660109e382,

title = "Iterative approximations for queueing networks",

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 = "1986",

doi = "10.1007/BFb0006866",

language = "English",

isbn = "3-540-16044-2",

series = "Lecture Notes in Control and Information Sciences",

publisher = "Springer",

pages = "95--106",

editor = "F. Archetti and \{Di Pillo\}, G. and M. Lucertini",

booktitle = "Stochastic Programming",

address = "Germany",

note = "IFIP Workshop ; Conference date: 15-09-1983 Through 21-09-1983",

}

TY - GEN

T1 - Iterative approximations for queueing networks

AU - van Doremalen, J.B.M.

AU - Wessels, J.

PY - 1986

Y1 - 1986

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.

U2 - 10.1007/BFb0006866

DO - 10.1007/BFb0006866

M3 - Conference contribution

SN - 3-540-16044-2

SN - 978-3-540-16044-1

T3 - Lecture Notes in Control and Information Sciences

SP - 95

EP - 106

BT - Stochastic Programming

A2 - Archetti, F.

A2 - Di Pillo, G.

A2 - Lucertini, M.

PB - Springer

CY - Berlin

T2 - IFIP Workshop

Y2 - 15 September 1983 through 21 September 1983

ER -

Iterative approximations for queueing networks

Abstract

Publication series

Conference

Access to Document

Fingerprint

Cite this