International audienceWe 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 ensures that such efficiency is of the order of the coupling time (or meeting time) of two extremal sample paths. In the context of approximate sampling, it is given by the mixing time. Under a condition on the drift of the stochastic process underlying a JQN, which we call hyper-stability, in our main result we show that the coupling time is polynomial in both the number of queues and buffer sizes. Then, we use this result to show that the mixing time of JQNs behaves similarly up to a given precision th...
International audiencePerfect simulation, or coupling from the past, is an efficient technique for s...
We consider open Jackson networks with losses with mixed finite and infinite queues and analyze the ...
We consider open Jackson networks with losses with mixed finite and infinite queues and analyze the ...
International audienceWe consider Jackson queueing networks with finite buffer constraints (JQN) and...
International audienceWe consider Jackson queueing networks with finite buffer constraints (JQN) and...
We consider Jackson queueing networks with finite buffer constraints (JQN) and analyze the efficienc...
We consider Jackson queueing networks with finite buffer constraints (JQN) and analyze the efficienc...
We consider Jackson queueing networks with finite buffer constraints (JQN) and analyze the efficienc...
We consider Jackson queueing networks with finite buffer constraints (JQN) and analyze the efficienc...
International audienceWe consider Jackson queueing networks (JQN) with finite capacity constraints a...
International audienceWe consider Jackson queueing networks (JQN) with finite capacity constraints a...
In this paper, the duration of perfect simulations for Markovian finite capacity queuing networks is...
International audienceTutorial on perfect sampling with applications to queueing network
International audienceTutorial on perfect sampling with applications to queueing network
International audiencePerfect simulation, or coupling from the past, is an efficient technique for s...
International audiencePerfect simulation, or coupling from the past, is an efficient technique for s...
We consider open Jackson networks with losses with mixed finite and infinite queues and analyze the ...
We consider open Jackson networks with losses with mixed finite and infinite queues and analyze the ...
International audienceWe consider Jackson queueing networks with finite buffer constraints (JQN) and...
International audienceWe consider Jackson queueing networks with finite buffer constraints (JQN) and...
We consider Jackson queueing networks with finite buffer constraints (JQN) and analyze the efficienc...
We consider Jackson queueing networks with finite buffer constraints (JQN) and analyze the efficienc...
We consider Jackson queueing networks with finite buffer constraints (JQN) and analyze the efficienc...
We consider Jackson queueing networks with finite buffer constraints (JQN) and analyze the efficienc...
International audienceWe consider Jackson queueing networks (JQN) with finite capacity constraints a...
International audienceWe consider Jackson queueing networks (JQN) with finite capacity constraints a...
In this paper, the duration of perfect simulations for Markovian finite capacity queuing networks is...
International audienceTutorial on perfect sampling with applications to queueing network
International audienceTutorial on perfect sampling with applications to queueing network
International audiencePerfect simulation, or coupling from the past, is an efficient technique for s...
International audiencePerfect simulation, or coupling from the past, is an efficient technique for s...
We consider open Jackson networks with losses with mixed finite and infinite queues and analyze the ...
We consider open Jackson networks with losses with mixed finite and infinite queues and analyze the ...