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

On the Nonsymmetric Longer Queue Model: Joint Distribution, Asymptotic Properties, and Heavy Traffic Limits

1Department of Mathematics, Statistics and Computer Science, University of Illinois at Chicago, Chicago, IL 60607-7045, USA
2Department of Mathematics and Computer Science, QCC, The City University of New York, 222-05 56th Avenue, Bayside, NY 11364, USA

Received 28 January 2013; Accepted 8 April 2013

Academic Editor: Khosrow Moshirvaziri

Copyright © 2013 Charles Knessl and Haishen Yao. 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. L. Flatto, “The longer queue model,” Probability in the Engineering and Informational Sciences, vol. 3, pp. 537–559, 1989. View at Google Scholar
  2. Y. S. Zheng and P. Zipkin, “A queueing model to analyze the value of centralized inventory information,” Operations Research, vol. 38, pp. 296–307, 1990. View at Google Scholar
  3. J. W. Cohen, “A two-queue, one-server model with priority for the longer queue,” Queueing Systems. Theory and Applications, vol. 2, no. 3, pp. 261–283, 1987. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. L. Flatto and H. P. McKean, “Two queues in parallel,” Communications on Pure and Applied Mathematics, vol. 30, no. 2, pp. 255–263, 1977. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. I. J.-B. F. Adan, J. Wessels, and W. H. M. Zijm, “Analysis of the symmetric shortest queue problem,” Communications in Statistics. Stochastic Models, vol. 6, no. 4, pp. 691–713, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. I. J.-B. F. Adan, J. Wessels, and W. H. M. Zijm, “Analysis of the asymmetric shortest queue problem,” Queueing Systems. Theory and Applications, vol. 8, no. 1, pp. 1–58, 1991. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. L. Flatto and S. Hahn, “Two parallel queues created by arrivals with two demands—I,” SIAM Journal on Applied Mathematics, vol. 44, no. 5, pp. 1041–1053, 1984. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. L. Flatto, “Two parallel queues created by arrivals with two demands—II,” SIAM Journal on Applied Mathematics, vol. 45, no. 5, pp. 861–878, 1985. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. G. Fayolle and R. Iasnogorodski, “Two coupled processors: the reduction to a Riemann-Hilbert problem,” Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete, vol. 47, no. 3, pp. 325–351, 1979. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. A. G. Konheim, I. Meilijson, and A. Melkman, “Processor-sharing of two parallel lines,” Journal of Applied Probability, vol. 18, no. 4, pp. 952–956, 1981. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. F. Guillemin and D. Pinchon, “Analysis of generalized processor-sharing systems with two classes of customers and exponential services,” Journal of Applied Probability, vol. 41, no. 3, pp. 832–858, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. F. Guillemin and J. S. H. van Leeuwaarden, “Rare event asymptotics for a random walk in the quarter plane,” Queueing Systems. Theory and Applications, vol. 67, no. 1, pp. 1–32, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. J. W. Cohen, “Boundary value problems in queueing theory,” Queueing Systems. Theory and Applications, vol. 3, no. 2, pp. 97–128, 1988. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. J. W. Cohen and O. J. Boxma, Boundary Value Problems in Queueing System Analysis, vol. 79 of North-Holland Mathematics Studies, North-Holland Publishing Co., Amsterdam, The Netherlands, 1983. View at MathSciNet
  15. G. Fayolle, R. Iasnogorodski, and V. Malyshev, Random Walks in the Quarter-Plane, vol. 40, Springer, Berlin, Germany, 1999. View at MathSciNet
  16. N. I. Muskhelishvili, Singular Integral Equations, Dover, New York, NY, USA, 1992. View at MathSciNet
  17. R. Wong, Asymptotic Approximations of Integrals, vol. 34, SIAM, Philadelphia, Pa, USA, 2001. View at Publisher · View at Google Scholar · View at MathSciNet
  18. N. Bleistein and R. A. Handelsman, Asymptotic Expansions of Integrals, Dover, New York, NY, USA, 2nd edition, 1986. View at MathSciNet
  19. C. M. Bender and S. A. Orszag, Advanced Mathematical Methods for Scientists and Engineers, McGraw-Hill Book, New York, NY, USA, 1978. View at MathSciNet
  20. P. Flajolet and R. Sedgewick, Analytic Combinatorics, Cambridge University Press, Cambridge, UK, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  21. 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
  22. H. Yao and C. Knessl, “On the shortest queue version of the Erlang loss model,” Studies in Applied Mathematics, vol. 120, no. 2, pp. 129–212, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  23. H. Yao and C. Knessl, “On the finite capacity shortest queue problem,” Progress in Applied Mathematics, vol. 2, pp. 1–34, 2011. View at Google Scholar