2010
DOI: 10.1007/978-1-4419-6472-4_7
|View full text |Cite
|
Sign up to set email alerts
|

Decomposition and Aggregation in Queueing Networks

Abstract: This chapter considers the decomposition and aggregation of multiclass queueing networks with state-dependent routing. Combining state-dependent generalisations of quasi-reversibility and biased local balance, sufficient conditions are obtained under which the stationary distribution of the network is of product-form. This product-form factorises into one part that describes the nodes of the network in isolation, and one part that describes the routing and the global network state. It is shown that a decomposi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 24 publications
0
2
0
Order By: Relevance
“…These examples illustrate the relation between Norton's theorem and insensitivity for open networks comprised of quasireversible stations. Norton's theorem may be extended to open and closed networks with more general detailed and global states [4]. Insensitivity for symmetric queues may be extended to insensitivity of the sojourn time distribution at a quasireversible sub-network, except for its mean, see [6] for an overview of such results.…”
Section: Discussionmentioning
confidence: 99%
“…These examples illustrate the relation between Norton's theorem and insensitivity for open networks comprised of quasireversible stations. Norton's theorem may be extended to open and closed networks with more general detailed and global states [4]. Insensitivity for symmetric queues may be extended to insensitivity of the sojourn time distribution at a quasireversible sub-network, except for its mean, see [6] for an overview of such results.…”
Section: Discussionmentioning
confidence: 99%
“…[30][31][32][33]). Recently, in a setting of general stochastic processes, these results have been unified and extended in [34,35].…”
Section: Decompositionmentioning
confidence: 98%