The buffer allocation problem for general finite buffer queueing networks

被引：76
|
作者：
Smith, JM [1 ]
Cruz, FRB
机构：
[1] Univ Massachusetts, Dept Mech & Ind Engn, Amherst, MA 01003 USA
[2] Univ Fed Minas Gerais, Dept Stat, Belo Horizonte, MG, Brazil
来源：
IIE TRANSACTIONS | 2005年 / 37卷 / 04期
基金：
美国国家科学基金会;
关键词：
D O I：
10.1080/07408170590916986
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
The Buffer Allocation Problem (BAP) is a difficult stochastic, integer, nonlinear programming problem. In general, the objective function and constraints of the problem are not available in a closed form. An approximation formula for predicting the optimal buffer allocation is developed based upon a two-moment approximation formula involving the expressions for M/M/1/K systems. The closed-form expressions of the M/M/1/K and M/G/1/K systems are utilized for the BAP in series, merge, and splitting topologies of finite buffer queueing networks. Extensive computational results demonstrate the efficacy of the approach.
引用
收藏
页码：343 / 365
页数：23
相关论文
共 50 条
  • [41] Analysis of Networks Buffer Using Discrete-Time Queueing Models
    Shah, Syed Asif Ali
    Shah, Wajiha
    Rind, Umed Ali
    Das Menghwar, Gordhan
    [J]. 2009 IEEE STUDENT CONFERENCE ON RESEARCH AND DEVELOPMENT: SCORED 2009, PROCEEDINGS, 2009, : 105 - 108
  • [42] Optimal Buffer Resource Allocation in Wireless Caching Networks
    Liu, Tingting
    Chang, Zheng
    Li, Jun
    Shu, Feng
    Ristaniemi, Tapani
    Han, Zhu
    [J]. 2019 IEEE 20TH INTERNATIONAL WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS (SPAWC 2019), 2019,
  • [43] Buffer overflow simulation in self-similar queuing networks with finite buffer capacity
    [J]. Lokshina, Izabella V., 1600, Inderscience Enterprises Ltd., 29, route de Pre-Bois, Case Postale 856, CH-1215 Geneva 15, CH-1215, Switzerland (05):
  • [44] Bounding blocking probabilities and throughput in queueing networks with buffer capacity constraints
    Sunil Kumar
    R. Srikant
    P.R. Kumar
    [J]. Queueing Systems, 1998, 28 : 55 - 77
  • [45] Numerical queueing analysis of loss priority for large buffer in ATM networks
    Ye, ZP
    Dang, CY
    [J]. JOURNAL OF COMPUTER INFORMATION SYSTEMS, 2002, 43 (01) : 23 - 30
  • [46] Bounding blocking probabilities and throughput in queueing networks with buffer capacity constraints
    Kumar, S
    Srikant, R
    Kumar, PR
    [J]. PROCEEDINGS OF THE 35TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-4, 1996, : 779 - 784
  • [47] Bounding blocking probabilities and throughput in queueing networks with buffer capacity constraints
    Kumar, S
    Srikant, R
    Kumar, PR
    [J]. QUEUEING SYSTEMS, 1998, 28 (1-3) : 55 - 77
  • [48] Approximate analysis of buffer sharing scheme in arbitrary configurations of queueing networks
    Yamashita, Hideaki
    [J]. IIE Transactions (Institute of Industrial Engineers), 1995, 27 (03): : 332 - 338
  • [49] Analysis of discrete time queueing networks under buffer threshold scheme
    Awan, Irfan
    Guan, Lin
    Wang, Xingang
    [J]. PROCEEDINGS - 16TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS, VOLS 1-3, 2007, : 1273 - +
  • [50] Optimisation of Buffer Allocations in Manufacturing Systems: A Study on Intra and Outbound Logistics Systems Using Finite Queueing Networks
    Amjath, Mohamed
    Kerbache, Laoucine
    Smith, James MacGregor
    Elomri, Adel
    [J]. APPLIED SCIENCES-BASEL, 2023, 13 (17):
12345