报告题目：A Reduction Approach to The Multiple-Unicast Conjecturein Network Coding

报告人：Zongpeng Li

时 间：2015年2月23日（星期二）下午15：30-16:30

地 点：77779193永利会议室（主校区南一楼中302）

Abstract： The multiple-unicast conjecture in network coding states that formultiple unicast sessions in an undirected network, network coding

has noadvantage over routing in improving the throughput or saving bandwidth. In thiswork, we propose a reduction method to study the multiple-unicast conjecture,and prove the conjecture for a new class of networks that are characterized byrelations between cut-sets and source-receiver

paths. This class subsumes thetwo known types of networks with non-zero max-flow min-cut gaps. Furthercombing this result with a computer-aided search, we derive as a corollary thatnetwork coding is unnecessary in networks with up to 6 nodes. We alsoprove the multiple-unicast

conjecture for almost all unit-link- length networkswith up to 3 sessions and 7 nodes.

报告人简介：（个人主页：http://www.cpsc.ucalgary.ca/~zongpeng）

李宗鹏教授1999年和2005年分别在清华大学和多伦多大学获得学士和博士学位。其后任职于加拿大卡尔加里大学。研究方向为计算机网络，云计算，网络编码。发表期刊与会议论文100多篇，其中包括中国计算机学会推荐的CCF-A类论文52篇。