# Calendar

Guest
Calendars

## MS Final Examination – Duong Nguyen-Huu

Monday, May 20, 2013 12:30 PM - 2:30 PM

Fast Queuing Policies via Convex Relaxation
Traditionally, networking protocol designs have placed much emphasis on point-to-point reliability and efficiency.  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 flexible framework for designing robust network protocols under varying network conditions that attempts to integrates 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 the optimization methods of convex relaxation 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. It is argued that a target stationary distribution can be used to characterize various performance metrics of network flow. Thus, finding a fast queuing policy that produces a given target stationary distribution is vital in achieving some given objectives. In addition, we show how to augment the basic proposed framework in order to obtain a queuing policy that produces $\epsilon$-approximation to the target distribution with even faster convergence time. This fast adaptation is especially useful for networking applications in fast-changing network conditions. Both theory and simulation results are presented to verify our framework.