On the Capacity Bounds of Undirected Networks

Details On the Capacity Bounds of Undirected Networks On the Capacity Bounds of Undirected Networks

2008-04-28

arxiv.org/abs/0804.4455v1

IEEE International Symposium on Information Theory (ISIT), Nice, France, June 2007

Computer Science

Information Theory

5 pages, 5 figures, ISIT 2007 conference

Scientific paper

In this work we improve on the bounds presented by Li&Li for network coding gain in the undirected case. A tightened bound for the undirected multicast problem with three terminals is derived. An interesting result shows that with fractional routing, routing throughput can achieve at least 75% of the coding throughput. A tighter bound for the general multicast problem with any number of terminals shows that coding gain is strictly less than 2. Our derived bound depends on the number of terminals in the multicast network and approaches 2 for arbitrarily large number of terminals.

Affiliated with

Also associated with

No associations

Rating

On the Capacity Bounds of Undirected 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 On the Capacity Bounds of Undirected Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Capacity Bounds of Undirected Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-692248