11 problems
Let be the Lévy process in the factorisation … and let denote the tail of the exponential functional . R…
FCFS strong tail optimality conjecture. FCFS is strongly tail optimal for class-I job sizes: for every scheduling algorithm ,
Let and be the equilibrium queue lengths in the two-queue random walk, and let be the equilibrium queue length in the corresponding model with one queue…
Assume , and assume the stronger definition of together with and a non-lattice distribution for , as descr…
Tail-equivalence conjecture. There exists a constant such that
Boundary-case tail conjecture. The same conclusion should hold when
Conjecture that the oscillatory coefficient in double QBD tail asymptotics has modulus less than one
Modulus conjecture for . The coefficient always satisfies
Gaussian-tail conjecture. (a) exists for each ; (b) the sequence weakly converges to ; and (c)
Tail-dependence conjecture. The limiting tail behavior of depends on the service time distribution only through its first two moments, and on the patience t…
Gaussian-tail conjecture. The limit queue length process has a Gaussian tail, and the tail depends on the service time distribution only through its first two moments.
Let be a Lévy process and let … For some constant , tail-equivalence conjecture. … The conjecture is motivated by the heuristic that large v…