Conferencing on trees
Ali Jalali, David J. Love, Sujay Sanghavi, Bertrand M. Hochwald · 2009
In this paper, we develop an optimal scheme for conferencing (i.e. all-to-all communication), in communication networks. Our scheme uses the minimum sum rate. First we state a lower bound on sum rate and show how to achieve it on networks with tree topology. This result can be used on general networks considering the spanning tree which connects the conferencing nodes.