Distribution of constrained Steiner tree computation in shortest-delay networks

We have studied a real-time multicast routing as a delay constrained Steiner tree problem (CST) in shortest-delay networks where each node has only a limited knowledge about the network. The proposed distributed algorithm for the construction of delay-bounded multicast trees is based on the “cheapest insertion” heuristic, a well-known solution to the conventional Steiner tree problem (ST) in graphs. We have adapted the cheapest insertion heuristic for the constraint version of the Steiner tree problem by introducing a method for suboptimal constrained shortest path computation. We have achieved an effective distribution of the proposed constrained Steiner tree computation using the table passing mechanism, instead of the frequently used “waving” technique. Performance estimations show a good average case behavior as regards the cost and time complexity