Layered queueing network

Last updated

In queueing theory, a discipline within the mathematical theory of probability, a layered queueing network (or rendezvous network [1] ) is a queueing network model where the service time for each job at each service node is given by the response time of a queueing network (and those service times in turn may also be determined by further nested networks). Resources can be nested and queues form along the nodes of the nesting structure. [2] [3] The nesting structure thus defines "layers" within the queueing model. [2]

Layered queueing has applications in a wide range of distributed systems which involve different master/slave, replicated services and client-server components, allowing each local node to be represented by a specific queue, then orchestrating the evaluation of these queues. [2]

For large population of jobs, a fluid limit has been shown in PEPA to be a give good approximation of performance measures. [4]

References

  1. ↑ Neilson, J. E.; Woodside, C. M.; Petriu, D. C.; Majumdar, S. (1995). "Software bottlenecking in client-server systems and rendezvous networks". IEEE Transactions on Software Engineering . 21 (9): 776. CiteSeerX   10.1.1.47.4391 . doi:10.1109/32.464543.
  2. 1 2 3 Franks, G.; Al-Omari, T.; Woodside, M.; Das, O.; Derisavi, S. (2009). "Enhanced Modeling and Solution of Layered Queueing Networks". IEEE Transactions on Software Engineering . 35 (2): 148. doi:10.1109/TSE.2008.74. S2CID   15125984.
  3. ↑ Tribastone, M.; Mayer, P.; Wirsing, M. (2010). "Performance Prediction of Service-Oriented Systems with Layered Queueing Networks" (PDF). Leveraging Applications of Formal Methods, Verification, and Validation. LNCS. Vol. 6416. p. 51. doi:10.1007/978-3-642-16561-0_12. ISBN   978-3-642-16560-3.
  4. ↑ Tribastone, M. (2013). "A Fluid Model for Layered Queueing Networks" (PDF). IEEE Transactions on Software Engineering . 39 (6): 744–756. doi:10.1109/TSE.2012.66. S2CID   14754101. Archived from the original (PDF) on 2016-03-03. Retrieved 2015-09-04.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.