Now showing items 1-3 of 3
Efficiency of simulation in monotone hyper-stable queueing networks
We consider Jackson queueing networks with finite buffer constraints (JQN) and analyze the efficiency of sampling from their stationary distribution. In the context of exact sampling, the monotonicity structure of JQNs ...
The price of forgetting in parallel and non-observable queues
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 broker has the memory of its previous routing decisions. We provide ...
Optimal routing in parallel, non-observable queues and the price of anarchy revisited
We consider a network of parallel, non-observable queues and analyze the "price of anarchy", an index measuring the worst-case performance loss of a decentralized system with respect to its centralized counterpart in ...