Network Protocol Designs: Fast Queuing Policies via Convex Relaxation

Abstract

With the recent rise of mobile and multimedia applications, other considerations such as power consumption and/or Quality of Service (QoS) are becoming increasingly important factors in designing network protocols. As such, we present a new framework for designing robust network protocols under varying network conditions that attempts to integrate various given objectives while satisfying some pre-specified levels of Quality of Service. The proposed framework abstracts a network protocol as a queuing policy, and relies on convex relaxation methods and the theory of mixing time for finding the fast queuing policies that drive the distribution of packets in a queue to a given target stationary distribution. In addition, we show how to augment the basic proposed framework to obtain a queuing policy that produces e-approximation to the target distribution with faster convergence time which is useful in fast-changing network conditions. Both theoretical and simulation results are presented to verify the effectiveness of the proposed framework.