Skip to main content

Multiclass Feedforward Networks

  • Chapter
Fundamentals of Queueing Networks

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

Abstract

In a feedforward network, jobs after service completion at a station can be routed only to a downstream station. Other than this restriction on routing, the network has more features than the generalized Jackson network studied in Chapter 7. In particular, jobs at each station come from different classes, with different service time distributions, and upon service completion will follow different routing sequences. In addition, job classes are partitioned into priority groups. Within the same group, jobs are served in the order of arrivals, i.e., following a first-in-first-out (FIFO) discipline. Among different groups, jobs are served under a preassigned preemptive priority discipline. Therefore, the model includes a network with a pure FIFO service discipline or a pure priority service discipline as a special case.

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

Access this chapter

eBook
USD 16.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. Chen, H. (1996). A sufficient condition for the positive recurrence of a semimartingale reflecting Brownian motion in an orthant, Annals of Applied Probability, 6, 758–765.

    Article  MathSciNet  MATH  Google Scholar 

  2. Chen, H. and X. Shen. (2000). Strong approximations for multiclass feedforward queueing networks. Annals of Applied Probability.

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  4. Kleinrock, L. (1976). Queueing Systems Volume II; Computer Applications, Wiley, New York.

    Google Scholar 

  5. Peterson, W.P. (1991). A heavy traffic limit theorem for networks of queues with multiple customer types, Mathematics of Operations Research, 16, 90–118.

    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). Multiclass Feedforward 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_9

Download citation

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

  • 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