Skip to main content Accessibility help
×
Home
Hostname: page-component-559fc8cf4f-q7jt5 Total loading time: 0.237 Render date: 2021-03-05T22:19:44.492Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": false, "newCiteModal": false, "newCitedByModal": true }

Queues with advanced reservations: an infinite-server proxy for the bookings diary

Published online by Cambridge University Press:  24 March 2016

R. J. Maillardet
Affiliation:
University of Melbourne
P. G. Taylor
Affiliation:
University of Melbourne
Corresponding

Abstract

Queues with advanced reservations are endemic in the real world. In such a queue, the 'arrival' process is an incoming stream of customer 'booking requests', rather than actual customers requiring immediate service. We consider a model with a Poisson booking request process with rate λ. Associated with each request is a pair of independent random variables (Ri, Si) constituting a request for service over a period Si, starting at a time Ri into the future. Our interest is in the probability that a customer will be rejected due to capacity constraints. We present a simulation of a finite-capacity queue in which we record the proportion of rejected customers, and then move to an analysis of a queue with infinitely-many servers. Obviously no customers are rejected in the latter case. However, the event that the arrival of the extra customer will cause the number of customers in the queue to exceed C at some point during its service can be used as a proxy for the event that the customer would have been rejected in a system with finite capacity C. We start by calculating the transient and stationary distributions for some performance measures for the infinite-server queue. By observing that the stationary measure for the bookings diary (that is, the list of customers currently on hand, together with their start times and service times) is the same as the law for the entire sample path of an infinite server queue with a specified nonhomogenous Poisson input process, which we call the bookings queue, we are able to write down expressions for the abovementioned probability that, at some time during a requested service, the number of customers exceeds C. This measure serves as a bound for the probability that an incoming arrival would be refused admission in a system with C servers and, for a well-dimensioned system, it is to be hoped that it is a good approximation. We test the quality of this approximation by comparing our analytical results for the infinite-server case against simulation results for the finite-server case.

Type
Research Article
Copyright
Copyright © Applied Probability Trust 2016 

Access options

Get access to the full version of this content by using one of the access options below.

References

[1]Abate, J. and Whitt, W. (1995). Numerical inversion of Laplace transforms of probability distributions. ORSA J. Comput. 7, 3643. CrossRefGoogle Scholar
[2]Abate, J. and Whitt, W. (1998). Calculating transient characteristics of the Erlang loss model by numerical transform inversion. Commun. Statist. Stoch. Models 14, 663680. CrossRefGoogle Scholar
[3]Barakat, N. and Sargent, E. H. (2004). An accurate model for evaluating blocking probabilities in multi-class OBS systems. IEEE Commun. Lett. 8, 119121. CrossRefGoogle Scholar
[4]Barakat, N. and Sargent, E. H. (2005). Analytical modelling of offset-induced priority in multiclass OBS networks. IEEE Trans. Commun. 53, 13431352. CrossRefGoogle Scholar
[5]Borovkov, K. (2003). Elements of Stochastic Modelling. World Scientific, River Edge, NJ. CrossRefGoogle Scholar
[6]Chihara, T. S. (1978). An Introduction to Orthogonal Polynomials. Gordon and Breach, New York. Google Scholar
[7]Coffman, E. G. Jr., Flatto, L. and Jelenković, P. (2000). Interval packing: the vacant interval distribution. Ann. Appl. Prob. 10, 240257. Google Scholar
[8]Coffman, E. G. Jr., Jelenković, P. and Poonen, B. (1999). Reservation probabilities. Adv. Performance Anal. 2, 129158. Google Scholar
[9]Coffman, E. G. Jr., Flatto, L., Jelenković, P. and Poonen, B. (1998). Packing random intervals on-line. Algorithmica 22, 448476. CrossRefGoogle Scholar
[10]Daley, D. J. and Vere-Jones, D. (2003). An Introduction to the Theory of Point Processes, Vol. 1, Elementary Theory and Methods. Springer, New York. Google Scholar
[11]Dolzer, K. and Gauger, C. (2001). On burst assembly in optical burst switching networks—a performance evaluation of just-enough-time. In Proceedings of the 17th International Teletraffic Congress, pp. 149160. Google Scholar
[12]Foley, R. D. (1982). The nonhomogeneous M/G/∞ queue. Opsearch 19, 4048. Google Scholar
[13]Greenberg, A. G., Srikant, R. and Whitt, W. (1999). Resource sharing for book-ahead and instantaneous-request calls. IEEE/ACM Trans. Networking 7, 1022. CrossRefGoogle Scholar
[14]Kaheel, A., Alnuweiri, H. and Gebali, F. (2004). Analytical evaluation of blocking probability in optical burst switching networks. In Proc. IEEE Internat. Conf. Commun., Vol. 3, pp. 15481553. Google Scholar
[15]Kaheel, A. M., Alnuweiri, H. and Gebali, F. (2006). A new analytical model for computing blocking probability in optical burst switching networks. IEEE J. Selected Areas Commun. 24, 120128. CrossRefGoogle Scholar
[16]Levi, R. and Shi, C. (2014). Revenue management of reusable resources with advanced reservations. Submitted. Google Scholar
[17]Liang, Y., Liao, K., Roberts, J. W. and Simonian, A. (1988). Queueing models for reserved set up telecommunications services. In Proc. Teletraffic Science for New Cost-Effective Systems, Networks and Services, Session 4.4B, 1.11.7. Google Scholar
[18]Ramakrishnan, M., Sier, D. and Taylor, P. G. (2005). A two-time-scale model for hospital patient flow. IMA J. Manag. Math. 16, 197215. CrossRefGoogle Scholar
[19]Riordan, J. (1962). Stochastic Service Systems. John Wiley, New York. Google Scholar
[20]Takács, L. (1962). Introduction to the Theory of Queues. Oxford University Press. Google Scholar
[21]Van de Vrugt, M., Litvak, N. and Boucherie, R. J. (2014). Blocking probabilities in Erlang loss queues with advance reservation. Stoch. Models 30, 187196. CrossRefGoogle Scholar
[22]Virtamo, J. T. (1992). A model of reservation systems. IEEE Trans. Commun. 40, 109118. CrossRefGoogle Scholar
[23]Vu, H. L. and Zukerman, M. (2002). Blocking probability for priority classes in optical burst switching networks. IEEE Commun. Lett. 6, 214216. Google Scholar
[24]Wolff, R. W. (1989). Stochastic Modeling and the Theory of Queues. Prentice-Hall, Englewood Cliffs, NJ. Google Scholar

Full text views

Full text views reflects PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 0
Total number of PDF views: 67 *
View data table for this chart

* Views captured on Cambridge Core between September 2016 - 5th March 2021. This data will be updated every 24 hours.

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Queues with advanced reservations: an infinite-server proxy for the bookings diary
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

Queues with advanced reservations: an infinite-server proxy for the bookings diary
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

Queues with advanced reservations: an infinite-server proxy for the bookings diary
Available formats
×
×

Reply to: Submit a response


Your details


Conflicting interests

Do you have any conflicting interests? *