The “Price of Forgetting” (PoF), the ratio between the minimum response times achieved by a probabilistic broker and a broker with memory, is shown to be ...
[PDF] The Price of Forgetting in Parallel and Non-Observable Queues
polaris.imag.fr › jonatha.anselmi
Abstract. We consider a broker-based network of non-observable parallel queues and analyze the minimum ex- pected response time and the optimal routing ...
The "Price of Forgetting" (PoF), the ratio between the minimum response times achieved by a probabilistic broker and a broker with memory, is shown to be ...
We consider a broker-based network of non-observable parallel queues and analyze the minimum expected response time and the optimal routing policy when the ...
The ''Price of Forgetting'' (PoF), the ratio between the minimum response times achieved by a probabilistic broker and a broker with memory, is shown to be ...
(Open Access) The price of forgetting in parallel and non-observable ...
typeset.io › Paper Directory
TL;DR: The ''Price of Forgetting'' (PoF), the ratio between the minimum response times achieved by a probabilistic broker and a broker with memory, ...
Bibliographic details on The price of forgetting in parallel and non-observable queues.
The ''Price of Forgetting'' (PoF), the ratio between the minimum response times achieved by a probabilistic broker and a broker with memory, is shown to be ...
The price of forgetting in parallel and non-observable queues. J Anselmi, B Gaujal. Performance Evaluation 68 (12), 1291-1311, 2011. 23, 2011 ; Combining size- ...
To study the added-value of non-Bernoulli routers, we introduce the “price of forgetting” and prove that it is bounded from above by two, which is tight in ...