Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

When is n-pairs information a multicommodity flow?

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Nair, G.N. ; Dept. Electr. & Electron. Eng., Univ. of Melbourne, Melbourne, VIC, Australia

Information does not generally behave like a flow in communication networks with multiple sources and sinks. However, it is often conceptually and practically useful to be able to associate separate data streams with each source-sink pair, with only routing and no coding performed at the network nodes. This raises the question of whether there is a nontrivial class of network topologies for which achievability is always equivalent to “routability”, for any combination of source signals and positive channel capacities. This paper considers a possibly cyclic, directed, errorless network with n source-sink pairs, mutually independent source signals, and a relaxed communication objective in terms of demanded information rates at sinks. The concept of triangularizability is introduced and it is shown that, if the network topology is triangularizable, then a given combination of source signals, demand rates and channel capacities is achievable if and only if the digraph supports a feasible multicommodity flow.

Published in:

Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on

Date of Conference:

July 31 2011-Aug. 5 2011