activity
20052017
most citedMetastability of Queuing Networks with Mobile Servers

5 citations · 10 across the 5 of their papers we have counts for

collaborators
Showing math.PRShow all

5 papers · 1 filter

math.PR2017★ 5 cited

Metastability of Queuing Networks with Mobile Servers

F. Baccelli, A. Rybko, S. Shlosman +1

We study symmetric queuing networks with moving servers and FIFO service discipline. The mean-field limit dynamics demonstrates unexpected behavior which we attribute to the meta-s…

math.PR2016★ 1 cited

Propagation of Chaos and Poisson Hypothesis

Serge Pirogov, Alexander Rybko, Senya Shlosman +1

We establish the Strong Poisson Hypothesis for symmetric closed networks. In particular, the asymptotic independence of the nodes -- as the size of the system tends to infinity --…

math.PR2014

Poisson Hypothesis for Open Networks at Low Load

Alexandre Rybko, Senya Shlosman, Alexandre Vladimirov

We study large communication networks of the mean-field type. The input flows to the nodes of the network are supposed to be stationary and with low rate. We show that such a netwo…

math.PR2013★ 3 cited

Queuing Networks with Varying Topology -- A Mean-Field Approach

François Baccelli, Alexandre Rybko, Senya Shlosman

We consider the queuing networks, which are made from servers, exchanging their positions. The customers, using the network, try to reach their destinations, which is complicated b…

math.PR2005★ 1 cited

Self-averaging property of queuing systems

Alexandre Rybko, Senya Shlosman, Alexandre Vladimirov

We establish the averaging property for a queuing process with one server, M(t)/GI/1. It is a new relation between the output flow rate and the input flow rate, crucial in the stud…