17 search results - page 1 / 4 » Approximate analysis of blocking queueing networks with temp... |
DSN
2011
IEEE
12 years 4 months ago
2011
IEEE
—In this paper we extend the class of MAP queueing networks to include blocking models, which are useful to describe the performance of service instances which have a limited con...
SIGMETRICS
2008
ACM
13 years 4 months ago
2008
ACM
Burstiness and temporal dependence in service processes are often found in multi-tier architectures and storage devices and must be captured accurately in capacity planning models...
ANSS
2005
IEEE
13 years 10 months ago
2005
IEEE
We consider a traffic-groomed optical network consisting of N nodes arranged in tandem. This optical network is modeled by a tandem queueing network of multi-rate loss queues with...
PE
2010
Springer
13 years 3 months ago
2010
Springer
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
QUESTA
2006
13 years 4 months ago
2006
So-called Whittle networks have recently been shown to give tight approximations for the performance of non-locally balanced networks with blocking, including practical routing pol...