An Asymptotically Optimal Push-pull Method For Multicasting Over A Random Network

Content Provider	Indian Institute of Science (IISc)
Author	Swamy, Vasuki Narasimha Bhashyam, Srikrishna Sundaresan, Rajesh Viswanath, Pramod
Copyright Year	2012
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.
File Format	PDF
Journal	PeerReviewed
Language	English
Publisher	Institute of Electrical and Electronics Engineers
Publisher Date	2012-01-01
Access Restriction	Authorized
Subject Keyword	Electrical Communication Engineering
Content Type	Text
Resource Type	Article