tokens: To explain this phenomenon we notice that 1 ) with a small number of destinations the shortest paths identified by ShP are disjoint , and 2 ) typically , the edges of a tree obtained by shortest paths are more numerous that those of a Steiner tree computed for an identical multicast demand .