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)
A LAN emulation model for wireless ATM
International Journal of Network Management
Multicast: concept, problems, routing protocols, algorithms and QoS extensions
Distributed multimedia databases
Heuristic algorithms for packing of multiple-group multicasting
Computers and Operations Research
Design of a multi-sender 3D videoconferencing application over an end system multicast protocol
MULTIMEDIA '03 Proceedings of the eleventh ACM international conference on Multimedia
End system multicast protocol for collaborative virtual environments
Presence: Teleoperators and Virtual Environments - Special issue: Advances in collaborative virtual environments
A survey of combinatorial optimization problems in multicast routing
Computers and Operations Research
Placement of proxy-based multicast overlays
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE/ACM Transactions on Networking (TON)
A proactive tree recovery mechanism for resilient overlay multicast
IEEE/ACM Transactions on Networking (TON)
ViewCast: view dissemination and management for multi-party 3d tele-immersive environments
Proceedings of the 15th international conference on Multimedia
Additive approximation for bounded degree survivable network design
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
End System Multicast routing for multi-party videoconferencing applications
Computer Communications
Placement of proxy-based multicast overlays
Computer Networks: The International Journal of Computer and Telecommunications Networking
A model-driven approach for data collection in sensor networks
PDCN '08 Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks
An optimal VP-based multicast routing in ATM networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
An algorithm for multicast tree generation in networks with asymmetric links
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
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
Upgrading unicast nodes to multicast-capable nodes in all-optical networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Matroidal degree-bounded minimum spanning trees
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Chain-Constrained spanning trees
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Prioritized evolutionary optimization in open session management for 3D tele-immersion
Proceedings of the 4th ACM Multimedia Systems Conference
OSM: Prioritized evolutionary QoS optimization for interactive 3D teleimmersion
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) - Special issue of best papers of ACM MMSys 2013 and ACM NOSSDAV 2013
Hi-index | 0.01 |
Establishing a multicast tree in a point-to-point network of switch nodes, such as a wide-area ATM network, is often modeled as the NP-complete Steiner problem in networks. In this paper, we study algorithms for finding efficient multicast trees in the presence of constraints on the copying ability of the individual switch nodes in the network. We refer to this problem as the degree-constrained multicast tree problem and model it as the degree-constrained Steiner problem in networks. Steiner heuristics for the degree-constrained case are proposed and their simulation results for sparse, point-to-point networks are presented. The results are compared with respect to their quality of solution, cost (running time), and the number of test cases for which no solution could be found. The results of our research indicate that efficient multicast frees can be found in large, sparse networks with small multicast groups even with limited multicast capability in the individual switches. Some of the Steiner heuristics tested yielded degree-constrained multicast trees within 5% of the best heuristic solution found in most of the cases. Even when the fanout of each switch node was restricted to 2, the heuristics we used were able to generate efficient multicast trees in almost all our test networks. Surprisingly few test networks were unsolvable. In those cases where no solution was found by a heuristic, backtracking solved many of the remaining cases. Among the heuristics we used, degree-constrained versions of simple path-distance heuristics such as SPH and SPH-R provided the best tradeoffs between quality of solution and cost.