File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A Geometric Perspective to Multiple-Unicast Network Coding

TitleA Geometric Perspective to Multiple-Unicast Network Coding
Authors
KeywordsGeometric Information Flow
Multicommodity Flow
Multiple-unicast
Network Coding
Space Information Flow
Issue Date2014
PublisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?puNumber=18
Citation
IEEE Transactions on Information Theory, 2014, v. 60 n. 5, p. 2884 - 2895 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, and is now a well-known unsolved problem in the field of network coding. Based on a recently proposed tool of space information flow, 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/201499
ISSN
2019 Impact Factor: 3.036
2015 SCImago Journal Rankings: 1.433
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorXiahou, T-
dc.contributor.authorLi, Z-
dc.contributor.authorWu, C-
dc.contributor.authorHuang, J-
dc.date.accessioned2014-08-21T07:29:16Z-
dc.date.available2014-08-21T07:29:16Z-
dc.date.issued2014-
dc.identifier.citationIEEE Transactions on Information Theory, 2014, v. 60 n. 5, p. 2884 - 2895-
dc.identifier.issn0018-9448-
dc.identifier.urihttp://hdl.handle.net/10722/201499-
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, and is now a well-known unsolved problem in the field of network coding. Based on a recently proposed tool of space information flow, 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.languageeng-
dc.publisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?puNumber=18-
dc.relation.ispartofIEEE Transactions on Information Theory-
dc.rightsIEEE Transactions on Information Theory. Copyright © IEEE.-
dc.rights©2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.-
dc.subjectGeometric Information Flow-
dc.subjectMulticommodity Flow-
dc.subjectMultiple-unicast-
dc.subjectNetwork Coding-
dc.subjectSpace Information Flow-
dc.titleA Geometric Perspective to Multiple-Unicast Network Coding-
dc.typeArticle-
dc.identifier.emailWu, C: cwu@cs.hku.hk-
dc.identifier.authorityWu, C=rp01397-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/TIT.2014.2308998-
dc.identifier.scopuseid_2-s2.0-84899625015-
dc.identifier.hkuros232115-
dc.identifier.volume60-
dc.identifier.issue5-
dc.identifier.spage2884-
dc.identifier.epage2895-
dc.identifier.isiWOS:000335151900030-
dc.publisher.placeUnited States-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats