ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let T>0T>0, let j≥2j\geq 2, and let c∈(0,1)c\in(0,1). The event that some servers have queues of length jj while the remaining servers are idle is

{X1n(t)=X2n(t)=⋯=Xjn(t)=c, Xj+1n(t)=0 for some t∈[0,T]}.\left\{X_1^n(t)=X_2^n(t)=\cdots=X_j^n(t)=c,\ X_{j+1}^n(t)=0\ \text{for some }t\in[0,T]\right\}.

This corresponds to ncnc queues of length jj and n(1−c)n(1-c) idle queues. Conjectured optimal trajectory. The most likely way for this event to occur is that the system first reaches a state with ncnc queues of length jj and the remaining n(1−c)n(1-c) queues of length j−1j-1 at some time t∈[0,T]t\in[0,T], after which the ncnc queues remain in that state while the other n(1−c)n(1-c) queues decrease to zero. Identifying this trajectory should characterize the decay rate of the event's probability. A rigorous analysis of these probability asymptotics is left open; the conjecture would provide an optimal trajectory and the associated decay rate for an imbalance in which some servers have long queues while others are idle.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.