### Abstract

We consider multicast flow problems where either all of the nodes or only a subset of the nodes may be in session. Traffic from each node in the session has to be sent to every other node in the session. If the session does not consist of all the nodes, the remaining nodes act as relays. The nodes are connected by undirected edges whose capacities are independent and identically distributed random variables. We study the asymptotics of the capacity region (with network coding) in the limit of a large number of nodes, and show that the normalized sum rate converges to a constant almost surely. We then provide a decentralized push-pull algorithm that asymptotically achieves this normalized sum rate.

Original language | English (US) |
---|---|

Title of host publication | 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012 |

Pages | 229-233 |

Number of pages | 5 |

DOIs | |

State | Published - Oct 22 2012 |

Event | 2012 IEEE International Symposium on Information Theory, ISIT 2012 - Cambridge, MA, United States Duration: Jul 1 2012 → Jul 6 2012 |

### Publication series

Name | IEEE International Symposium on Information Theory - Proceedings |
---|

### Other

Other | 2012 IEEE International Symposium on Information Theory, ISIT 2012 |
---|---|

Country | United States |

City | Cambridge, MA |

Period | 7/1/12 → 7/6/12 |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics

### Cite this

*2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012*(pp. 229-233). [6283922] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2012.6283922