In queueing theory, a discipline within the mathematical theory of probability, a layered queueing network (or rendezvous network) 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. The nesting structure thus defines "layers" within the queueing model.
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.
For large population of jobs, a fluid limit has been shown in PEPA to be a give good approximation of performance measures.
- ^ 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. doi:10.1109/32.464543.
- ^ a b c 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.
- ^ Tribastone, M.; Mayer, P.; Wirsing, M. (2010). "Performance Prediction of Service-Oriented Systems with Layered Queueing Networks". Leveraging Applications of Formal Methods, Verification, and Validation (PDF). LNCS. 6416. p. 51. ISBN 978-3-642-16560-3. doi:10.1007/978-3-642-16561-0_12.
- ^ 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.