Research Article
Peer-to-Peer Multicasting Inspired by Huffman Coding
Table 1
The relation of the basic notions for the Huffman coding and the Huffmies concept.
| Not. | Huffman | Huffmies |
| | Root node | Streaming server | | Ensemble code (Huffman tree) | — | | — | Transmission tree | | Message | Peer | | Set of all messages | Set of all peers in the overlay swarm | | Probability of message generation | Probability of peer being a bad relay (peer aggravation) | | Number of the source alphabet symbols | Maximum number of simultaneous upload connections (slots) | — | Codeword | A route from the root server to a leaf in a transmission tree | | Length of a codeword representing message | Peer level in a transmission tree, (hop distance between and in the tree) | — | Leaf: a message; internal vertex: auxiliary | Leaf: a downloading peer; internal vertex: a downloading and uploading peer | | — | Peers downloading from peer , the offspring of |
|
|