Improving the multicommodity flow rates with network codes for two sources

Elona Erez, Meir Feder

Research output: Contribution to journalArticlepeer-review


In this work we introduce a construction and analysis of network codes for two sources. The region of achievable rates for this problem is still unknown. The scheme we suggest is based on modifying the multicommodity flow solution and thus improving the achievable rate region, w.r.t the uncoded case. The similarity to the flow problem allows our method to be implemented distributively. We show how the construction algorithm can be combined with distributed backpressure routing algorithms for wireless ad-hoc networks. For both the nondistributed case and the distributed case, the computational complexity of our algorithm for network coding is comparable to that of the parallel multicommodity flow problem. We provide non trivial upper and lower bounds on the performance of our scheme, using random coding techniques.

Original languageEnglish
Article number5072365
Pages (from-to)814-824
Number of pages11
JournalIEEE Journal on Selected Areas in Communications
Issue number5
StatePublished - Jun 2009


  • Ad-hoc networks
  • Backpressure
  • Distributed network coding
  • Multicommodity flow
  • Multiple unicast


Dive into the research topics of 'Improving the multicommodity flow rates with network codes for two sources'. Together they form a unique fingerprint.

Cite this