Multicast tree construction in network topologies with asymmetric link loads
Shridhar B. Shukla, J. Eric Klinker, Eric B. Boyer · 1994
This paper addresses the problem of constructing multicast trees with reservation of resources. The main features of the approach described are that it tolerates asymmetric traffic loads on network links and algorithmically locates data distribution centers for every multiparticipant interaction. A fast and scalable algorithm for locating distribution centers based on the network load and a priori knowledge of participant's locations and resource requirements is given. To explicitly handle cases of disjoint send and receive paths between two nodes, a protocol to build separate send-trees and receive-trees around the centers located in the above manner is given. Simulation results on various topologies are presented showing that, with the above center location mechanism, center-specific trees yield lower tree cost than source-specific trees for many concurrent senders with only a modest increase in the average path length. The use of distribution centers, a priori information, and sensi...