Performance Analysis of Preemptive Priority Multi-queue Systems and Poisson Arrivals by Means of Power Series Algorithm | ||||
| The Egyptian Statistical Journal | ||||
| Article 2, Volume 44, Issue 1, June 2000, Page 11-25 PDF (16.58 MB) | ||||
| Document Type: Original Article | ||||
| DOI: 10.21608/esju.2000.313820 | ||||
 View on SCiNiTO | ||||
| Author | ||||
| Ndia Wagieh Talat* | ||||
| Abstract | ||||
| Priority queueing systems are widely used to model communication networks with several classes of messages, and a single transmission channel. An iterative numerical technique for the evaluation of queue length distributions is applied to multi-queue systems with one server and multi-priority queue discipline. The technique is based on power series expansions of the state probabilities, as a function of the load of the system. The convergence of the series is accelerated by applying an adopted form of the bilinear mapping, introduced by Blanc. | ||||
| Keywords | ||||
| Power; Series Algorithm; Traffic Intensity; Bilinear Mapping; And Memory Space | ||||
|
Statistics Article View: 74 PDF Download: 104 |
||||
