The Optimal Policy Based On Queue-size In Switched Networks

In this paper, we consider a switched network with general continuous-time renew-al arrival process, including the Poisson process as a special case. More precisely, the switched network consists of N queues and a service facility. Once a packet is served from a queue, it leaves the network. The service discipline is based on an online schedul-ing policy in a SFA (store-and-forward allocation) manner. Under the assumption of gen-eral continuous-time renewal arrival process, we give the bound of the expected queue size with respect stationary distribution, and we prove the optimality in terms of queue size scaling and tail exponent.