3 problems

Consider a fluid network with finite buffers and its traffic equation … where a nonnegative solution is sought and the overflow algorithm is the algorithm introduced in the paper f…

Consider a queueing network with a discipline that is memoryless, meaning that the allocation process at time $t$ depends only on the queue length at time $t$. Let…

A strict GFN model consists of a family of trajectories satisfying conditions (a)–(e), including the concatenation property. Condition (e) conjecture. The condition described immed…