In this paper, we analyze a scheduling algorithm which is suitable for the heterogeneous traffic network. In the large deviation setting, we are interested to see, how the asymptotic decay rate of maximum queue overflow probabilityachieved by this algorithm . We first derive an upper bound on the decay rate of the queue overflow probability as the queue overflow threshold approaches infinity. Then, we study several structural properties of the minimum cost path of the maximum queue length . Given these properties, we prove that the maximum queue length follows a sample path with linear increment. For certain parameter values , the scheduling algorithm is asymptotically optimal in reducing the maximum queue length. Through numerical results, we have show the large deviation properties of the queue length typically used in practice  .
In this paper, we study the stability of light traffic achieved by a scheduling algorithm which is suitable for heterogeneous traffic networks. Since analyzing a scheduling algorithm is intractable using the conventional mathematical tool, our goal is to minimize the largest queue-overflow probability achieved by the algorithm. In the large deviation setting, this problem is equivalent to maximizing the asymptotic decay rate of the largest queue-overflow probability . We first derive an upper bound on the decay rate of the queue overflow probability as the queue overflow threshold approaches infinity. Then, we study several structural properties of the minimum-cost-path to overflow of the queue with the largest length, which is basically equivalent to the decay rate of the largest queue-overflow probability . Given these properties, we prove that the queue with the largest length follows a sample path with linear increment. For certain parameter value , the scheduling algorithm is asymptotically optimal in reducing the largest queue length. Through numerical results, we have shown the large deviation properties of the queue length typically used in practice while varying one parameter of the algorithm .
R
analyze
study the stability of light traffic achieved by
R
the heterogeneous traffic network.
heterogeneous traffic networks. Since analyzing a scheduling algorithm is intractable using the conventional mathematical tool, our goal is to minimize the largest queue-overflow probability achieved by the algorithm.
R
we are interested to see, how
this problem is equivalent to maximizing
R
maximum queue overflow probabilityachieved by this algorithm
the largest queue-overflow probability
R
minimum cost path of the maximum queue length
minimum-cost-path to overflow of the queue with the largest length, which is basically equivalent to the decay rate of the largest queue-overflow probability
R
maximum queue
queue with the largest
R
values
value
R
maximum
largest
R
show
shown
A
while varying one parameter of the algorithm