Name
Title | ||
|---|---|---|
Combining Routing and Buffer Allocation Problems in Series-Parallel Queueing Networks |
Abstract | ||
|---|---|---|
Given a series-parallel queueing network topology with exponential servers of finite capacity, a systematic design methodology is presented that approximately solves the optimal routing and buffer space allocation problems within the network. The multi-objective stochastic nonlinear programming problem in integer variables is described and a two-stage iterative optimization procedure is presented which interconnects the routing and buffer space allocation problems. The algorithmic procedure couples the Expansion method, a decomposition method for computing performance measures in queueing networks with finite capacity, along with Powell's unconstrained optimization procedure which allocates the buffers and a multi-variable search procedure for determining the routing probabilities. The effectiveness and efficiency of the resulting two-stage design methodology is tested and evaluated in a series of experimental designs along with simulations of the network topologies. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1023/B:ANOR.0000011185.77227.ae | Annals OR |
Keywords | Field | DocType |
queueing networks,finite buffers,optimal routing | Mathematical optimization,Computer science,Nonlinear programming,Server,Network topology,Decomposition method (constraint satisfaction),Backpressure routing,Queueing theory,Layered queueing network,Series and parallel circuits | Journal |
Volume | Issue | ISSN |
125 | 1-4 | 1572-9338 |
Citations | PageRank | References |
7 | 0.53 | 12 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sophia Daskalaki | 1 | 295 | 18.52 |
| J. MacGregor Smith | 2 | 496 | 61.72 |