Advertisement

Winning the Hand of the Princess Saralinda

  • Peter W. Glynn
  • Ward Whitt
Chapter
  • 645 Downloads
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 19)

Abstract

Once upon a time, in a gloomy castle on a lonely hill, where there were thirteen clocks that wouldn’t go, there lived a cold, aggressive Duke, and his niece, the Princess Saralinda. She was warm in every wind and weather, but he was always cold. His hands were as cold as his heart. He wore gloves when he was asleep, and he wore gloves when he was awake, which made it difficult for him to pick up pins or coins or the kernels of nuts, or to tear the wings from nightingales⋯. Wickedly scheming, he would limp and cackle through the cold corridors of the castle, planning new impossible feats for the suitors of Saralinda to perform. He did not wish to give her hand in marriage, since her hand was the only warm hand in the castle. — From The Thirteen Clocks by James Thurber [17].

Keywords

Central Limit Theorem Arrival Process Moment Generate Function Interarrival Time Poisson Arrival 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Anantharam, V. Uniqueness of stationary ergodic fixed point for a·/M/K queue. Ann. Appl. Prob. 3, 154–172, 1993.MathSciNetzbMATHCrossRefGoogle Scholar
  2. [2]
    Bambos, N., and Walrand, J. An invariant distribution for the G/G/1 queueing operator. Adv. Appl. Prob. 22, 254–256, 1990.MathSciNetzbMATHCrossRefGoogle Scholar
  3. [3]
    Browne, S., and Steele, J. M. Transient behavior of coverage processes with applications to the infinite-server queue. J. Appl. Prob. 30, 589–602, 1993.MathSciNetzbMATHCrossRefGoogle Scholar
  4. [4]
    Coffman, E. G. Jr., and Whitt, W. Recent asymptotic results in the probabilistic analysis of schedule makespans. In: Chrétienne, P., Coffman, E. G. Jr., Lenstra, J. K., and Liu, Z. (eds), Scheduling Theory and its Applications. Wiley, New York, 1995, pp. 15–31.Google Scholar
  5. [5]
    Cox, J. T., Gandolfi, A., Griffin, P. S., and Kesten, H. Greedy lattice animals I: upper bounds. Ann. Appl Prob. 3, 1151–1169, 1993.MathSciNetzbMATHCrossRefGoogle Scholar
  6. [6]
    Eick, S. G., Massey, W. A., and Whitt, W. The physics of the M t/G/∞ queue. Oper. Res. 41, 731–742, 1993.MathSciNetzbMATHCrossRefGoogle Scholar
  7. [7]
    Feller, W. An Introduction to Probability Theory and Its Application, Vol. II, 2nd ed. Wiley, New York, 1970.Google Scholar
  8. [8]
    Glynn, P. W., and Whitt, W. Ordinary CLT and WLLN versions of L = λ W. Math. Oper. Res. 13, 674–692, 1988.MathSciNetzbMATHCrossRefGoogle Scholar
  9. [9]
    Glynn, P. W., and Whitt, W. Departures from many queues in series. Ann. Appl. Prob. 1, 546–572, 1991.MathSciNetzbMATHCrossRefGoogle Scholar
  10. [10]
    Glynn, P. W., and Whitt, W. Large deviations behavior of counting processes and their inverses. Queueing Syst. 17, 107–128, 1994.MathSciNetzbMATHCrossRefGoogle Scholar
  11. [11]
    Greenberg, A. G., Schlunk, O., and Whitt, W. Using distributed-event parallel simulation to study departures from many queues in series. Prob. Eng. Inform. Sci. 7, 159–186, 1993.CrossRefGoogle Scholar
  12. [12]
    Leadbetter, M. R., Lindgren, G., and Rootzén, H. Extremes and Related Properties of Random Sequences and Processes. Springer-Verlag, New York, 1983.zbMATHCrossRefGoogle Scholar
  13. [13]
    Lindvall, T. Lectures on the Coupling Method. Wiley, New York, 1992.zbMATHGoogle Scholar
  14. [14]
    Lucantoni, D. M. The BMAP/G/1 queue: a tutorial. In Donatiello, L., and Nelson, R. (eds), Models and Techniques for Performance Evaluation of Computer and Communications Systems. Springer, New York, 1993, pp. 330–358.CrossRefGoogle Scholar
  15. [15]
    Massey, W. A., and Whitt, W. Unstable asymptotics for nonstationary queues. Math. Oper. Res. 19, 267–291, 1994.MathSciNetzbMATHCrossRefGoogle Scholar
  16. [16]
    Srinivasan, R. Queues in series via interacting particle systems. Math. Oper. Res. 18, 39–50, 1993.MathSciNetzbMATHCrossRefGoogle Scholar
  17. [17]
    Thurber, J. The Thirteen Clocks. Simon and Schuster, New York, 1950.Google Scholar
  18. [18]
    Vere-Jones, D. Some applications of probability generating functional to the study of input-output streams. J. R. Stat. Soc. B 30, 321–333, 1968.MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 1999

Authors and Affiliations

  • Peter W. Glynn
  • Ward Whitt

There are no affiliations available

Personalised recommendations