Download now Free registration required
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. Authors study the trade-o between the space used to store the routing table on each node and the stretch factor of the multicast scheme - the maximum ratio over all sets of nodes between the cost of the multicast route induced by the scheme and the cost of a steiner tree between the same set of target nodes. Authors obtain results in several variants of the problem: labeled - in which the designer can choose polylogarithmic node names, name-independent - in which nodes have arbitrarily chosen names.
- Format: PDF
- Size: 332.1 KB