Generalized Network Sharing Outer Bound and the Two-Unicast Problem

descriptionPublicationkeyboard_double_arrow_right Article , Other literature type , Conference object 01 Jul 2011Publisher:IEEEJournal:2011 International Symposium on Networking Coding

Authors: Kamath, Sudeep U.; Tse, David N. C.; Anantharam, Venkat;

doi: 10.1109/isnetcod.2011.5978909

Generalized Network Sharing Outer Bound and the Two-Unicast Problem

- Summary
- Metrics

Abstract

We describe a simple improvement over the Network Sharing outer bound for the multiple unicast problem. We call this the Generalized Network Sharing (GNS) outer bound. We note two properties of this bound with regard to the two-unicast problem: a) it is the tightest bound that can be realized using only edge-cut bounds and b) it is tight in the special case when all edges except those from a so-called minimal GNS set have sufficiently large capacities. Finally, we present an example showing that the GNS outer bound is not tight for the two-unicast problem.

Related Organizations

University of California, Berkeley
United States

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	39
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%