File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Space information flow: multiple unicast

TitleSpace information flow: multiple unicast
Authors
KeywordsGeometric framework
Geometric space
Information flows
Multicast communication
Space models
Sum product
Undirected network
Unicast
Unsolved problems
Issue Date2012
PublisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000369
Citation
The 2012 IEEE International Symposium on Information Theory (ISIT 2012), Cambridge, MA., 1-6 July 2012. In IEEE International Symposium on Information Theory Proceedings, 2012, p. 1897-1901 How to Cite?
AbstractThe multiple unicast network coding conjecture states that for multiple unicast 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. In this work, we provide a proof to the conjecture in its space/geometric version. Space information flow is a new paradigm being proposed [3], [4]. It studies the transmission of information in a geometric space, where information flows are free to propagate along any trajectories, and may be encoded wherever they meet. The goal is to minimize a natural bandwidth-distance sum-product (network volume), while sustaining end-to-end unicast and multicast communication demands among terminals at known coordinates. The conjecture is true in networks only if it is true in space. Our main result is that network coding is indeed equivalent to routing in the space model. Besides its own merit, this partially verifies the original conjecture, and further leads to a geometric framework [5] for a hopeful proof to the conjecture. © 2012 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/160082
ISBN
ISSN

 

DC FieldValueLanguage
dc.contributor.authorLi, Zen_US
dc.contributor.authorWu, Cen_US
dc.date.accessioned2012-08-16T06:03:05Z-
dc.date.available2012-08-16T06:03:05Z-
dc.date.issued2012en_US
dc.identifier.citationThe 2012 IEEE International Symposium on Information Theory (ISIT 2012), Cambridge, MA., 1-6 July 2012. In IEEE International Symposium on Information Theory Proceedings, 2012, p. 1897-1901en_US
dc.identifier.isbn978-1-4673-2579-0-
dc.identifier.issn0271-4655-
dc.identifier.urihttp://hdl.handle.net/10722/160082-
dc.description.abstractThe multiple unicast network coding conjecture states that for multiple unicast 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. In this work, we provide a proof to the conjecture in its space/geometric version. Space information flow is a new paradigm being proposed [3], [4]. It studies the transmission of information in a geometric space, where information flows are free to propagate along any trajectories, and may be encoded wherever they meet. The goal is to minimize a natural bandwidth-distance sum-product (network volume), while sustaining end-to-end unicast and multicast communication demands among terminals at known coordinates. The conjecture is true in networks only if it is true in space. Our main result is that network coding is indeed equivalent to routing in the space model. Besides its own merit, this partially verifies the original conjecture, and further leads to a geometric framework [5] for a hopeful proof to the conjecture. © 2012 IEEE.-
dc.languageengen_US
dc.publisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000369-
dc.relation.ispartofIEEE International Symposium on Information Theory Proceedingsen_US
dc.rightsIEEE International Symposium on Information Theory Proceedings. Copyright © IEEE.-
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.subjectGeometric framework-
dc.subjectGeometric space-
dc.subjectInformation flows-
dc.subjectMulticast communication-
dc.subjectSpace models-
dc.subjectSum product-
dc.subjectUndirected network-
dc.subjectUnicast-
dc.subjectUnsolved problems-
dc.titleSpace information flow: multiple unicasten_US
dc.typeConference_Paperen_US
dc.identifier.emailLi, Z: zongpeng@ucalgary.caen_US
dc.identifier.emailWu, C: cwu@cs.hku.hk-
dc.identifier.authorityWu, C=rp01397en_US
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/ISIT.2012.6283627-
dc.identifier.scopuseid_2-s2.0-84867539560-
dc.identifier.hkuros202417en_US
dc.identifier.spage1897-
dc.identifier.epage1901-
dc.publisher.placeUnited States-
dc.customcontrol.immutablesml 130913-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats