All seminars will take place via Zoom on Fridays at 11 a.m.
Note: Computer Science seminar talks are restricted to UCI community only. Please make sure you’re logged in to your UCI account before joining the talk, otherwise you won’t be able to join.
January 26, 2018
11:00am - 12:00pm
When specialized to the unicast setting, the UMW policy yields a throughput-optimal, loop-free, routing and link-scheduling policy. This is in contrast to the Back-Pressure (BP) policy which allows for packet cycling, resulting in excessive latency. Extensive simulation results show that the proposed UMW policy incurs substantially smaller delays as compared to backpressure. Conceptually, the UMW policy is derived by relaxing the precedence constraints associated with multi-hop routing and then solving a min-cost routing and max-weight scheduling problem on a virtual network of queues. The proof of optimality combines ideas from stochastic Lyapunov theory with a sample path argument from adversarial queueing theory.
His research is on communication networks and protocols with emphasis on satellite, wireless, and optical networks. He is the co-recipient of the MobiHoc 2016 best paper award, the Wiopt 2013 best paper award, and the Sigmetrics 2006 Best paper award. He is the Editor-in-Chief for IEEE/ACM Transactions on Networking, and served as Associate Editor for IEEE Transactions on Information Theory and IEEE/ACM Transactions on Networking. He was the Technical Program co-chair for IEEE Wiopt 2006, IEEE Infocom 2007, ACM MobiHoc 2007, and DRCN 2015. He is a Fellow of the IEEE and an Associate Fellow of the AIAA, and served on the IEEE Fellows committee.