KEYNOTE SPEAKER

Optimal and Near-Optimal Nonblocking Multicast Switching Networks

Prof. Si Qing Zheng
The University of Texas at Dallas, USA

Abstract

Switching networks play a key role in telecommunication systems, computer networks, and parallel computers. Multicast switching networks support one-to-many communications. It is known that the cost of strictly nonblocking multicast switching networks is at least O(N^2). In this talk, we introduce a classification of nonblocking multicast switching networks: wide-sense nonblocking close-end, wide-sense nonblocking open-end, wide-sense nonblocking fully adaptive, and rearrangeable nonblocking. We then present the design and analysis of nonblocking multicast switching networks with optimal-cost or near-optimal cost for these classes. We also present fast routing algorithms for these networks.

Biography of the Keynote Speaker

Si Qing Zheng received the PhD degree from the University of California, Santa Barbara, in 1987. Currently, he is a professor in computer science, computer engineering, and telecommunications engineering. Dr. Zheng's research interests include algorithms, computer and network architectures, parallel and distributed processing, hardware/software codesign, real-time and embedded systems, telecommunications, and VLSI design. He has published over 260 papers in these areas.
He served as the head of Computer Engineering Program, the head of Telecommunications Engineering Division, associate head of Department of Computer Science, and associate head of Department of Electrical Engineering at the University of Texas at Dallas. He was a consultant of several high-tech companies, and he holds numerous patents. He served as chairman of numerous international conferences and editor of several professional journals.