76 search results - page 3 / 16 » Sojourn time approximations in queueing networks with feedba... |
VALUETOOLS
2006
ACM
14 years 1 months ago
2006
ACM
In the context of communication networks, the framework of stochastic event graphs allows a modeling of control mechanisms induced by the communication protocol and an analysis of ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We study the conditional sojourn time distributions of processor sharing (PS), foreground background processor sharing (FBPS) and shortest remaining processing time first (SRPT) s...
CJ
2010
13 years 4 months ago
2010
Consistent with the divide-and-conquer approach to problem solving, a recursive result is presented in the domain of stochastic modelling that derives product-form solutions for t...
PE
2010
Springer
13 years 5 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...
PAM
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. Router queues can impact both round-trip times and throughput. Yet little is publicly known about queue provisioning employed by Internet services providers for the route...