We study a stochastic network that consists of two servers shared by two classes of jobs. Class 1 jobs require a concurrent occupancy of both servers while class 2 jobs use only one server. The ...
We design a dynamic rate scheduling policy of Markov type by using the solution (a social optimal Nash equilibrium point) to a utility-maximization problem over a randomly evolving capacity set for a ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback