Network coding for non-uniform demands

Cassuto, Yuval; Bruck, Jehoshua

doi:10.1109/isit.2005.1523639

Cited by 13 publications

(16 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Such real-world heterogeneity is naturally modeled by the non-uniform demand network model [36], [37]. A non-uniform demand network is very similar to a multicast network, with one node acting as the information source and a set of nodes acting as receivers.…”

Section: Non-uniform Demand Network and Average Throughputmentioning

confidence: 99%

See 1 more Smart Citation

A Constant Bound on Throughput Improvement of Multicast Network Coding in Undirected Networks

Lau

2009

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Recent research in network coding shows that, joint consideration of both coding and routing strategies may lead to higher information transmission rates than routing only. A fundamental question in the field of network coding is: how large can the throughput improvement due to network coding be? In this paper, we prove that in undirected networks, the ratio of achievable multicast throughput with network coding to that without network coding is bounded by a constant ratio of 2, i.e., network coding can at most double the throughput. This result holds for any undirected network topology, any link capacity configuration, any multicast group size, and any source information rate. This constant bound 2 represents the tightest bound that has been proved so far in general undirected settings, and is to be contrasted with the unbounded potential of network coding in improving multicast throughput in directed networks.

show abstract

Section: Non-uniform Demand Network and Average Throughputmentioning

confidence: 99%

“…Unfortunately, non-uniform multicast is computationally a much harder problem than multicast. Cassuto and Bruck [37] proved that determining whether a rate vector χ 1 , . .…”

Section: Non-uniform Demand Network and Average Throughputmentioning

confidence: 99%

A Constant Bound on Throughput Improvement of Multicast Network Coding in Undirected Networks

Lau

2009

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

show abstract

“…Although there are directed graph instances where the network coding throughput increase is proportional to the number of nodes in the graph, we are yet to find an undirected graph instance where network coding offers any benefits. Another transmission scenario for which the benefits of coding are not fully understood are networks with nonuniform demands [6,8]. General traffic patterns are often very difficult to study, and optimal solutions may require exponential alphabet sizes [45] and non-linear operations [12,57].…”

Section: Resultsmentioning

confidence: 99%

Network coding for efficient network multicast

Soljanin¹,

Gupta²,

Kramer³

2009

Bell Labs Tech. J.

View full text Add to dashboard Cite

and consumed do not necessarily need to be kept separate when they are transported throughout the network: there are ways to combine and later extract independent information.Combining independent data streams enables us to better tailor the information flow to the network environment and accommodate the demands of specific traffic patterns. This shift in paradigm is expected to revolutionize the way we manage, operate, and even understand networks and will have a deep impact on a wide range of areas such as reliable delivery, resource sharing, efficient flow control, network monitoring, and security.Network coding is expected to play an important role in the way the coming generations of networks will be designed and operated. Theoretical results obtained since the introduction of network coding show its enormous potential for improving network performance [18,19]. Depending on the traffic scenario, on whether the network is wireless or wired,

show abstract

“…In [7], Cassuto and Bruck introduce the problem and give some results concerning the achievability of the individual max-flow rates to each sink. In our work, we address similar guarantees but for a wider class of network demands.…”

Section: A Related Workmentioning

confidence: 99%

“…Unlike [7], in which the network demand problems shown to be NP-hard do not have fully saturated demands, our proof considers sink demands in which saturation must occur. The coloring problem which we consider is the following: Given an undirected graphĜ = (V ,Ê), is there a coloring using n [or fewer] colors?…”

Section: Appendixmentioning

confidence: 99%

Low-complexity non-uniform demand multicast network coding problems

Koo

Gill

2009

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

View full text Add to dashboard Cite

Abstract-The non-uniform demand network coding problem is posed as a single-source and multiple-sink network transmission problem where the sinks may have heterogeneous demands. In contrast with multicast problems, non-uniform demand problems are concerned with the amounts of data received by each sink, rather than the specifics of the received data. In this work, we enumerate non-uniform network demand scenarios under which network coding solutions can be found in polynomial time. This is accomplished by relating the demand problem with the graph coloring problem, and then applying results from the strong perfect graph theorem to identify coloring problems which can be solved in polynomial time. This characterization of efficiently-solvable non-uniform demand problems is an important step in understanding such problems, as it allows us to better understand situations under which the NP-complete problem might be tractable.

show abstract

Network coding for non-uniform demands

Cited by 13 publications

References 11 publications

A Constant Bound on Throughput Improvement of Multicast Network Coding in Undirected Networks

A Constant Bound on Throughput Improvement of Multicast Network Coding in Undirected Networks

Network coding for efficient network multicast

Low-complexity non-uniform demand multicast network coding problems

Contact Info

Product

Resources

About