2000 character limit reached
Random Fluid Limit of an Overloaded Polling Model
Published 18 Jan 2013 in math.PR | (1301.4362v2)
Abstract: In the present paper, we study the evolution of an overloaded cyclic polling model that starts empty. Exploiting a connection with multitype branching processes, we derive fluid asymptotics for the joint queue length process. Under passage to the fluid dynamics, the server switches between the queues infinitely many times in any finite time interval causing frequent oscillatory behavior of the fluid limit in the neighborhood of zero. Moreover, the fluid limit is random. Additionally, we suggest a method that establishes finiteness of moments of the busy period in an M/G/1 queue.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.