A Study of the Multiple-Unicast Network Coding Conjecture Using Riemannian Manifolds

Network coding encourages information mixing at the intermediate nodes within a network. The multiple-unicast conjecture proposed by Li and Li [18] in 2004 is one of the most well-known unsolved problems in network coding field. The conjecture asserts that, for multiple independent unicast transmissions in an undirected network, network coding has no advantage over traditional routing. In this thesis, we study the conjecture by embedding graphs into Riemannian manifolds using a geometric framework developed by Xiahou el al. [32]. We prove that isometric embedding of graphs into a Riemannian manifold is impossible. Then, interestingly, we construct an embedding that achieves an infinitesimally small distortion. We show that if the multiple-unicast network coding conjecture is true on Riemannian manifolds, it is also true for undirected networks. Our hope is to develop a Riemannian geometry approach for making new progresses against the long-time open conjecture.

Name thesis:degree_name

Master of Science (MSc)

Discipline thesis:degree_discipline

Computer Science

Grantor dc:publisher.institution

Graduate Studies

Year dc:date.issued

2016

Author dc:creator

• Fang, Wei

Advisor dc:contributor.advisor

• Li, Zongpeng

Committee members dc:contributor.committeemember

• Hoyer, Peter Christian
• Niu, Di

• Computer Science

Statement dc:rights

• University of Calgary graduate students retain copyright ownership and moral rights for their thesis. You may use this material in any way that is permitted by the Copyright Act or through licensing that has been assigned to the document. For uses that are not allowable under copyright legislation or licensing, you are required to seek permission.

Language dc:language.iso

eng

DOI

http://dx.doi.org/10.11575/PRISM/25044

OAI identifier oai:identifier

oai:ucalgary.scholaris.ca:11023/3351