New Linear Program Performance Bounds for Closed Queueing Networks

被引:0
|
作者
J. R. Morrison
P. R. Kumar
机构
[1] University of Illinois,Coordinated Science Laboratory
[2] University of Illinois,Coordinated Science Laboratory
来源
关键词
Queueing networks; closed networks; closed reentrant lines; throughput; asymptotic loss; efficiency; scheduling; performance evaluation;
D O I
暂无
中图分类号
学科分类号
摘要
We develop new linear program performance bounds for closed reentrantqueueing networks based on an inequality relaxation of the averagecost equation. The approach exploits the fact that the transitionprobabilities under certain policies of closed queueing networksare invariant within certain regions of the state space. Thisinvariance suggests the use of a piecewise quadratic functionas a surrogate for the differential cost function. The linearprogramming throughput bounds obtained are provably tighter thanpreviously known bounds at the cost of increased computationalcomplexity. Functional throughput bounds parameterized by thefixed customer population N are obtained, alongwith a bound on the limiting throughput as N → + ∞.We show that one may obtain reduced complexity bounds while stillretaining superiority.
引用
收藏
页码:291 / 317
页数:26
相关论文
共 50 条
  • [1] New linear program performance bounds for closed queueing networks
    Morrison, JR
    Kumar, PR
    [J]. DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2001, 11 (04): : 291 - 317
  • [2] New linear program performance bounds for queueing networks
    Morrison, JR
    Kumar, PR
    [J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1999, 100 (03) : 575 - 597
  • [3] New Linear Program Performance Bounds for Queueing Networks
    J. R. Morrison
    P. R. Kumar
    [J]. Journal of Optimization Theory and Applications, 1999, 100 : 575 - 597
  • [4] Simple bounds for closed queueing networks
    Harel, A
    Namn, S
    Sturm, J
    [J]. QUEUEING SYSTEMS, 1999, 31 (1-2) : 125 - 135
  • [5] Simple bounds for closed queueing networks
    Arie Harel
    Su Namn
    Jacob Sturm
    [J]. Queueing Systems, 1999, 31 : 125 - 135
  • [6] Robust bounds and throughput guarantees for closed multiclass queueing networks
    Majumdar, S
    Woodside, CM
    [J]. PERFORMANCE EVALUATION, 1998, 32 (02) : 101 - 136
  • [7] Geometric bounds: A noniterative analysis technique for closed queueing networks
    Casale, Giuliano
    Muntz, Richard R.
    Serazzi, Giuseppe
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2008, 57 (06) : 780 - 794
  • [8] Bounds and error bounds for queueing networks
    Nico M. van Dijk
    [J]. Annals of Operations Research, 1998, 79 : 295 - 319
  • [9] Bounds and error bounds for queueing networks
    van Dijk, NM
    [J]. ANNALS OF OPERATIONS RESEARCH, 1998, 79 (0) : 295 - 319
  • [10] Uniformization and performance sensitivity estimation in closed queueing networks
    Cao, XR
    [J]. MATHEMATICAL AND COMPUTER MODELLING, 1996, 23 (11-12) : 77 - 92