ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

An asymptotically optimal push-pull method for multicasting over a random network

Swamy, Vasuki Narasimha and Bhashyam, Srikrishna and Sundaresan, Rajesh and Viswanath, Pramod (2012) An asymptotically optimal push-pull method for multicasting over a random network. In: 2012 IEEE International Symposium on Information Theory Proceedings (ISIT), 1-6 July 2012, Cambridge, MA.

[img] PDF
Info_The_Proc_229_2012.pdf - Published Version
Restricted to Registered users only

Download (2MB) | Request a copy
Official URL: http://dx.doi.org/10.1109/ISIT.2012.6283922

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.

Item Type: Conference Paper
Additional Information: Copyright of this article belongs to IEEE.
Keywords: All-Cast; Broadcast; Erdős–Rényi Random Graph; Flows; Matching; Multicast; Network Coding; Random Graph; Steiner Tree; Tree Packing
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Depositing User: Francis Jayakanth
Date Deposited: 17 Dec 2013 07:11
Last Modified: 17 Dec 2013 07:11
URI: http://eprints.iisc.ac.in/id/eprint/48014

Actions (login required)

View Item View Item