Jump to content

Layered queueing network

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Gareth Jones (talk | contribs) at 17:43, 11 June 2013 (add fluid limit for large populations). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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]

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. ^ 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.464543 instead.
  2. ^ a b c Attention: This template ({{cite doi}}) is deprecated. To cite the publication identified by doi:10.1109/TSE.2008.74, please use {{cite journal}} (if it was published in a bona fide academic journal, otherwise {{cite report}} with |doi=10.1109/TSE.2008.74 instead.
  3. ^ Leveraging Applications of Formal Methods, Verification, and Validation edited by Tiziana Margaria and Bernhard Steffen 2010 ISBN 3642165605 pages 56-58 [1]
  4. ^ Attention: This template ({{cite doi}}) is deprecated. To cite the publication identified by doi:10.1109/TSE.2012.66, please use {{cite journal}} (if it was published in a bona fide academic journal, otherwise {{cite report}} with |doi=10.1109/TSE.2012.66 instead.