eScholarship Repository eScholarship Repository California Digital Library
eScholarship > Postprints > Paper 2289
Search all papers
 

notify_envelope Notify me of new papers
via Email or RSS


Postprints


Throughput in processor-sharing queues
N Chen
S Jordan

  Download the Article (405 K, PDF file) - 2007 Tell a colleague about it.
Printing Tips: Select 'print as image' in the Acrobat print dialog if you have trouble printing.

ABSTRACT:

Processor-sharing queues are often used to model file transmission in networks. While sojourn time is a common performance metric in the queueing literature, average transmission rate is the more commonly discussed metric in the networking literature. Whereas much is known about sojourn times, there is little known about the average service rate experienced by jobs in processor-sharing queues. We first define the average rate as observed by users and by the queue. In an M/M/1 processor-sharing queue, we give closed-form expressions for these average rates, and prove a strict ordering amongst them. We prove that the queue service rate (in bps) is an increasing function of the minimum required average transmission rate, and give a closed-form expression for the marginal cost associated with such a performance requirement. We then consider the effect of using connection access control by modeling an M/M/1/K processor-sharing queue. We give closed-form expressions for average transmission rates, and discuss the relationship between the queue service rate (in bps), the queue limit, the average rate, and the blocking probability.

SUGGESTED CITATION:
N Chen and S Jordan, "Throughput in processor-sharing queues" (2007). IEEE Transactions on Automatic Control. 52 (2), pp. 299-305. Postprint available free at: http://repositories.cdlib.org/postprints/2289

REQUIRED PUBLISHER STATEMENT:
©2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

 
bar
Open Archives Initiative eScholarship is a service of the California Digital Library bepress