File Download
 
Links for fulltext
(May Require Subscription)
 
Supplementary

Conference Paper: A Geometric Framework for Investigating the Multiple Unicast Network Coding Conjecture
  • Basic View
  • Metadata View
  • XML View
TitleA Geometric Framework for Investigating the Multiple Unicast Network Coding Conjecture
 
AuthorsXiahou, T
Wu, C
Huang, J
Li, Z
 
Issue Date2012
 
PublisherI E E E. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6253017
 
CitationThe IEEE International Symposium on Network Coding (NetCod 2012), Cambridge, Massachusetts, USA, 29-30 June 2012. In IEEE International Symposium on Network Coding Proceedings, 2012, p. 37-42 [How to Cite?]
DOI: http://dx.doi.org/10.1109/NETCOD.2012.6261881
 
AbstractThe multiple unicast network coding conjecture states that for multiple unicast sessions in an undirected network, network coding is equivalent to routing. Simple and intuitive as it appears, the conjecture has remained open since its proposal in 2004 [1], [2], and is now a well-known unsolved problem in the field of network coding. Based on a recently proposed tool of space information flow [3]-[5], we present a geometric framework for analyzing the multiple unicast conjecture. The framework consists of four major steps, in which the conjecture is transformed from its throughput version to cost version, from the graph domain to the space domain, and then from high dimension to 1-D, where it is to be eventually proved. We apply the geometric framework to derive unified proofs to known results of the conjecture, as well as new results previously unknown. A possible proof to the conjecture based on this framework is outlined.
 
ISBN9781467318907
 
DOIhttp://dx.doi.org/10.1109/NETCOD.2012.6261881
 
DC FieldValue
dc.contributor.authorXiahou, T
 
dc.contributor.authorWu, C
 
dc.contributor.authorHuang, J
 
dc.contributor.authorLi, Z
 
dc.date.accessioned2012-08-16T06:03:06Z
 
dc.date.available2012-08-16T06:03:06Z
 
dc.date.issued2012
 
dc.description.abstractThe multiple unicast network coding conjecture states that for multiple unicast sessions in an undirected network, network coding is equivalent to routing. Simple and intuitive as it appears, the conjecture has remained open since its proposal in 2004 [1], [2], and is now a well-known unsolved problem in the field of network coding. Based on a recently proposed tool of space information flow [3]-[5], we present a geometric framework for analyzing the multiple unicast conjecture. The framework consists of four major steps, in which the conjecture is transformed from its throughput version to cost version, from the graph domain to the space domain, and then from high dimension to 1-D, where it is to be eventually proved. We apply the geometric framework to derive unified proofs to known results of the conjecture, as well as new results previously unknown. A possible proof to the conjecture based on this framework is outlined.
 
dc.description.naturepublished_or_final_version
 
dc.identifier.citationThe IEEE International Symposium on Network Coding (NetCod 2012), Cambridge, Massachusetts, USA, 29-30 June 2012. In IEEE International Symposium on Network Coding Proceedings, 2012, p. 37-42 [How to Cite?]
DOI: http://dx.doi.org/10.1109/NETCOD.2012.6261881
 
dc.identifier.doihttp://dx.doi.org/10.1109/NETCOD.2012.6261881
 
dc.identifier.epage42
 
dc.identifier.hkuros202418
 
dc.identifier.isbn9781467318907
 
dc.identifier.spage37
 
dc.identifier.urihttp://hdl.handle.net/10722/160083
 
dc.languageeng
 
dc.publisherI E E E. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6253017
 
dc.publisher.placeUnited States
 
dc.relation.ispartofIEEE International Symposium on Network Coding Proceedings
 
dc.rightsIEEE International Symposium on Network Coding Proceedings. Copyright © I E E E.
 
dc.rights©2012 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
 
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License
 
dc.titleA Geometric Framework for Investigating the Multiple Unicast Network Coding Conjecture
 
dc.typeConference_Paper
 
<?xml encoding="utf-8" version="1.0"?>
<item><contributor.author>Xiahou, T</contributor.author>
<contributor.author>Wu, C</contributor.author>
<contributor.author>Huang, J</contributor.author>
<contributor.author>Li, Z</contributor.author>
<date.accessioned>2012-08-16T06:03:06Z</date.accessioned>
<date.available>2012-08-16T06:03:06Z</date.available>
<date.issued>2012</date.issued>
<identifier.citation>The IEEE International Symposium on Network Coding (NetCod 2012), Cambridge, Massachusetts, USA, 29-30 June 2012. In IEEE International Symposium on Network Coding Proceedings, 2012, p. 37-42</identifier.citation>
<identifier.isbn>9781467318907</identifier.isbn>
<identifier.uri>http://hdl.handle.net/10722/160083</identifier.uri>
<description.abstract>The multiple unicast network coding conjecture states that for multiple unicast sessions in an undirected network, network coding is equivalent to routing. Simple and intuitive as it appears, the conjecture has remained open since its proposal in 2004 [1], [2], and is now a well-known unsolved problem in the field of network coding. Based on a recently proposed tool of space information flow [3]-[5], we present a geometric framework for analyzing the multiple unicast conjecture. The framework consists of four major steps, in which the conjecture is transformed from its throughput version to cost version, from the graph domain to the space domain, and then from high dimension to 1-D, where it is to be eventually proved. We apply the geometric framework to derive unified proofs to known results of the conjecture, as well as new results previously unknown. A possible proof to the conjecture based on this framework is outlined.</description.abstract>
<language>eng</language>
<publisher>I E E E. The Journal&apos;s web site is located at http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6253017</publisher>
<relation.ispartof>IEEE International Symposium on Network Coding Proceedings</relation.ispartof>
<rights>IEEE International Symposium on Network Coding Proceedings. Copyright &#169; I E E E.</rights>
<rights>&#169;2012 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.</rights>
<rights>Creative Commons: Attribution 3.0 Hong Kong License</rights>
<title>A Geometric Framework for Investigating the Multiple Unicast Network Coding Conjecture</title>
<type>Conference_Paper</type>
<description.nature>published_or_final_version</description.nature>
<identifier.doi>10.1109/NETCOD.2012.6261881</identifier.doi>
<identifier.hkuros>202418</identifier.hkuros>
<identifier.spage>37</identifier.spage>
<identifier.epage>42</identifier.epage>
<publisher.place>United States</publisher.place>
<bitstream.url>http://hub.hku.hk/bitstream/10722/160083/1/Content.pdf</bitstream.url>
</item>