Evaluation of the traffic coefficient in priority queueing systems
Methodology and algorithms of evaluation of the traffic coefficient in priority queueing systems with zero and nonzero switchover times are presented. In the case of zero switchover times the calculation of the traffic coefficient is straightforward. In contrast, it relies heavily on the efficient n...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
2008-07-01
|
| Series: | Computer Science Journal of Moldova |
| Subjects: | |
| Online Access: | http://www.math.md/files/csjm/v16-n2/v16-n2-(pp269-285).pdf |
| Summary: | Methodology and algorithms of evaluation of the traffic coefficient in priority queueing systems with zero and nonzero switchover times are presented. In the case of zero switchover times the calculation of the traffic coefficient is straightforward. In contrast, it relies heavily on the efficient numerical evaluation of the busy period's Laplace-Stieltjes transform in the case when switchover times are not all degenerate zero. Examples for both cases are provided.
This work was done under support of the SCOPES grant IB7320-110720. The second author also acknowledges the support of James Watt scholarship and Overseas Research Students Awards Scheme.
1991 Mathematics Subject ClassiЇcation: Primary 90B22 |
|---|---|
| ISSN: | 1561-4042 |