Title :
Scheduling with throughput-guarantee in wireless networks: Recent trends and next steps
Speaker :
Ph.D. Yung Yi (Princeton University)
Time & Place :
2007년 5월 25일 (금요일) 오전 11시
301동 202호
Abstract :
Since the seminal work by Tassiulas and Aphremides on throughput
maximization for constrained queueing systems, there has been growing
interest in distributed MAC scheduling algorithms with provable
throughput-guarantees over wireless multi-hop networks. The problem can
generally be described as finding a throughput-optimal algorithm, i.e., link
scheduling algorithm stabilizing the system (i.e., keeping the number of
packets in all link-queues finite) for any feasible offered load. In the
first part of talk, we first survey the problem formulation, the key ideas,
and some representative algorithms in literature. In the second part of the
talk, we discuss the recent advances in distributed algorithms, further
discusses how to study the tradeoff between complexity and efficiency, and
conclude the talk by looking at the future research directions in this
research area.
Bio:
Yung Yi received the B.E. and the M.E. in the School of Computer Science and
Engineering from Seoul National University, South Korea in 1997 and 1999, respectively.
He received his Ph.D. in the Electrical and Computer Engineering, University of Texas at Austin, USA.
He is currently a post-doctoral research associate in Princeton University.
His current research interests include scheduling and QoS for wireless and ad-hoc networks,
congestion control in the Internet, performance analysis of computer networks.
Contact :
02-880-1832 (멀티미디어 이동통신 연구실)