### Abstract

Original language | English |
---|---|

Place of Publication | Eindhoven |

Publisher | Technische Hogeschool Eindhoven |

Number of pages | 12 |

Publication status | Published - 1983 |

### Publication series

Name | Memorandum COSOR |
---|---|

Volume | 8322 |

ISSN (Print) | 0926-4493 |

### Fingerprint

### Cite this

*Iterative approximation for networks of queues*. (Memorandum COSOR; Vol. 8322). Eindhoven: Technische Hogeschool Eindhoven.

}

*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.

Research output: Book/Report › Report › Academic

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 -