By Topic

Distribution of constrained Steiner tree computation in shortest-delay networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Novak, R. ; Jozef Stefan Inst., Ljubljana Univ., Slovenia ; Rugelj, J.

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

Published in:

Electrotechnical Conference, 1996. MELECON '96., 8th Mediterranean  (Volume:2 )

Date of Conference:

13-16 May 1996