Distributed multicast routing in point-to-point networks

A new mechanism for effectively routing packets from a source to multiple destinations in large point-to-point communication networks is presented in this article. As there is no central node with the complete knowledge of network topology, and therefore conventional Steiner tree algorithms can not...

Full description

Saved in:
Bibliographic Details
Published in:Computers & operations research 1997-06, Vol.24 (6), p.521-527
Main Authors: Rugelj, Jože, Klavžar, Sandi
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Communications networks
Exact sciences and technology
Heuristic
Operations research
Routing
Studies
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Transmission and modulation (techniques and equipments)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A new mechanism for effectively routing packets from a source to multiple destinations in large point-to-point communication networks is presented in this article. As there is no central node with the complete knowledge of network topology, and therefore conventional Steiner tree algorithms can not be used, the need for a distributed approach emerges where each node is supposed to know only the topology of its vicinity. A distributed algorithm based on the cheapest insertion heuristics is proposed in this article. Simulation results have shown that the efficiency of the proposed distributed algorithm is practically identical to that of the distributed Kou-Markowsky-Berman algorithm, whereas it substantially surpasses DKMB as regards time complexity.
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/S0305-0548(96)00074-3