New Distributed Multicast Routing and Its Performance Evaluation

Authors:
Takuya Asaka;Takumi Niyoshi;Yoshiaki Tanaka
Affiliations:
-;-;-
Venue:
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
Year:
2000

Citing 7
Cited 0

Steiner problem in networks: a survey

Networks
Minimising packet copies in multicast routing by exploiting geographic spread

ACM SIGCOMM Computer Communication Review
Building shared trees using a one-to-many joining mechanism

ACM SIGCOMM Computer Communication Review
QoSMIC: quality of service sensitive multicast Internet protocol

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Comparison of dynamic multicast routing algorithms for wide-area packet switched (asynchronous transfer mode) networks

INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
ARIES: a rearrangeable inexpensive edge-based on-line steiner algorithm

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Multipoint communication: a survey of protocols, functions, and mechanisms

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

With conventional dynamic routing algorithms, many query messages are required in a distributed environment for efficient multicast routing of any traffic volume. We have developed a dynamic routing algorithm that uses a predetermined path search in which an appropriate multicast path is dynamically constructed by searching only a few nodes. This algorithm can construct an efficient multicast tree for any traffic volume. Simulation has shown that the proposed algorithm is advantageous compared with conventional dynamic routing algorithms when nodes are added to or removed from the multicast group during steady-state simulation.