On a theory of network equivalence

We describe an equivalence result for network capacity. Roughly, our main result is as follows. Given a network of noisy, independent, memoryless links, a collection of demands can be met on the given network if and only if it can be met on another network where each noisy link is replaced by a nois...

Full description

Saved in:
Bibliographic Details
Published in2009 IEEE Information Theory Workshop on Networking and Information Theory pp. 326 - 330
Main Authors Koetter, R., Effros, M., Medard, M.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2009
Subjects
Complexity theory
Heart
Information theory
Multicast algorithms
Network coding
Routing
Signal analysis
Signal to noise ratio
Throughput
Unicast
Online AccessGet full text
ISBN1424445353
9781424445356
DOI10.1109/ITWNIT.2009.5158596

Cover

More Information
Summary:We describe an equivalence result for network capacity. Roughly, our main result is as follows. Given a network of noisy, independent, memoryless links, a collection of demands can be met on the given network if and only if it can be met on another network where each noisy link is replaced by a noiseless bit pipe with throughput equal to the noisy link capacity. This result was previously known only for multicast connections.
ISBN:1424445353
9781424445356
DOI:10.1109/ITWNIT.2009.5158596