Layered queueing network

In queueing theory, a discipline within the mathematical theory of probability, a layered queueing network (or rendezvous network{{Cite journal | last1 = Neilson | first1 = J. E. | last2 = Woodside | first2 = C. M.| last3 = Petriu | first3 = D. C.|author3-link=Dorina Petriu | last4 = Majumdar | first4 = S. | title = Software bottlenecking in client-server systems and rendezvous networks | doi = 10.1109/32.464543 | journal = IEEE Transactions on Software Engineering| volume = 21 | issue = 9 | pages = 776 | year = 1995 | citeseerx = 10.1.1.47.4391 }}) 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.{{Cite journal | last1 = Franks | first1 = G. | last2 = Al-Omari | first2 = T. | last3 = Woodside | first3 = M. | last4 = Das | first4 = O. | last5 = Derisavi | first5 = S. | title = Enhanced Modeling and Solution of Layered Queueing Networks | doi = 10.1109/TSE.2008.74 | journal = IEEE Transactions on Software Engineering| volume = 35 | issue = 2 | pages = 148 | year = 2009 | s2cid = 15125984 }}{{Cite book | last1 = Tribastone | first1 = M. | last2 = Mayer | first2 = P. | last3 = Wirsing | first3 = M. | doi = 10.1007/978-3-642-16561-0_12 | chapter = Performance Prediction of Service-Oriented Systems with Layered Queueing Networks | title = Leveraging Applications of Formal Methods, Verification, and Validation | series = LNCS| chapter-url = https://dl.dropboxusercontent.com/u/13100903/papers/isola2010.pdf| volume = 6416 | pages = 51 | year = 2010 | isbn = 978-3-642-16560-3 }} 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.{{Cite journal | last1 = Tribastone | first1 = M. | title = A Fluid Model for Layered Queueing Networks | doi = 10.1109/TSE.2012.66 | journal = IEEE Transactions on Software Engineering | volume = 39 | issue = 6 | url = https://dl.dropboxusercontent.com/u/13100903/papers/tse2013-lqn.pdf | pages = 744–756 | year = 2013 | s2cid = 14754101 | access-date = 2015-09-04 | archive-url = https://web.archive.org/web/20160303214445/https://dl.dropboxusercontent.com/u/13100903/papers/tse2013-lqn.pdf | archive-date = 2016-03-03 | url-status = dead }}