Skip to main content
SpringerLink
Log in

Some Recent Developments for Queueing Networks

  • Chapter
Probability Towards 2000

Part of the book series: Lecture Notes in Statistics ((LNS,volume 128))

Abstract

Early investigations in queueing theory provided detailed analysis of the behavior of a single queue and of networks that in a sense could be decomposed into a product of single queues. Whilst insights from these early investigations are still used, more recent investigations have focussed on understanding how network components interact.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference

  1. Bertsekas, D., and Gallagher, R. (1992). Data Networks. Prentice-Hall, Englewood Cliffs, N.J.

    MATH  Google Scholar 

  2. Bertsimas, D., Paschalidis, I. Ch., and Tsitsiklis, J. N. (1994). Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance. Annals of Applied Probability, 4, 43–75.

    Article  MathSciNet  MATH  Google Scholar 

  3. Bramson, M. (1994). Instability of FIFO queueing networks. Annals of Applied Probability, 4, 414 - 431.

    Article  MathSciNet  MATH  Google Scholar 

  4. Bramson, M. (1994). Instability of FIFO queueing networks with quick service times. Annals of Applied Probability, 4, 693–718.

    Article  MathSciNet  MATH  Google Scholar 

  5. Bramson, M. (1995). Convergence to equilibria for fluid models of FIFO queueing networks. Queueing Systems: Theory and Applications, to appear.

    Google Scholar 

  6. Bramson, M. (1995). Convergence to equilibria for fluid models of processor sharing queueing networks. Preprint.

    Google Scholar 

  7. Chen, H. (1995). A sufficient condition for the positive recurrence of a semimartin- gale reflecting Brownian motion in an orthant. Preprint.

    Google Scholar 

  8. Chen, H., and Mandelbaum, A. (1991). Stochastic discrete flow networks: diffusion approximations and bottlenecks. Annals of Probability, 4, 1463–1519.

    Article  MathSciNet  Google Scholar 

  9. Chen, H., and Zhang, H. (1995). Stability of multiclass queueing networks under FIFO service discipline. Preprint.

    Google Scholar 

  10. Dai, J. G. (1995). On positive Harris recurrence of multiclass queueing networks: a unified approach via fluid limit models. Annals of Applied Probability, 5, 49–77.

    Article  MathSciNet  MATH  Google Scholar 

  11. Dai, J. G. (1995). Stability of open multiclass queueing networks via fluid models. In Stochastic Networks, IMA Volumes in Mathematics and Its Applications, F. P. Kelly and R. J. Williams (eds.), 71, Springer-Verlag, New York, 71–90.

    Google Scholar 

  12. Dai, J. G., and Harrison, J. M. (1992). Reflected Brownian motion in an orthant: numerical methods for steady-state analysis. Annals of Applied Probability, 2, 65–86.

    Article  MathSciNet  MATH  Google Scholar 

  13. Dai, J. G., and Kurtz, T. G. (1995). A multiclass station with Markovian feedback in heavy traffic. Mathematics of Operations Research, 20, 721 - 742.

    Article  MathSciNet  MATH  Google Scholar 

  14. Dai, J. G., and Nguyen, V. (1994). On the convergence of multiclass queueing networks in heavy traffic. Annals of Applied Probability, 4, 26 - 42.

    Article  MathSciNet  MATH  Google Scholar 

  15. Dai, J. G., and VandeVate, J. The stability of two-station queueing networks. In preparation.

    Google Scholar 

  16. Dai, J. G., and Wang, Y. (1993). Nonexistence of Brownian models of certain multiclass queueing networks. Queueing Systems: Theory and Applications, 13, 41–46.

    Article  MathSciNet  MATH  Google Scholar 

  17. Dai, J. G., and Weiss, G. (1996) Stability and instability of fluid models for certain re-entrant lines. Mathematics of Operations Research, to appear.

    Google Scholar 

  18. Dai, J. G., and Williams, R. J. (1995). Existence and uniqueness of semimartin- gale reflecting Brownian motions in convex polyhedrons. Theory of Probability and Its Applications, 40, 3–53 (in Russian), to appear in the SIAM translation journal of the same name.

    Article  MathSciNet  MATH  Google Scholar 

  19. Dupuis, P., and Williams, R. J. (1994). Lyapunov functions for semimartingale reflecting Brownian motions. Annals of Probability, 22, 680–702.

    Article  MathSciNet  MATH  Google Scholar 

  20. Ethier, S. N., and Kurtz, T. G. (1986). Markov Processes: Characterization and Convergence. Wiley, New York.

    MATH  Google Scholar 

  21. Harrison, J. M. (1978). The diffusion approximation for tandem queues in heavy traffic. Adv. Appl Prob, 10, 886–905.

    Article  MATH  Google Scholar 

  22. Harrison, J. M. (1988). Brownian models of queueing networks with heteroge-neous customer populations. In Stochastic Differential Systems, Stochastic Control Theory and Applications, IMA Volumes in Mathematics and Its Applications, W. Fleming and P.-L. Lions (eds.), Springer-Verlag, New York, 147–186.

    Google Scholar 

  23. Harrison, J. M. (1995). Balanced fluid models of multiclass queueing networks: a heavy traffic conjecture. In Stochastic Networks, IMA Volumes in Mathematics and Its Applications, F. P. Kelly and R. J. Williams (eds.), 71, Springer-Verlag, New York, 1–20.

    Google Scholar 

  24. Harrison, J. M., and Nguyen, V. (1990). The QNET method for two-moment analysis of open queueing networks. Queueing Systems: Theory and Applications, 6, 1–32.

    Article  MathSciNet  MATH  Google Scholar 

  25. Harrison, J. M., and Nguyen, V. (1995). Brownian models of multiclass queueing networks: current status and open problems. Queueing Systems: Theory and Applications, 13, 5–40.

    Article  MathSciNet  Google Scholar 

  26. Harrison, J. M., and Pich, M. T. (1993). Two-moment analysis of open queueing networks with general workstation capabilities. Operations Research, to appear.

    Google Scholar 

  27. Harrison, J. M., and Reiman, M. I. (1981). Reflected Brownian motion on an orthant. Annals of Probability, 9, 302–308.

    Article  MathSciNet  MATH  Google Scholar 

  28. Harrison, J. M., and Wein, L. M. (1989). Scheduling networks of queues: heavy traffic analysis of a simple open network. Queueing Systems: Theory and Applications, 5, 265–280.

    Article  MathSciNet  MATH  Google Scholar 

  29. Harrison, J. M., and Williams, R. J. (1987). Brownian models of open queueing networks with homogeneous customer populations. Stochastics, 22, 77–115.

    MathSciNet  MATH  Google Scholar 

  30. Harrison, J. M., and Williams, R. J. (1987). Multidimensional reflected Brownian motions having exponential stationary distributions. Annals of Probability, 15, 115–137.

    Article  MathSciNet  MATH  Google Scholar 

  31. Harrison, J. M., and Williams, R. J. (1992). Brownian models of feedforward queueing networks: quasireversibility and product form solutions. Annals of Applied Probability, 2, 263–293.

    Article  MathSciNet  MATH  Google Scholar 

  32. Harrison, J. W., and Williams, R. J. (1995). A multiclass closed queueing network with unconventional heavy traffic behavior. Annals of Applied Probability, to appear.

    Google Scholar 

  33. Harrison, J. M., Williams, R. J., and Chen, H. (1990). Brownian models of closed queueing networks with homogeneous customer populations. Stochastics and Stochastics Reports, 29, 37–74.

    MATH  Google Scholar 

  34. Hobson, D. G., and Rogers, L. C. G. (1993). Recurrence and transience of reflecting Brownian motion in the quadrant. Math. Proc. Cambridge Philosophical Society, 113, 387–399.

    Article  MathSciNet  MATH  Google Scholar 

  35. Iglehart, D. L., and Whitt, W. (1970). Multiple channel queues in heavy traffic

    Google Scholar 

  36. I. Adv. Appl. Prob., 2, 150–177.

    Google Scholar 

  37. Iglehart, D. L., and Whitt, W. (1970). Multiple channel queues in heavy traffic

    Google Scholar 

  38. II. Adv. Appl. Prob., 2, 355–364.

    Google Scholar 

  39. Johnson, D. P. (1983). Diffusion Approximations for Optimal Filtering of Jump Processes and for Queueing Networks. Ph.D. dissertation, Department of Mathematics, University of Wisconsin, Madison, WI.

    Google Scholar 

  40. Kaspi, H., and Mandelbaum, A. (1992). Regenerative closed queueing networks. Stochastics and Stochastics Reports, 39, 239–258.

    MathSciNet  MATH  Google Scholar 

  41. Kelly, F. P., and Laws, C. N. (1993). Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling. Queueing Systems: Theory and Applications, 13, 47–86.

    Article  MathSciNet  MATH  Google Scholar 

  42. Krichagina, E. V., Liptser, R. S., and Puhalsky, A. A. (1988). Diffusion approximation for the system with arrival process depending on queue and arbitrary service distribution. Theory of Probability and Its Applications, 33, 124–135.

    Article  MathSciNet  MATH  Google Scholar 

  43. Kumar, P. R., and Meyn, S. P. (1995). Stability of queueing networks and scheduling policies. IEEE Transactions on Automatic Control, 40, 251–260.

    Article  MathSciNet  MATH  Google Scholar 

  44. Kumar, P. R., and Seidman, T. I. (1990). Dynamic instabilities and stabilization methods in distributed real-time scheduling of manufacturing systems. IEEE Transactions on Automatic Control, 35, 289–298.

    Article  MathSciNet  MATH  Google Scholar 

  45. Kushner, H. J. (1995). A control problem for a new type of public transportation system, via heavy traffic analysis. In Stochastic Networks, IMA Volumes in Mathematics and Its Applications, F. P. Kelly and R. J. Williams (eds.), 71, Springer-Verlag, New York, 139–167.

    Google Scholar 

  46. Lu, S. H., and Kumar, P. R. (1991). Distributed scheduling based on due dates and buffer priorities. IEEE Transactions on Automatic Control, 36, 1406–1416.

    Article  Google Scholar 

  47. Mandelbaum, A., and Massey, W. A. (1995). Strong approximations for time- dependent queues. Mathematics of Operations Research, 20, 33–64.

    Article  MathSciNet  MATH  Google Scholar 

  48. Massey, W. A. (1981). Nonstationary Queueing Networks. Ph.D. dissertation, Department of Mathematics, Stanford University, Stanford, CA.

    Google Scholar 

  49. Meyn, S. P., and Down, D. (1994). Stability of generalized Jackson networks. Annals of Applied Probability, 4, 124–148.

    Article  MathSciNet  MATH  Google Scholar 

  50. Pats, G. (1995). State Dependent Queueing Networks: Approximations and Applications. Ph.D. dissertation, Department of Industrial Engineering and Management, Technion, Haifa, Israel.

    Google Scholar 

  51. Peterson, W. P. (1991). Diffusion approximations for networks of queues with multiple customer types. Mathematics of Operations Research, 9, 90–118.

    Article  Google Scholar 

  52. Reiman, M. I. (1984). Open queueing networks in heavy traffic. Mathematics of Operations Research, 9, 441–458.

    Article  MathSciNet  MATH  Google Scholar 

  53. Reiman, M. I. (1988). A multiclass feedback queue in heavy traffic. Mathematics of Operations Research, 20, 179–207.

    MathSciNet  MATH  Google Scholar 

  54. Reiman, M. I., and Williams, R. J. (1988–89). A boundary property of semi- martingale reflecting Brownian motions. Probability Theory and Related Fields, 77, 87–97, and 80, 633.

    Article  MathSciNet  MATH  Google Scholar 

  55. Rybko, A. N., and Stolyar, A. L. (1991). Ergodicity of stochastic processes describing the operation of an open queueing network. Problemy Peredachi Informatsil, 28, 2–26.

    Google Scholar 

  56. Sauer, C. H., and Chandy, K. M. (1981). Computer Systems Performance Modeling. Prentice-Hall, Englewood Cliffs, N.J.

    Google Scholar 

  57. Seidman, T. I. (1994). ‘First come, first served’ can be unstable! IEEE Transactions on Automatic Control, 39, 2166–2171.

    Article  MathSciNet  MATH  Google Scholar 

  58. Skorokhod, A. V. (1956). Limit Theorems for Stochastic Processes. Theory of Probability and Its Applications, 1, 261 - 290.

    Article  Google Scholar 

  59. Taylor, L. M., and Williams, R. J. (1993). Existence and uniqueness of semimartingale reflecting Brownian motions in an orthant. Probability Theory and Related Fields, 96, 283–317.

    Article  MathSciNet  MATH  Google Scholar 

  60. Wein, L. M. (1990). Scheduling networks of queues: heavy traffic analysis of a two-station network with controllable inputs. Operations Research, 38, 1065–1078.

    Article  MathSciNet  MATH  Google Scholar 

  61. Wein, L. M. (1992). Scheduling networks of queues: heavy traffic analysis of a multistation network with controllable inputs. Operations Research, 40(suppl.), S312–S334.

    Article  MathSciNet  Google Scholar 

  62. Whitt, W. (1971). Weak convergence theorems for priority queues: preemptive resume discipline. J. Applied Probability, 8, 74–94.

    Article  MathSciNet  MATH  Google Scholar 

  63. Whitt, W. (1993). Large fluctuations in a deterministic multiclass network of queues. Management Science, 39, 1020–1028.

    Article  MATH  Google Scholar 

  64. Williams, R. J. (1985). Recurrence classification and invariant measure for reflected Brownian motion in a wedge. Annals of Probability, 13, 758–778.

    Article  MathSciNet  MATH  Google Scholar 

  65. Williams, R. J. (1987). Reflected Brownian motion with skew symmetric data in a polyhedral domain. Probability Theory and Related Fields, 75, 459–485.

    Article  MathSciNet  MATH  Google Scholar 

  66. Williams, R. J. (1995). Semimartingale reflecting Brownian motions in an or-thant. In Stochastic Networks, IMA Volumes in Mathematics and Its Applications, F. P. Kelly and R. J. Williams (eds.), 71, Springer-Verlag, New York, 125–137.

    Google Scholar 

  67. Williams, R. J. (1996). On the approximation of queueing networks in heavy traffic. In Stochastic Networks: Theory and Applications, F. P. Kelly, S. Zachary and I. Ziedins (eds.), Oxford University Press, Oxford.

    Google Scholar 

  68. Yao, D. D. (ed.) (1994). Stochastic Modeling and Analysis of Manufacturing Systems. Springer-Verlag, New York.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of California San Diego, 9500 Gilman Drive, La Jolla, CA, 92093-0112, USA

    R. J. Williams

Authors
  1. R. J. Williams
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Centro Vito Volterra, Universita degli Studi di Roma Tor Vergata, Via della Ricerca Scientifica, 00133, Roma, Italy

    L. Accardi

  2. Department of Statistics, Columbia University, 2990 Broadway Mail Code 4403, 10027, New York, NY, USA

    C. C. Heyde

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag New York, Inc.

About this chapter

Cite this chapter

Williams, R.J. (1998). Some Recent Developments for Queueing Networks. In: Accardi, L., Heyde, C.C. (eds) Probability Towards 2000. Lecture Notes in Statistics, vol 128. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2224-8_20

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-2224-8_20

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-98458-2

  • Online ISBN: 978-1-4612-2224-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation