Skip to main content

Part of the book series: Stochastic Modelling and Applied Probability ((SMAP,volume 46))

Abstract

A Jackson network consists of J nodes (or stations), each with one or several servers. The processing times of jobs at each node are i.i.d., following an exponential distribution with unit mean. The service rate, i.e., the rate by which work is depleted, at each node i can be both node-dependent and state-dependent. Specifically, whenever there are x i jobs at node i, the processing rate is μ i (x i ),where μ i (·)is a function Z + ↦ ℜ+, with μ i (0)= 0 and μ i (x) > 0 for all x > 0. Jobs travel among the nodes following a routing matrix P:= (p ij ), where, for i, j = 1,..., J,p ij is the probability that a job leaving node i will go to node j.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 49.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 99.99
Price excludes VAT (USA)
  • Durable hardcover 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.

References

  1. Buzacott, J.A. and Shanthikumar, J.G. 1993. Stochastic Models of Manufacturing Systems, Prentice Hall, Englewood Cliffs, NJ.

    Google Scholar 

  2. Buzacott, J.A. and Yao, D.D. 1986. On Queueing Network Models of Flexible Manufacturing Systems, Queueing Systems: Theory and Applications, 1, 5–27.

    Article  MathSciNet  MATH  Google Scholar 

  3. Buzacott, J.A., Shanthikumar, J.G., and Yao, D.D. 1994. Stochastic Modeling and Analysis of Manufacturing Systems, Chapter 1, D.D. Yao (ed.), Springer-Verlag, New York.

    Google Scholar 

  4. Buzen, J.B. 1973. Computational Algorithms for Closed Queueing Networks with Exponential Servers. Comm. ACM, 16, 527–531.

    Article  MathSciNet  MATH  Google Scholar 

  5. Gordon, W.J. and Newell, G. F. 1967. Closed Queueing Networks with Exponential Servers. Operations Research, 15, 252–267.

    Google Scholar 

  6. Jackson, J.R. 1957. Networks of Waiting Lines. Operations Research, 5, 518–521.

    Article  MathSciNet  Google Scholar 

  7. Jackson, J.R. 1963. Jobshop-Like Queueing Systems. Management Science, 10, 131–142.

    Article  Google Scholar 

  8. Kelly, F.P. 1979. Reversibility and Stochastic Networks. Wiley, New York.

    MATH  Google Scholar 

  9. Reiser, M. and Lavenberg, S.S. 1980. Mean Value Analysis of Closed Multichain Queueing Networks. J. Assoc. Comp. Mach., 27, 313–322.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer Science+Business Media New York

About this chapter

Cite this chapter

Chen, H., Yao, D.D. (2001). Jackson Networks. In: Fundamentals of Queueing Networks. Stochastic Modelling and Applied Probability, vol 46. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-5301-1_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-5301-1_2

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4419-2896-2

  • Online ISBN: 978-1-4757-5301-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics