Strong Convexity Results for Queueing Systems

Arie Harel and Paul H. Zipkin
Additional contact information
Arie Harel: Rutgers University, Newark, New Jersey
Paul H. Zipkin: Columbia University, New York, New York

Operations Research, 1987, vol. 35, issue 3, 405-418

Abstract: We prove a strong (and seemingly odd) result about the M / M / c queue: the reciprocal of the average sojourn time is a concave function of the traffic intensity. We use this result to show that the average itself is jointly convex in arrival and service rates. The standard deviation has the same properties. Also, we determine conditions under which these properties are exhibited by a standard approximation for the M / G / c queue. These results are useful in design studies for telecommunications and production systems.

Keywords: 696 convexity of performance measures; 699 tractability of design models (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.35.3.405 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:35:y:1987:i:3:p:405-418

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().