The roles of coupling and the deviation matrix in determining the value of capacity in M/M/1/C queues

Peter Braunsteins (), Sophie Hautphenne and Peter G. Taylor
Additional contact information
Peter Braunsteins: The University of Melbourne
Sophie Hautphenne: The University of Melbourne
Peter G. Taylor: The University of Melbourne

Queueing Systems: Theory and Applications, 2016, vol. 83, issue 1, No 7, 157-179

Abstract: Abstract In an M/M/1/C queue, customers are lost when they arrive to find C customers already present. Assuming that each arriving customer brings a certain amount of revenue, we are interested in calculating the value of an extra waiting place in terms of the expected amount of extra revenue that the queue will earn over a finite time horizon [0, t]. There are different ways of approaching this problem. One involves the derivation of Markov renewal equations, conditioning on the first instance at which the state of the queue changes; a second involves an elegant coupling argument; and a third involves expressing the value of capacity in terms of the entries of a transient analogue of the deviation matrix. In this paper, we shall compare and contrast these approaches and, in particular, use the coupling analysis to explain why the selling price of an extra unit of capacity remains the same when the arrival and service rates are interchanged when the queue starts at full capacity.

Keywords: M/M/1/C queue; Coupling; Deviation matrix; Markov chain; 60J22; 60K20; 68M20 (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s11134-016-9480-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:queues:v:83:y:2016:i:1:d:10.1007_s11134-016-9480-3

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11134/

DOI: 10.1007/s11134-016-9480-3

Access Statistics for this article

Queueing Systems: Theory and Applications is currently edited by Sergey Foss

More articles in Queueing Systems: Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().