5 citations · 6 across the 3 of their papers we have counts for
3 papers
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…
math-ph2004
Poisson Hypothesis for Information Networks II. Cases of Violations and Phase Transitions
Alexander Rybko, Senya Shlosman
We present examples of queuing networks that never come to equilibrium. That is achieved by constructing Non-linear Markov Processes, which are non-ergodic, and possess eternal tra…
math.PR2004★ 5 cited
Poisson Hypothesis for Information Networks (A study in non-linear Markov processes) I. Domain of Validity
A. Rybko, S. Shlosman
In this paper we study the Poisson Hypothesis, which is a device to analyze approximately the behavior of large queueing networks. We prove it in some simple limiting cases. We sho…