.png){kind=icon}
返回
Combining routing and buffer allocation problems in series-parallel queueing networks
.png){kind=icon}
PRE
AI
DOI：10.1023/B:ANOR.0000011185.77227.ae.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
queueing networks
finite buffers
optimal routing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
