Before revision: In this paper, we analyze a scheduling algorithm which is suitable for the heterogeneous traffic network.
After revision: In this paper, we analyze 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.