Networks
The steiner problem with edge lengths 1 and 2,
Information Processing Letters
Multicast routing in datagram internetworks and extended LANs
ACM Transactions on Computer Systems (TOCS)
Steiner's problem in graphs: heuristic methods
Discrete Applied Mathematics - Special issue: combinatorial methods in VLSI
Multicast routing for multimedia communication
IEEE/ACM Transactions on Networking (TON)
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
The Steiner problem in distributed computing systems
Information Sciences: an International Journal
The PIM architecture for wide-area multicast routing
IEEE/ACM Transactions on Networking (TON)
Distributed algorithms for multicast path setup in data networks
IEEE/ACM Transactions on Networking (TON)
Multicast tree generation in networks with asymmetric links
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
A note on distributed multicast routing in point-to-point networks
Computers and Operations Research
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
Degree-constrained multicasting in point-to-point networks
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
BRITE: Universal Topology Generation from a User''s Perspective
BRITE: Universal Topology Generation from a User''s Perspective
Minimum-power multicast routing in static ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
A comparison of the Internet multicast routing protocols
Computer Communications
Multicast routing with end-to-end delay and delay variation constraints
IEEE Journal on Selected Areas in Communications
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem
International Journal of Parallel Programming
Hi-index | 0.00 |
As group applications are becoming widespread, efficient network utilization becomes a growing concern. Multicast transmission represents a necessary lower network service for the wide diffusion of new multimedia network applications. Multicast transmission may use network resources more efficiently than multiple point-to-point messages; however, creating optimal multicast trees (Steiner Tree Problem in networks) is prohibitively expensive. This paper proposes a distributed algorithm for the heuristic solution of the Steiner Tree Problem, allowing the construction of effective distribution trees using a coordination protocol among the network nodes. Furthermore, we propose a novel distributed technique for dynamically updating the multicast tree. The approach proposed has been implemented and extensively tested both in simulation, and on experimental networks. Performance evaluation indicates that the distributed algorithm performs as well as the centralized version, providing good levels of convergence time and communication complexity.