SEECS Colloquium

To support Quality of Service (QoS) in the next generation multi-service Internet, new algorithms are needed for many network components, such as routing, scheduling, and admission control. QoS routing, which identifies paths that have sufficient resources to satisfy the QoS requirement of a connection and selects a path that leads to high overall resource utilization, is one of the most important components for QoS provision. QoS routing consists of two tasks, the maintenance of global network state information and the computation of feasible paths. Many issues related to these two tasks remain to be addressed. Maintaining precise global network state information in large networks is almost impossible and the path computation for certain QoS routing problems, such as the multi-constrained QoS routing problem, is inherently difficult.

In this talk, I will present selected challenges and solutions in QoS routing that we have been working on. I will first illustrate the difficulty of maintaining precise global network state information and describe the multi-contrained QoS routing problem. I will then discuss routing algorithms to tolerate imprecise global state information and present efficient heuristics that can effectively solve multi-constrained QoS routing problems. I will conclude by pointing out potential future research directions in the QoS routing area.

Xin Yuan received the Ph.D. degree in computer science from the University of Pittsburgh. He is currently an assistant professor in the Department of Computer Science, Florida State University. His research interests include computer networks, optical networks, distributed and parallel systems and compilers. Dr. Yuan is a member of ACM and IEEE.