ADAPTIVE STEINER TREE BALANCING IN DISTRIBUTED ALGORITHM FOR MULTICAST CONNECTION SETUP

Authors
NOVAK R KANDUS G
Citation
R. Novak et G. Kandus, ADAPTIVE STEINER TREE BALANCING IN DISTRIBUTED ALGORITHM FOR MULTICAST CONNECTION SETUP, Microprocessing and microprogramming, 40(10-12), 1994, pp. 795-798
Citations number
7
Categorie Soggetti
Computer Sciences","Computer Science Hardware & Architecture
Journal title
Microprocessing and microprogramming → ACNP
ISSN journal
01656074
Volume
40
Issue
10-12
Year of publication
1994
Pages
795 - 798
Database
ISI
SICI code
0165-6074(1994)40:10-12<795:ASTBID>2.0.ZU;2-D
Abstract
An algorithm for multicast connection setup based on the distributed T akahashi-Matsuyama algorithm is reviewed. Additional level of unexplor ed parallelism that allows better time performance has been identified . The described improvement is based on the adaptive balancing of the growing Steiner tree during the connection construction process. A sim ulation study on the time complexity indicates a speedup with regard t o the original algorithm as well as to our earlier improvement.