Buffer allocation in general single-server queueing networks

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorCruz, Frederico Rodrigues Borges da-
Autor(es): dc.creatorDuarte, Anderson Ribeiro-
Autor(es): dc.creatorVan Woensel, Tom-
Data de aceite: dc.date.accessioned2019-11-06T13:25:31Z-
Data de disponibilização: dc.date.available2019-11-06T13:25:31Z-
Data de envio: dc.date.issued2012-11-12-
Data de envio: dc.date.issued2012-11-12-
Data de envio: dc.date.issued2007-
Fonte completa do material: dc.identifierhttp://hdl.handle.net/123456789/1760-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/555091-
Descrição: dc.descriptionThe optimal buffer allocation in queueing network systems is a difficult stochastic, non-linear, integer mathematical programming problem. Moreover, the objective function, the constraints or both are usually not available in closed form, making the problem even harder. A good approximation for the performance measures is thus essential for a successful buffer allocation algorithm. A recently published two-moment approximation formula to obtain the optimal buffer allocation in general service time single queues is examined in detail, based on which a new algorithm is proposed for the buffer allocation in single-server general service time queueing networks. Computational results and simulation results are shown to evaluate the efficacy of the approach in generating optimal buffer allocation patterns.-
Idioma: dc.languageen-
Direitos: dc.rightsO Periódico Computers & Operations Research concede permissão para depósito do artigo no Repositório Institucional da UFOP. Número da licença: 3292420007571.-
Palavras-chave: dc.subjectBuffer allocation-
Palavras-chave: dc.subjectQueues-
Palavras-chave: dc.subjectNetworks-
Título: dc.titleBuffer allocation in general single-server queueing networks-
Aparece nas coleções:Repositório Institucional - UFOP

Não existem arquivos associados a este item.