Peer-to-Peer Multicasting Inspired by Huffman Coding

<table class="table-group" width="800px"><tr class="fig-image" id="a"><td><img alt="312376.fig.0012a" src="https://static.hindawi.com/articles/jcnc/volume-2013/312376/figures/312376.fig.0012a.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(a) </b><i>Speed</i> change</td></tr></table></td></tr><tr class="fig-image" id="b"><td><img alt="312376.fig.0012b" src="https://static.hindawi.com/articles/jcnc/volume-2013/312376/figures/312376.fig.0012b.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(b) </b><i>Network efficiency</i> change </td></tr></table></td></tr></table>

<table>Scenario II: improvement against the reference R tree creation scheme.</table>

Journal of Computer Networks and Communications

fig12

Figure 12

Figure 12: Peer-to-Peer Multicasting Inspired by Huffman Coding 