Table of Contents Author Guidelines Submit a Manuscript
Advances in Operations Research
Volume 2016, Article ID 1925827, 56 pages
http://dx.doi.org/10.1155/2016/1925827
Research Article

Asymptotic Analysis of a Storage Allocation Model with Finite Capacity: Joint Distribution

1Department of Science and Mathematics, Columbia College Chicago, 623 South Wabash Avenue, Chicago, IL 60605, USA
2Department of Mathematics, Statistics and Computer Science, University of Illinois at Chicago, Chicago, IL 60607-7045, USA

Received 7 August 2015; Accepted 26 January 2016

Academic Editor: Hsien-Chung Wu

Copyright © 2016 Eunju Sohn and Charles Knessl. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. D. E. Knuth, Fundamental Algorithms, vol. 1, Addison-Wesley, Reading, Mass, USA, 3rd edition, 1997. View at MathSciNet
  2. S. Xie and C. Knessl, “On the transient behavior of the Erlang loss model: heavy usage asymptotics,” SIAM Journal on Applied Mathematics, vol. 53, no. 2, pp. 555–599, 1993. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. L. Kosten, “Uber sperrungswahrscheinlichkeiten bei staffelschltungen,” Electra Nachr.-Tech, vol. 14, pp. 5–12, 1937. View at Google Scholar
  4. D. Aldous, “Some interesting processes arising as heavy traffic limits in an M/M/ storage process,” Stochastic Processes and Their Applications, vol. 22, pp. 291–313, 1986. View at Google Scholar
  5. E. G. Coffman Jr., T. T. Kadota, and L. A. Shepp, “A stochastic model of fragmentation in dynamic storage allocation,” SIAM Journal on Computing, vol. 14, no. 2, pp. 416–425, 1985. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. G. F. Newell, The M/M/∞ Service System with Ranked Servers in Heavy Traffic, Springer, New York, NY, USA, 1984.
  7. J. Preater, “A perpetuity and the M/M/ ranked server system,” Journal of Applied Probability, vol. 34, no. 2, pp. 508–513, 1997. View at Publisher · View at Google Scholar
  8. E. Sohn and C. Knessl, “A simple direct solution to a storage allocation model,” Applied Mathematics Letters, vol. 21, no. 2, pp. 172–175, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. C. Knessl, “Asymptotic expansions for a stochastic model of queue storage,” The Annals of Applied Probability, vol. 10, no. 2, pp. 592–615, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. C. Knessl, “Geometrical optics and models of computer memory fragmentation,” Studies in Applied Mathematics, vol. 111, no. 2, pp. 185–238, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  11. C. Knessl, “Some asymptotic results for the M/M/ queue with ranked servers,” Queueing Systems, vol. 47, no. 3, pp. 201–250, 2004. View at Publisher · View at Google Scholar
  12. E. Sohn and C. Knessl, “The distribution of wasted spaces in the M/M/ queue with ranked servers,” Advances in Applied Probability, vol. 40, pp. 835–855, 2008. View at Google Scholar
  13. E. Sohn and C. Knessl, “On a storage allocation model with finite capacity,” European Journal of Applied Mathematics, 2016. View at Publisher · View at Google Scholar
  14. R. Courant and D. Hilbert, Methods of Mathematical Physics, Partial Differential Equations, vol. 2, Wiley-Interscience, New York, NY, USA, 1989.
  15. N. Bleistein and R. A. Handelsman, Asymptotic Expansions of Integrals, Dover, New York, NY, USA, 2nd edition, 1986. View at MathSciNet
  16. C. M. Bender and S. A. Orszag, Advanced Mathematical Methods for Scientists and Engineers, McGraw-Hill, New York, NY, USA, 1978. View at MathSciNet
  17. R. Wong, Asymptotic Approximation of Integrals, SIAM, Philadelphia, Pa, USA, 2001.
  18. P. Flajolet and R. Sedgewick, Analytic Combinatorics, Cambridge University Press, Cambridge, UK, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  19. W. Szpankowski, Average Case Analysis of Algorithms on Sequences, Wiley-Interscience, New York, NY, USA, 2001. View at Publisher · View at Google Scholar · View at MathSciNet
  20. C. Knessl and Y. Yang, “Analysis of a Brownian particle moving in a time-dependent drift field,” Asymptotic Analysis, vol. 27, no. 3-4, pp. 281–319, 2001. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  21. C. Knessl, “On two-dimensional convection-diffusion past a circle,” SIAM Journal on Applied Mathematics, vol. 62, no. 1, pp. 310–335, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus