A Tutorial on Queuing and Trunking with Applications to CommunicationsNetworks of Queues
A Tutorial on Queuing and Trunking with Applications to Communications: Networks of Queues
Tranter, William H.; MacKenzie, Allen B.
2012-01-01 00:00:00
[In previous chapters, we only considered individual queues in isolation. That is, we considered systems that consist of an arrival process, a single queue with a particular queuing discipline, and one or more servers. Modern data networks, however, consist of many queues that interact in complex ways. While many of these interactions defy analysis, in this chapter we introduce a model of a network of queues in which, after being served in one queue, customers may join another queue. The key result for this model is known as Jackson’s Theorem. However, we first present Burke’s Theorem, which provides some of the intuition behind Jackson’s Theorem, and then derive a simple version of Jackson’s Theorem. Next, we state some extensions of Jackson’s Theorem and the BCMP Theorem, which can also be viewed as a further extension of Jackson’s Theorem. It is important to carefully consider the statement of Jackson’s Theorem and the well-prescribed limits of its application. To this end, we carefully discuss “Kleinrock’s Assumption” throughout the chapter.]
http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.pnghttp://www.deepdyve.com/lp/springer-journals/a-tutorial-on-queuing-and-trunking-with-applications-to-communications-knABcZHUdn
A Tutorial on Queuing and Trunking with Applications to CommunicationsNetworks of Queues
[In previous chapters, we only considered individual queues in isolation. That is, we considered systems that consist of an arrival process, a single queue with a particular queuing discipline, and one or more servers. Modern data networks, however, consist of many queues that interact in complex ways. While many of these interactions defy analysis, in this chapter we introduce a model of a network of queues in which, after being served in one queue, customers may join another queue. The key result for this model is known as Jackson’s Theorem. However, we first present Burke’s Theorem, which provides some of the intuition behind Jackson’s Theorem, and then derive a simple version of Jackson’s Theorem. Next, we state some extensions of Jackson’s Theorem and the BCMP Theorem, which can also be viewed as a further extension of Jackson’s Theorem. It is important to carefully consider the statement of Jackson’s Theorem and the well-prescribed limits of its application. To this end, we carefully discuss “Kleinrock’s Assumption” throughout the chapter.]
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.