Please use this identifier to cite or link to this item:
Title: Modeling and optimization of buffers and servers in finite queueing networks.
Authors: Martins, Helgem de Souza Ribeiro
Cruz, Frederico Rodrigues Borges da
Duarte, Anderson Ribeiro
Oliveira, Fernando Luiz Pereira de
Keywords: Buffer and server allocation
Generalized expansion method
Issue Date: 2019
Citation: MARTINS, H. de S. R. et al. Modeling and optimization of buffers and servers in finite queueing networks. Opsearch, Delhi, v. 56, n. 1, p. 123-150, 2019. Disponível em: <>. Acesso em: 19 mar. 2019.
Abstract: The joint buffer and server optimization problem (BCAP) is a non-linear optimization problem with integer decision variables that optimizes the numbers of buffers and servers such that the resulting throughput is greater than a pre-defined threshold throughput. This work presents a detailed review of the current literature that addresses allocation problems, particularly the BCAP, and a quite effective methodology for solving this problem, which consists of a combination of approximate methods and the Powell algorithm, a derivative-free optimization algorithm. The methodology was applied to networks of queues in the basic topologies series, split, and merge, producing very encouraging results that pointed at robust and homogeneous solutions.
ISSN: 0975-0320
Appears in Collections:DEEST - Artigos publicados em periódicos

Files in This Item:
File Description SizeFormat 
  Restricted Access
852,17 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.