Throughput Maximization of Queueing Networks with Simultaneous Minimization of Service Rates and Buffers

Throughput Maximization of Queueing Networks with Simultaneous Minimization of Service Rates and Buffers

The throughput of an acyclic, general-service time queueing network was optimized, and the total number of buffers and the overall service rate was reduced. To satisfy these conflicting objectives, a multiobjective genetic algorithm was developed and employed. Thus, our method produced a set of effi...

Full description

Bibliographic Details
Main Authors: F. R. B. Cruz, G. Kendall, L. While, A. R. Duarte, N. L. C. Brito
Format: Article
Language:English
Published: Hindawi Limited 2012-01-01
Series:Mathematical Problems in Engineering
Online Access:http://dx.doi.org/10.1155/2012/692593
id doaj-acab6dc4b33643c9a93f929af863c23a
record_format Article
spelling doaj-acab6dc4b33643c9a93f929af863c23a2020-11-24T22:25:17ZengHindawi LimitedMathematical Problems in Engineering1024-123X1563-51472012-01-01201210.1155/2012/692593692593Throughput Maximization of Queueing Networks with Simultaneous Minimization of Service Rates and BuffersF. R. B. Cruz0G. Kendall1L. While2A. R. Duarte3N. L. C. Brito4Departamento de Estatística, Universidade Federal de Minas Gerais, 31270-901 Belo Horizonte, MG, BrazilSchool of Computer Science, University of Nottingham, Jubilee Campus, Wollaton Road, Nottingham NG8 1BB, UKSchool of Computer Science & Software Engineering, The University of Western Australia, 35 Stirling Highway, Crawley, WA 6009, AustraliaDepartamento de Matemática, Universidade Federal de Ouro Preto, 35400-000 Ouro Preto, MG, BrazilDepartamento de Ciências Exatas, Universidade Estadual de Montes Claros, 39401-089 Montes Claros, MG, BrazilThe throughput of an acyclic, general-service time queueing network was optimized, and the total number of buffers and the overall service rate was reduced. To satisfy these conflicting objectives, a multiobjective genetic algorithm was developed and employed. Thus, our method produced a set of efficient solutions for more than one objective in the objective function. A comprehensive set of computational experiments was conducted to determine the efficacy and efficiency of the proposed approach. Interesting insights obtained from the analysis of a complex network may assist practitioners in planning general-service queueing networks.http://dx.doi.org/10.1155/2012/692593
collection DOAJ
language English
format Article
sources DOAJ
author F. R. B. Cruz
G. Kendall
L. While
A. R. Duarte
N. L. C. Brito
spellingShingle F. R. B. Cruz
G. Kendall
L. While
A. R. Duarte
N. L. C. Brito
Throughput Maximization of Queueing Networks with Simultaneous Minimization of Service Rates and Buffers
Mathematical Problems in Engineering
author_facet F. R. B. Cruz
G. Kendall
L. While
A. R. Duarte
N. L. C. Brito
author_sort F. R. B. Cruz
title Throughput Maximization of Queueing Networks with Simultaneous Minimization of Service Rates and Buffers
title_short Throughput Maximization of Queueing Networks with Simultaneous Minimization of Service Rates and Buffers
title_full Throughput Maximization of Queueing Networks with Simultaneous Minimization of Service Rates and Buffers
title_fullStr Throughput Maximization of Queueing Networks with Simultaneous Minimization of Service Rates and Buffers
title_full_unstemmed Throughput Maximization of Queueing Networks with Simultaneous Minimization of Service Rates and Buffers
title_sort throughput maximization of queueing networks with simultaneous minimization of service rates and buffers
publisher Hindawi Limited
series Mathematical Problems in Engineering
issn 1024-123X
1563-5147
publishDate 2012-01-01
description The throughput of an acyclic, general-service time queueing network was optimized, and the total number of buffers and the overall service rate was reduced. To satisfy these conflicting objectives, a multiobjective genetic algorithm was developed and employed. Thus, our method produced a set of efficient solutions for more than one objective in the objective function. A comprehensive set of computational experiments was conducted to determine the efficacy and efficiency of the proposed approach. Interesting insights obtained from the analysis of a complex network may assist practitioners in planning general-service queueing networks.
url http://dx.doi.org/10.1155/2012/692593
work_keys_str_mv AT frbcruz throughputmaximizationofqueueingnetworkswithsimultaneousminimizationofserviceratesandbuffers
AT gkendall throughputmaximizationofqueueingnetworkswithsimultaneousminimizationofserviceratesandbuffers
AT lwhile throughputmaximizationofqueueingnetworkswithsimultaneousminimizationofserviceratesandbuffers
AT arduarte throughputmaximizationofqueueingnetworkswithsimultaneousminimizationofserviceratesandbuffers
AT nlcbrito throughputmaximizationofqueueingnetworkswithsimultaneousminimizationofserviceratesandbuffers
_version_ 1725758436069605376

Similar Items