Allocation of buffer capacities in queueing networks with arbitrary topologies (Q1315349)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Allocation of buffer capacities in queueing networks with arbitrary topologies |
scientific article; zbMATH DE number 513140
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Allocation of buffer capacities in queueing networks with arbitrary topologies |
scientific article; zbMATH DE number 513140 |
Statements
Allocation of buffer capacities in queueing networks with arbitrary topologies (English)
0 references
10 March 1994
0 references
The authors present two algorithms to allocate \(M\) buffers to \(N\) service stations which are connected in a feedforward manner. All service times and the interarrival times are assumed to be exponentially distributed. The algorithms use appropriate decompositions of the network followed by iterative improvements.
0 references
service models
0 references
queueing networks
0 references
0 references
