Loading...
Please wait, while we are loading the content...
Similar Documents
Proposta de análise de desempenho de algoritmos para otimização de redes de filas M/G/c/K baseada em DOE
| Content Provider | Semantic Scholar |
|---|---|
| Author | Barbosa, Helinton André Lopes Caldas, Gabriel Bahia Cruz, Frederico R. B. |
| Copyright Year | 2013 |
| Abstract | This paper presents the results of an empirical analysis of a previously proposed algorithm for buffer allocation in finite open acyclic general-service multi-server queuing networks. Based on the computational results, it is concluded that the processing time of the algorithm depends on the number of network servers (as expected) but is independent of the squared coefficient of variation of service time. It is also concluded that the obtained allocations are robust and that the approximations for the performance measures are accurate, as verified by simulation. Finally, it is found that it is not straightforward to develop heuristic rules to allocate multiple servers in the topology without applying a buffer allocation algorithm to determine the optimal configuration. |
| Starting Page | 13 |
| Ending Page | 25 |
| Page Count | 13 |
| File Format | PDF HTM / HTML |
| DOI | 10.1590/S0103-65132013005000043 |
| Volume Number | 24 |
| Alternate Webpage(s) | https://www.redalyc.org/pdf/3967/396742056002.pdf |
| Alternate Webpage(s) | http://www.scielo.br/pdf/prod/v24n1/aop_0098.pdf |
| Alternate Webpage(s) | https://doi.org/10.1590/S0103-65132013005000043 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
