This is not the latest version of this item. The latest version can be found here.
Only the source’s and sink’s neighborhood matters: convergence results for unicast and multicast connections on random graphs and hypergraphs.
Name
Article-3.pdf
Description
Accepted version
Size
365.05 KB
Format
Adobe PDF
Checksum (MD5)
4c609863b272b9bef6b747a22aab1c8c
Author(s)
Medard, Muriel
Casse, Jérôme
Date Issued
2014
Publisher
ICST
Citation
Medard, Muriel and Casse, Jérôme. 2014. "Only the source’s and sink’s neighborhood matters: convergence results for unicast and multicast connections on random graphs and hypergraphs.."
Version
Author's final manuscript
Abstract
Copyright © 2013 ICST. We study the maximum flow on random weighted directed graphs and hypergraphs, that generalize Erdös-Rényi graphs. We show that, for a single unicast connection chosen at random, its capacity, determined by the max-flow between source and sink, converges in probability to the capacity around the source or sink. Using results from network coding, we generalize this result to different types multicast connections, whose capacity is given by the max-flow between the source(s) and sinks. Our convergence results indicate that the capacity of unicast and multicast connections using network coding are, with high probability, unaffected by network size in random networks. Our results generalize to networks with random erasures.
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
10.4108/icst.valuetools.2013.254415
