File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A Geometric Framework for Investigating the Multiple Unicast Network Coding Conjecture

TitleA Geometric Framework for Investigating the Multiple Unicast Network Coding Conjecture
Authors
Issue Date2012
PublisherI E E E. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6253017
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 How to Cite?
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.
Persistent Identifierhttp://hdl.handle.net/10722/160083
ISBN

 

DC FieldValueLanguage
dc.contributor.authorXiahou, Ten_US
dc.contributor.authorWu, Cen_US
dc.contributor.authorHuang, Jen_US
dc.contributor.authorLi, Zen_US
dc.date.accessioned2012-08-16T06:03:06Z-
dc.date.available2012-08-16T06:03:06Z-
dc.date.issued2012en_US
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-42en_US
dc.identifier.isbn9781467318907-
dc.identifier.urihttp://hdl.handle.net/10722/160083-
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.languageengen_US
dc.publisherI E E E. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6253017-
dc.relation.ispartofIEEE International Symposium on Network Coding Proceedingsen_US
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 Conjectureen_US
dc.typeConference_Paperen_US
dc.identifier.emailWu, C: cwu@cs.hku.hken_US
dc.identifier.authorityWu, C=rp01397en_US
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/NETCOD.2012.6261881-
dc.identifier.hkuros202418en_US
dc.identifier.spage37-
dc.identifier.epage42-
dc.publisher.placeUnited States-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats