A Distributed Multicast Routing Algorithm for Real-Time Applications in Wide Area Networks

Authors:
Affiliations:
Venue:
ISPAN '02 Proceedings of the 2002 International Symposium on Parallel Architectures, Algorithms and Networks
Year:
2002

Citing 0
Cited 2

Ant-based distributed constrained steiner tree algorithm for jointly conserving energy and bounding delay in ad hoc multicast routing

ACM Transactions on Autonomous and Adaptive Systems (TAAS)
An iterative distributed algorithm for multi-constraint multicast routing

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose a delay-constrained distributed multicast routing algorithm based on token passing. This algorithm is fully distributed and generates a multicast routing tree, which not only meets the real-time requirement, but also has a sub-optimal network cost. Simulations have been done and the results have shown that the multicast routing tree generated by our algorithm has better performance than previously known results.