Reliable Multicast with Shared Risk Link Groups (SRLGs) in Optical NetworksDate: 2014-04-11
Location: Holmes Hall 389
Speaker: Dr. Yi Zhu
Many emerging applications, such as parallel and distributed computing (including Grid computing and cloud computing), video distribution, real-time medical imaging, and database management, require multicast communication, which disseminates or collects data to or from a group of nodes. Furthermore, these applications require guaranteed high-bandwidth transmission, which can be achieved through optical multicast (a.k.a light-trees). In the case of a failure along a light-tree, nodes/users may not be able to receive data from the tree. Since one failure event may affect multiple links and nodes in the optical network, high reliability of the light-tree becomes a critical consideration. In this talk, Dr. Zhu will first model the effect of failure events through shared risk link groups (SRLG). Next, he will present the reliable multicast problem and analyze the complexity of the problem. Dr. Zhu will provide a greedy approximation algorithm and analyze the approximation ratio of the reliable broadcast, which is the special case of the reliable multicast. Finally, he will discuss the algorithm to obtain approximation solutions of the reliable multicast problem through extending the algorithms of the reliable broadcast.
Dr. Yi Zhu received the B.S and M.S degree in Electrical Engineering from Shanghai Jiaotong University, China, in 2003 and 2006, respectively. He received the Ph.D. degree in computer science at the University of Texas at Dallas in 2011. He is currently an Assistant Professor of Computer Science at Hawaii Pacific University. His research interests include traffic grooming, reliability and survivability in optical networks as well as optimization and approximation algorithm design.