Conferencing on trees

摘要: In this paper, we develop an optimal scheme for conferencing (i.e. all-to-all communication), in communication networks. Our uses the minimum sum rate. First state a lower bound on rate and show how to achieve it networks with tree topology. This result can be used general considering spanning which connects nodes.