Layered queueing network
In computing, a layered queueing network (or rendezvous network[1]) is a queueing network model in which resources may be nested, with queues forming 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]
See also
References
- ^ Attention: This template ({{cite doi}}) is deprecated. To cite the publication identified by doi:10.1109/32.464543, please use {{cite journal}} (if it was published in a bona fide academic journal, otherwise {{cite report}} with
|doi=10.1109/32.464543instead. - ^ a b c G. Franks, et. al "Enhanced Modeling and Solution of Layered Queueing Networks" in IEEE Transactions on Software Engineering March-April 2009 Volume 35, Issue 2 pages 148-161
- ^ Leveraging Applications of Formal Methods, Verification, and Validation edited by Tiziana Margaria and Bernhard Steffen 2010 ISBN 3642165605 pages 56-58 [1]
 | This computing article is a stub. You can help Wikipedia by expanding it. |