A fast algorithm for improved RS Steiner tree heuristic in multipoint routing

Author

Chang, Jae-Hwan ; Lee, Byeong Gi

Author_Institution

Dept. of Electron. Eng., Seoul Nat. Univ., South Korea

fYear

1994

fDate

1-5 May 1994

Firstpage

706

Abstract

This paper presents a new fast algorithm for the improved RS Steiner tree heuristic. In order to reduce the execution time, we investigate the circumstances under which more than two trees can be united in a single iteration stage as opposed to the original algorithm in which only two trees are united. We implement both the original algorithm and the proposed fast algorithm and perform simulations on various sizes of random graphs to estimate the amount of reduction achieved both in time and in number of iterations. The amount of reduction achieved by the proposed fast algorithm appears to be proportional to the ratio of number of special nodes to network size

Keywords

iterative methods; telecommunication network routing; trees (mathematics); RS Steiner tree heuristic; execution time; fast algorithm; iterations; multipoint routing; network size; nodes; random graphs; simulations; Approximation algorithms; Cost function; Packet switching; Routing; Tree graphs;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, 1994. ICC '94, SUPERCOMM/ICC '94, Conference Record, 'Serving Humanity Through Communications.' IEEE International Conference on

Conference_Location

New Orleans, LA

Print_ISBN

0-7803-1825-0

Type

conf

DOI

10.1109/ICC.1994.368828

Filename

368828