Layered queueing network

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]

External links

Tutorial Introduction to Layered Modeling of Software Performance by Murray Woodside, Carleton University

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.464543 instead.
^ ^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.
^ Leveraging Applications of Formal Methods, Verification, and Validation edited by Tiziana Margaria and Bernhard Steffen 2010 ISBN 3642165605 pages 56-58 [1]
^ 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.

This computing article is a stub. You can help Wikipedia by expanding it.

[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.

[Franks-2] 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.

[Tiziana-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.

[1]

[2]

[3]

[4]

v t e Queueing theory
Single queueing nodes	D/M/1 queue M/D/1 queue M/D/c queue M/M/1 queue Burke's theorem M/M/c queue M/M/∞ queue M/G/1 queue Pollaczek–Khinchine formula Matrix analytic method M/G/k queue G/M/1 queue G/G/1 queue Kingman's formula Lindley equation Fork–join queue Bulk queue
Arrival processes	Poisson point process Markovian arrival process Rational arrival process
Queueing networks	Jackson network Traffic equations Gordon–Newell theorem Mean value analysis Buzen's algorithm Kelly network G-network BCMP network
Service policies	FIFO LIFO Processor sharing Round-robin Shortest job next Shortest remaining time
Key concepts	Continuous-time Markov chain Kendall's notation Little's law Product-form solution Balance equation Quasireversibility Flow-equivalent server method Arrival theorem Decomposition method Beneš method
Limit theorems	Fluid limit Mean-field theory Heavy traffic approximation Reflected Brownian motion
Extensions	Fluid queue Layered queueing network Polling system Adversarial queueing network Loss network Retrial queue
Information systems	Data buffer Erlang (unit) Erlang distribution Flow control (data) Message queue Network congestion Network scheduler Pipeline (software) Quality of service Scheduling (computing) Teletraffic engineering
Category