Structural Routability of n-Pairs Information Networks

Details Structural Routability of n-Pairs Information Networks Structural Routability of n-Pairs Information Networks

2011-08-31

arxiv.org/abs/1108.6260v1

Computer Science

Information Theory

16 pages

Scientific paper

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 possibly cyclic, directed, errorless networks 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.

Affiliated with

Also associated with

No associations

Rating

Structural Routability of n-Pairs Information Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Structural Routability of n-Pairs Information Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Structural Routability of n-Pairs Information Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-626132