2003Unpublished venueRequires access

Analysis of queuing systems with multiple servers under a threshold-type scheduling

I. Sasase, Shohei Mori

Open publisher page 2 citations

Abstract

A queuing system with multiple servers of different rates under a threshold-type scheduling is analyzed. The authors derive the general expressions for state probabilities and the average queuing delay in which the conventional M/M/n queuing is also included as the special case of the zero-threshold policy. A numerical calculation is carried out for a queuing system with three servers under threshold-type scheduling in order to consider the impact of the multiple thresholds on the average queuing delay of the system. It is found that the average queuing delay of the queuing system with multiple servers of different rates can be reduced under threshold-type scheduling by selecting the threshold values appropriately. Threshold-type scheduling is more effective as the difference between the service rates becomes larger. It is also shown that computer simulation results agree well with the theoretical results.>

About this research paper

What this paper is about

A queuing system with multiple servers of different rates under a threshold-type scheduling is analyzed. The authors derive the general expressions for state probabilities and the average queuing delay in which the conventional M/M/n queuing is also included as the special case of the zero-threshold policy. A numerical calculation is carried out for a queuing system with three servers under threshold-type scheduling in order to consider the impact of the multiple thresholds on the average queuing delay of the system. It is found that the average queuing delay of the queuing system with multiple servers of different rates can be reduced under threshold-type scheduling by selecting the threshold values appropriately. Threshold-type scheduling is more effective as the difference between the service rates becomes larger. It is also shown that computer simulation results agree well with the theoretical results.>

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A queuing system with multiple servers of different rates under a threshold-type scheduling is analyzed. The authors derive the general expressions for state probabilities and the average queuing delay in which the conventional M/M/n queuing is also included as the special case of the zero-threshold policy. A numerical calculation is carried out for a queuing system with three servers under threshold-type scheduling in order to consider the impact of the multiple thresholds on the average queuing delay of the system. It is found that the average queuing delay of the queuing system with multiple servers of different rates can be reduced under threshold-type scheduling by selecting the threshold values appropriately. Threshold-type scheduling is more effective as the difference between the service rates becomes larger. It is also shown that computer simulation results agree well with the theoretical results.>

Key concepts: Queueing theory, Server, Scheduling (production processes), Computer science, Fair queuing, Queue management system, Real-time computing, Queuing delay

Related papers

Back to paper searchBrowse research topicsOriginal source
Analysis of queuing systems with multiple servers under a threshold-type scheduling — Research Paper | ScholarLens