Multicast routing in datagram internetworks and extended LANs
ACM Transactions on Computer Systems (TOCS)
Introduction to algorithms
Multicast routing extensions for OSPF
Communications of the ACM
Distributed algorithms for multicast path setup in data networks
IEEE/ACM Transactions on Networking (TON)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Mechanisms for broadcast and selective broadcast
Mechanisms for broadcast and selective broadcast
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
On Finding Feasible Solutions for the Delay Constrained Group Multicast Routing Problem
IEEE Transactions on Computers
Heuristic algorithms for packing of multiple-group multicasting
Computers and Operations Research
A tabu-search based algorithm for the multicast-streams distribution problem
Computer Networks: The International Journal of Computer and Telecommunications Networking
An FPTAS for Weight-Constrained Steiner Trees in Series-Parallel Graphs
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
On Finding Feasible Solutions to the Group Multicast Routing Problem
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
A PTAS for weight constrained Steiner trees in series-parallel graphs
Theoretical Computer Science
On routing in VLSI design and communication networks
Discrete Applied Mathematics
On Efficiency Group Multicasting Algorithm with Multiple Minimum Steiner Trees
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
Adaptive and intelligent path discovery on-demand for wireless networks using service composition
Expert Systems with Applications: An International Journal
A unified approach for multiple multicast tree construction and max-min fair rate allocation
HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
Packing trees in communication networks
WINE'05 Proceedings of the First international conference on Internet and Network Economics
On routing in VLSI design and communication networks
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
An efficient algorithm for group multicast routing with bandwidth reservation
Computer Communications
| Hi-index | 0.25 |
Multicast is a communication abstract in which a process sends a message to a group of processes. Group multicast is a kind of multicast where only members of the group can multicast to the group and every member of the group is allowed to multicast to the group. The routing of group multicast is to find a set of routing trees, one for each group member, for multicasting messages to the group. The traditional method is to generate each of this set of trees independently from the others and each of the trees is made optimal in terms of network cost. However, the overall network cost of the set of optimal trees may not be optimal. This paper proposes an algorithm for generating a set of routing trees, which aims at optimizing the overall cost of the set of routing trees of the group. Simulations have been done to compare our algorithm with the traditional method in various network situations.