2 papers
math.PR2026
Recurrence and transience of open Jackson networks with balanced nodes
Serguei Popov
Consider an open Jackson network with Poisson arrivals and exponential services, in which no node is overloaded and exactly~ nodes have load equal to~. We prove that the qu…
math.PR2024
On transience of queues
Serguei Popov
We consider an queue with infinite expected service time. We then provide the transience/recurrence classification of the states (the system is said to be at state …